Dynamic ng-path relaxation for the delivery man problem
Year of publication: |
2014
|
---|---|
Authors: | Roberti, Roberto ; Mingozzi, Aristide |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 48.2014, 3, p. 413-424
|
Subject: | column generation | state-space relaxation | traveling salesman problem | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics |
-
Dynamic programming for the minimum tour duration problem
Tilk, Christian, (2017)
-
Dynamic programming for the time-dependent traveling salesman problem with time windows
Lera-Romero, Gonzalo, (2022)
-
A generalized model and a heuristic algorithm for the large-scale covering tour problem
Murakami, Keisuke, (2018)
- More ...
-
An exact solution framework for a broad class of vehicle routing problems
Baldacci, Roberto, (2010)
-
Baldacci, Roberto, (2012)
-
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
Baldacci, Roberto, (2011)
- More ...