Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
Year of publication: |
2024
|
---|---|
Authors: | Schulz, Arne ; Pfeiffer, Christian |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 312.2024, 2 (16.1.), p. 456-472
|
Subject: | Branch-and-cut | Dial-a-ride problem | Fixed paths | Routing | Valid inequalities | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming |
-
A branch-and-cut algorithm for the hub location and routing problem
Rodríguez-Martín, Immaculada, (2014)
-
A branch-and-cut algorithm for an assembly routing problem
Chitsaz, Masoud, (2020)
-
A branch-and-cut algorithm for the inventory routing problem with product substitution
Mahmutoğulları, Özlem, (2023)
- More ...
-
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
Pfeiffer, Christian, (2021)
-
Levelling crane workload in multi-yard rail-road container terminals
Schulz, Arne, (2021)
-
A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types
Schulz, Arne, (2024)
- More ...