A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types
Year of publication: |
2024
|
---|---|
Authors: | Schulz, Arne ; Pfeiffer, Christian |
Published in: |
Transportation research : an international journal. - Oxford : Pergamon, Elsevier Science, ZDB-ID 2013782-5. - Vol. 181.2024, Art.-No. 103394, p. 1-22
|
Subject: | Branch-and-Cut | Dial-a-ride problem | Mixed-integer programming | Ridepooling | Valid inequalities |
-
Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
Schulz, Arne, (2024)
-
Partial objective inequalities for the multi-item capacitated lot-sizing problem
Büyüktahtakın, İ. Esra, (2018)
-
A new formulation for the dial-a-ride problem
Rist, Yannik, (2021)
- More ...
-
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
Pfeiffer, Christian, (2021)
-
Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
Schulz, Arne, (2024)
-
Levelling crane workload in multi-yard rail-road container terminals
Schulz, Arne, (2021)
- More ...