A tailored Benders decomposition approach for last-mile delivery with autonomous robots
Authors:
- Laurent AlfandariLALaurent Alfandari
- Ivana LjubićILIvana Ljubić
- Marcos De Melo da SilvaMSMarcos De Melo da Silva
Open Access
- 1 June 2022
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 299 (2) , 510-525
Abstract
No abstract availableKeywords
This publication has 51 references indexed in Scilit:
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing ProblemsOperations Research, 2012
- Models for relief routing: Equity, efficiency and efficacyTransportation Research Part E: Logistics and Transportation Review, 2012
- A note on the selection of Benders’ cutsMathematical Programming, 2010
- Practical enhancements to the Magnanti–Wong methodOperations Research Letters, 2008
- An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree ProblemMathematical Programming, 2005
- Locating median cycles in networksEuropean Journal of Operational Research, 2005
- The Ring Star Problem: Polyhedral analysis and exact algorithmNetworks, 2004
- On Implementing the Push—Relabel Method for the Maximum Flow ProblemAlgorithmica, 1997
- Accelerating Benders' decomposition for the capacitated facility location problemMathematical Methods of Operations Research, 1996
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962