A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem
Authors:
- Kun LiKLKun Li
- Huixin TianHTHuixin Tian
- 1 June 2016
- journal article
- Published by Elsevier in Applied Soft Computing
- Vol. 43, 469-479
Abstract
No abstract availableKeywords
Funding Information
- Natural Science Foundation of China (61403277)
- Humanities and Social Science Research Projects for Colleges in Tianjin (20132151)
This publication has 39 references indexed in Scilit:
- An Adaptive Variable Neighborhood Search for a Heterogeneous Fleet Vehicle Routing Problem with Three-Dimensional Loading ConstraintsIEEE Computational Intelligence Magazine, 2014
- An ant colony algorithm for the multi-compartment vehicle routing problemApplied Soft Computing, 2014
- Multiple Phase Neighborhood Search-GRASP for the Capacitated Vehicle Routing ProblemExpert Systems with Applications, 2012
- Vehicle routing scheduling using an enhanced hybrid optimization approachJournal of Intelligent Manufacturing, 2010
- A scatter search algorithm for solving vehicle routing problem with loading costExpert Systems with Applications, 2010
- The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problemApplied Soft Computing, 2010
- Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithmExpert Systems with Applications, 2009
- An effective evolutionary algorithm for the practical capacitated vehicle routing problemsJournal of Intelligent Manufacturing, 2008
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problemsComputers & Operations Research, 2007
- Scatter search for the vehicle routing problem with time windowsEuropean Journal of Operational Research, 2006