Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Túlio A. M. Toffolo"'
Publikováno v:
Transportation Science. 57:463-481
Neighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics. Whereas neighborhood exploration procedures are well-developed for problems with individual services, their counterparts for one-to-one pi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c545093e455a61b037d8c667dc661b6
https://doi.org/10.1287/trsc.2022.1176
https://doi.org/10.1287/trsc.2022.1176
Publikováno v:
Journal of Scheduling. 25:273-286
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::787ea57e86ffa3a9d2abd8a88d3a18dc
https://doi.org/10.1007/s10951-022-00738-6
https://doi.org/10.1007/s10951-022-00738-6
Publikováno v:
Annals of Operations Research. 312:581-606
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f6cf16842a15e03262393155b9de1ce
https://doi.org/10.1007/s10479-022-04525-6
https://doi.org/10.1007/s10479-022-04525-6
Publikováno v:
Computers & Operations Research. 105:118-131
We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based on vehicle-to-customer “assignment” and visits “sequencing” decision variables. We show that an heuristic search focused on assignment decision
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::439ead3e363dafbbb89d5bdec8df9796
https://doi.org/10.1016/j.cor.2018.12.023
https://doi.org/10.1016/j.cor.2018.12.023
Publikováno v:
Annals of Operations Research, 275(1), 223-243. Springer
The sport teams grouping problem (STGP) concerns the assignment of sport teams to round-robin tournaments. The objective is to minimize the total travel distance of the participating teams while simultaneously respecting fairness constraints. The STG
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93573efe9cdd08f16dc27015ed752751
https://doi.org/10.1007/s10479-017-2595-z
https://doi.org/10.1007/s10479-017-2595-z
In this paper, we introduce the Double Traveling Salesman Problem with Partial Last-In-First-Out Loading Constraints (DTSPPL). It is a pickup-and-delivery single-vehicle routing problem, where all pickup operations must be performed before any delive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d79f2e9190a704da0d1723c7a4c3d44
https://hdl.handle.net/11380/1210717
https://hdl.handle.net/11380/1210717
Publikováno v:
Journal of Quantitative Analysis in Sports. 15:41-57
The Traveling Umpire Problem (TUP) is a combinatorial optimization problem concerning the assignment of umpires to the games of a fixed double round-robin tournament. The TUP draws inspiration from the real world multi-objective Major League Baseball
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::251ec6717f814864460f747cbc3847fa
https://doi.org/10.1515/jqas-2017-0118
https://doi.org/10.1515/jqas-2017-0118
Autor:
Tony Wauters, Túlio A. M. Toffolo, Greet Van den Berghe, Vinícius Gandra, Marco Antonio Moreira de Carvalho, Hatice Calik
Publikováno v:
Computers & Industrial Engineering. 160:107609
The two-echelon location routing problem (2E-LRP) arises in freight distribution when goods available at different origins are delivered to their respective destinations via intermediate facilities. The literature concerning the 2E-LRP considers frei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7cc7dbb70b9ee04c08ce617b7b653f9
https://doi.org/10.1016/j.cie.2021.107609
https://doi.org/10.1016/j.cie.2021.107609
Publikováno v:
EURO Journal on Computational Optimization, Vol 5, Iss 1, Pp 285-307 (2017)
The traditional set of manufacturing scheduling problems concern general and easy-to-measure economic objectives such as makespan and tardiness. The variable nature of energy costs over the course of the day remains mostly ignored by most previous re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3dadb5a1fe66302372ab11e3d7ea82f
https://doi.org/10.1007/s13675-016-0072-0
https://doi.org/10.1007/s13675-016-0072-0
Publikováno v:
European Journal of Operational Research. 257:526-538
Efficient container loading has the potential to considerably reduce logistics and transportation costs. The container loading problem is computationally complex and, despite extensive academic effort, there remains room for algorithm improvement. Re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a0c0551ab7d5c9eef7ddc158ee59380
https://doi.org/10.1016/j.ejor.2016.07.033
https://doi.org/10.1016/j.ejor.2016.07.033