A column generation approach for location-routing problems with pickup and delivery
Authors:
- Thomas CapelleTCThomas Capelle
- Cristián E. CortésCCCristián E. Cortés
- Michel GendreauMGMichel Gendreau
- Pablo A. ReyPRPablo A. Rey
- Louis-Martin RousseauLRLouis-Martin Rousseau
- 1 January 2019
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 272 (1) , 121-131
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logisticsComputers & Operations Research, 2012
- A hierarchical algorithm for the planar single-facility location routing problemComputers & Operations Research, 2012
- Dynamic pickup and delivery problemsEuropean Journal of Operational Research, 2010
- Hubbing and routing in postal delivery systemsAnnals of Operations Research, 2010
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms4OR, 2003
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- Expected Distances in Distribution ProblemsJournal of the Operational Research Society, 1969
- Cost Functions in the Location of Depots for Multiple-Delivery JourneysJournal of the Operational Research Society, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959