Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Tibor, Dulai"'
Publikováno v:
Mathematics, Vol 10, Iss 13, p 2205 (2022)
The Capacitated Arc Routing Problem (CARP) is a combinatorial optimization problem, which requires the identification of such route plans on a given graph to a number of vehicles that generates the least total cost. The Dynamic CARP (DCARP) is a vari
Externí odkaz:
https://doaj.org/article/3072b524b0dc4df2a2194a795660043b
Autor:
Zoltán Süle, János Baumgartner, Dániel Leitold, Tibor Dulai, Ákos Orosz, Ágnes Vathy-Fogarassy
Publikováno v:
Procedia Computer Science. 219:1169-1176
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e76b63a2da805f9dc8c47bee4de4c61
https://doi.org/10.1016/j.procs.2023.01.398
https://doi.org/10.1016/j.procs.2023.01.398
Autor:
Gergely Dombi, Tibor Dulai
Publikováno v:
Acta Universitatis Sapientiae, Informatica. 14:208-222
Despite the practical importance of accurate long-term electricity price forecast with high resolution - and the significant need for that - only small percentage of the tremendous papers on energy price forecast attempted to target this topic. Its r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bbcd47f97f277d2672350b47f41ac50b
https://doi.org/10.2478/ausi-2022-0013
https://doi.org/10.2478/ausi-2022-0013
Publikováno v:
Mathematics, Vol 9, Iss 13, p 1540 (2021)
Bin Packing is one of the research areas of Operations Research with many industrial applications, as well as rich theoretical impact. In this article, the authors deal with Bin Packing on the practical side: they consider two Bin Packing Benchmark c
Externí odkaz:
https://doaj.org/article/a40bd8ecd7aa4fe5820354b188f888f4
Publikováno v:
Central European Journal of Operations Research. 31:21-47
We deal with a model that is called Bin Covering with Delivery. Here we search for a “good and fast” covering. This problem has been defined and investigated recently. Here we continue and significantly augment the preliminary investigations of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::558f2f44518629aabe28e9c7c16f7dac
https://doi.org/10.1007/s10100-022-00798-1
https://doi.org/10.1007/s10100-022-00798-1
Autor:
Peggy Näser, György Dósa, Tibor Dulai, Ronald Ortner, Peter Auer, Armin Fügenschuh, Ágnes Werner-Stark
Publikováno v:
Central European Journal of Operations Research. 29:1079-1113
We deal with a very complex and hard scheduling problem. Two types of products are processed by a heterogeneous resource set, where resources have different operating capabilities and setup times are considered. The processing of the products follows
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf4a45c7fb0c565e363e813a11440659
https://doi.org/10.1007/s10100-020-00689-3
https://doi.org/10.1007/s10100-020-00689-3
Publikováno v:
Mathematics, Vol 9, Iss 1540, p 1540 (2021)
Mathematics
Volume 9
Issue 13
Mathematics
Volume 9
Issue 13
Bin Packing is one of the research areas of Operations Research with many industrial applications, as well as rich theoretical impact. In this article, the authors deal with Bin Packing on the practical side: they consider two Bin Packing Benchmark c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a00cd77b4e699bf6293da01b4353f66e
https://www.mdpi.com/2227-7390/9/13/1540
https://www.mdpi.com/2227-7390/9/13/1540
Publikováno v:
Algorithms for Intelligent Systems ISBN: 9789811632457
In this paper, we present a hybridization of a heuristic scheduler with four different variants of Tabu search (TS) to improve its efficiency when applied to a scheduling problem in mass production. The results obtained by the dour variants are compa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::791617dc669b1a74d484c2d115f9b29d
https://doi.org/10.1007/978-981-16-3246-4_13
https://doi.org/10.1007/978-981-16-3246-4_13
Publikováno v:
Acta Polytechnica Hungarica. 15:101-119
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf176832fd549c59bee339deec49b079
https://doi.org/10.12700/aph.15.4.2018.4.6
https://doi.org/10.12700/aph.15.4.2018.4.6
Publikováno v:
Optimization and Engineering. 19:239-270
This paper presents a new algorithm for solving capacitated single depot vehicle routing problems without time windows in a fault-tolerant manner where the distances between points are symmetrical. The sudden breakdown of a vehicle on its pre-planned
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::beb9d86eeb03412160e640d9d66a97d9
https://doi.org/10.1007/s11081-017-9353-6
https://doi.org/10.1007/s11081-017-9353-6