A hybrid large-neighborhood search algorithm for the cumulative capacitated vehicle routing problem with time-window constraints
Authors:
- Ran LiuRLRan Liu
- Zhibin JiangZJZhibin Jiang
- 1 July 2019
- journal article
- research article
- Published by Elsevier in Applied Soft Computing
- Vol. 80, 18-30
Abstract
No abstract availableKeywords
Funding Information
- Science and Technology Innovation Programming, Major Project (17DZ1101200)
This publication has 35 references indexed in Scilit:
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problemEuropean Journal of Operational Research, 2014
- A two-phase metaheuristic for the cumulative capacitated vehicle routing problemComputers & Operations Research, 2013
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problemComputers & Operations Research, 2012
- An effective memetic algorithm for the cumulative capacitated vehicle routing problemComputers & Operations Research, 2010
- Fifty Years of Vehicle RoutingTransportation Science, 2009
- Routing for Relief EffortsTransportation Science, 2008
- An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time WindowsTransportation Science, 2006
- A greedy look-ahead heuristic for the vehicle routing problem with time windowsJournal of the Operational Research Society, 2001
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time WindowsManagement Science, 1988
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window ConstraintsOperations Research, 1987