Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Diego Pecin"'
Publikováno v:
International Transactions in Operational Research, 28(5), 2633-2690. Blackwell Publishing
Column generation algorithms for solving vehicle routing problems often rely on a relaxed pricing subproblem where routes may be nonelementary and which is solved by a labeling algorithm. This pricing algorithm is said to be selective if it can disca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3cdeb0e7bc587ffc6e7aa0decc8d43cb
https://doi.org/10.1111/itor.12911
https://doi.org/10.1111/itor.12911
Publikováno v:
INFORMS Journal on Computing, 32(1), 16-39. INFORMS Institute for Operations Research and the Management Sciences
Despite recent interest in multiobjective integer programming, few algorithms exist for solving biobjective mixed integer programs. We present such an algorithm: the boxed line method. For one of its variants, we prove that the number of single-objec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f803adb9b6a6fe74b84b7e0dfcad96b3
https://pure.eur.nl/en/publications/976c3aa8-6703-4805-a2f7-ff8c0dfae66d
https://pure.eur.nl/en/publications/976c3aa8-6703-4805-a2f7-ff8c0dfae66d
Autor:
Eduardo Uchoa, Diego Pecin
Publikováno v:
Transportation Science. 53:1673-1694
The current best exact algorithms for the Capacitated Arc Routing Problem are based on the combination of cut and column generation. This work presents a deep theoretical investigation of the formulations behind those algorithms, classifying them and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce389f0ab407d799d95bde64c29520e1
https://doi.org/10.1287/trsc.2019.0900
https://doi.org/10.1287/trsc.2019.0900
Publikováno v:
EURO Journal on transportation and logistics, 8(2), 147-168. Springer-Verlag
Branch-price-and-cut is a leading methodology for solving various vehicle routing problems (VRPs). For many VRPs, the pricing subproblem of a branch-price-and-cut algorithm is highly time consuming, and to alleviate this difficulty, a relaxed pricing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6bf34fd9f329aa343fa6f44e9fa7d0fc
https://doi.org/10.1007/s13676-017-0112-9
https://doi.org/10.1007/s13676-017-0112-9
Publikováno v:
INFORMS Journal on Computing. 29:489-502
The vehicle routing problem with time windows VRPTW consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited within specific time windows. We introduce two enhancements for the exact solution of the VRPTW
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a4682fe729ac5d1e562b647d68c66ca
https://doi.org/10.1287/ijoc.2016.0744
https://doi.org/10.1287/ijoc.2016.0744
Publikováno v:
Operations Research Letters. 45:206-209
Pecin etal. (2016) introduced a limited memory technique that allows an efficient use of Rank-1 cuts in the Set Partitioning Formulation of Vehicle Routing Problems, motivating a deeper investigation of those cuts. This work presents a computational
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5577c5ac2a748255dfe6884ce1a99697
https://doi.org/10.1016/j.orl.2017.02.006
https://doi.org/10.1016/j.orl.2017.02.006
Autor:
Thibaut Vidal, Artur Alves Pessoa, Anand Subramanian, Marcus Poggi, Diego Pecin, Eduardo Uchoa
Publikováno v:
European Journal of Operational Research. 257:845-858
The recent research on the CVRP is being slowed down by the lack of a good set of benchmark instances. The existing sets suffer from at least one of the following drawbacks: (i) became too easy for current algorithms; (ii) are too artificial; (iii) a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d04c0338318c7df507cd88a35c92d20e
https://doi.org/10.1016/j.ejor.2016.08.012
https://doi.org/10.1016/j.ejor.2016.08.012
Publikováno v:
Mathematical Programming Computation. 9:61-100
The best performing exact algorithms for the capacitated vehicle routing problem developed in the last 10 years are based in the combination of cut and column generation. Some authors only used cuts expressed over the variables of the original formul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d40bad5895125142717cee080bfbd0f9
https://doi.org/10.1007/s12532-016-0108-8
https://doi.org/10.1007/s12532-016-0108-8
Publikováno v:
European Journal of Operational Research. 239:102-111
Column generation is involved in the current most efficient approaches to routing problems. Set partitioning formulations model routing problems by considering all possible routes and selecting a subset that visits all customers. These formulations o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f012b4df5e716130b2a0d386cbeddd1b
https://doi.org/10.1016/j.ejor.2014.05.005
https://doi.org/10.1016/j.ejor.2014.05.005
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783319075563
IPCO
IPCO
The best performing exact algorithms for the Capacitated Vehicle Routing Problem are based on the combination of cut and column generation. Some authors could obtain reduced duality gaps by also using a restricted number of cuts over the Master LP va
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::abd9616f0cb50a43673aa1cc675ee1bf
https://doi.org/10.1007/978-3-319-07557-0_33
https://doi.org/10.1007/978-3-319-07557-0_33
