Two-echelon capacitated vehicle routing problem with grouping constraints and simultaneous pickup and delivery
- 27 June 2022
- journal article
- research article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 162, 261-291
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (71821001, 71901189, 71971090, 7210010522)
- Research Grants Council, University Grants Committee (PolyU 15210620)
This publication has 46 references indexed in Scilit:
- Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complexComputers & Operations Research, 2013
- The heterogeneous pickup and delivery problem with configurable vehicle capacityTransportation Research Part C: Emerging Technologies, 2013
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and deliveryOptimization Letters, 2012
- Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing ProblemOptimization Letters, 2012
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and deliveryOperations Research Letters, 2011
- New Families of Valid Inequalities for the Two-Echelon Vehicle Routing ProblemElectronic Notes in Discrete Mathematics, 2010
- Separation algorithms for 0-1 knapsack polytopesMathematical Programming, 2010
- Multistars, partial multistars and the capacitated vehicle routing problemMathematical Programming, 2002
- The multiple vehicle routing problem with simultaneous delivery and pick-up pointsTransportation Research Part A: General, 1989
- A branch and bound algorithm for the capacitated vehicle routing problemOR Spectrum, 1983