Optimal multi-agent pickup and delivery using branch-and-cut-and-price algorithms
Year of publication: |
2025
|
---|---|
Authors: | Lam, Edward ; Stuckey, Peter J. ; Harabor, Daniel |
Published in: |
Transportation science. - Hanover, Md. : INFORMS, ISSN 1526-5447, ZDB-ID 2015901-8. - Vol. 59.2025, 1, p. 104-124
|
Subject: | automated guided vehicle | column generation | combinatorial Benders cuts | conflict-free routing | multi-agent path finding | multi-agent pickup and delivery | vehicle routing problem | Tourenplanung | Vehicle routing problem | Agentenbasierte Modellierung | Agent-based modeling | Heuristik | Heuristics | Theorie | Theory | Algorithmus | Algorithm | Logistikunternehmen | Logistics provider |
-
A unified branch-price-and-cut algorithm for multicompartment pickup and delivery problems
Aerts-Veenstra, Marjolein, (2024)
-
A unified branch-price-and-cut algorithm for multi-compartment pickup and delivery problems
Aerts-Veenstra, Marjolein, (2023)
-
Becker, Till, (2016)
- More ...
-
Branch-and-cut-and-price for multi-agent path finding
Lam, Edward, (2022)
-
Nutmeg : a MIP and CP hybrid solver using branch-and-check
Lam, Edward, (2020)
-
Lam, Edward, (2022)
- More ...