Branch-price-and-cut for the Mixed Capacitated General Routing Problem with time windows
Year of publication: |
16 May 2018
|
---|---|
Authors: | Ciancio, Claudio ; Laganá, Demetrio ; Vocaturo, Francesca |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 267.2018, 1 (16.5.), p. 187-199
|
Subject: | General routing problem | Graph transformation | Integer programming | Column generation | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Graphentheorie | Graph theory |
-
Two-phase branch-and-cut for the mixed capacitated general routing problem
Irnich, Stefan, (2015)
-
Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks
Dib, Omar, (2017)
-
Deutsche Bahn schedules train rotations using hypergraph optimization
Borndörfer, Ralf, (2021)
- More ...
-
An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
Grandinetti, Lucio, (2012)
-
Orlis, Christos, (2020)
-
An exact solution framework for multitrip vehicle-routing problems with time windows
Paradiso, Rosario, (2020)
- More ...