A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
Year of publication: |
2024
|
---|---|
Authors: | Domínguez-Martín, Bencomo ; Hernández-Pérez, Hipólito ; Riera-Ledesma, Jorge ; Rodríguez-Martín, Inmaculada |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 161.2024, Art.-No. 106426, p. 1-16
|
Subject: | Location | Branch-and-cut | Pickup and delivery | Routing | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics | Betriebliche Standortwahl | Firm location choice |
-
A branch-and-cut algorithm for the alternative fuel refueling station location problem with routing
Arslan, Okan, (2019)
-
Wu, Yuehui, (2022)
-
Wu, Yuehui, (2024)
- More ...
-
An exact algorithm for a vehicle-and-driver scheduling problem
Domínguez-Martín, Bencomo, (2017)
-
The driver and vehicle routing problem
Domínguez-Martín, Bencomo, (2018)
-
An efficient multistart heuristic for the driver and vehicle routing problem
Domínguez-Martín, Bencomo, (2023)
- More ...