A generic exact solver for vehicle routing and related problems

Major advances were recently obtained in the exact solution of vehicle routing problems (VRPs). Sophisticated branch-cut-and-price (BCP) algorithms for some of the most classical VRP variants now solve many instances with up to a few hundreds of customers. However, adapting and reimplementing those...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 183; číslo 1-2; s. 483 - 523
Hlavní autoři:	Pessoa, Artur, Sadykov, Ruslan, Uchoa, Eduardo, Vanderbeck, François
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2020 Springer Nature B.V Springer Verlag
Témata:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Computer Science Enumeration Exact solutions Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Operations Research Route planning Theoretical Vehicle routing Integer programming logistics and supply chain management Column generation etc. for problems pertaining to operations research and mathematical programming 90C11 Mixed integer programming 90B06 Transportation source code 90-04 Software Routing 90C06 Large-scale problems in mathematical programming
ISSN:	0025-5610, 1436-4646
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!