Bilayer Local Search Enhanced Particle Swarm Optimization for the Capacitated Vehicle Routing Problem
Open Access
- 15 March 2018
- journal article
- research article
- Published by MDPI AG in Algorithms
- Vol. 11 (3) , 31
Abstract
The classical capacitated vehicle routing problem (CVRP) is a very popular combinatorial optimization problem in the field of logistics and supply chain management. Although CVRP has drawn interests of many researchers, no standard way has been established yet to obtain best known solutions for all the different problem sets. We propose an efficient algorithm Bilayer Local Search-based Particle Swarm Optimization (BLS-PSO) along with a novel decoding method to solve CVRP. Decoding method is important to relate the encoded particle position to a feasible CVRP solution. In bilayer local search, one layer of local search is for the whole population in any iteration whereas another one is applied only on the pool of the best particles generated in different generations. Such searching strategies help the BLS-PSO to perform better than the existing proposals by obtaining best known solutions for most of the existing benchmark problems within very reasonable computational time. Computational results also show that the performance achieved by the proposed algorithm outperforms other PSO-based approaches.Keywords
This publication has 47 references indexed in Scilit:
- Development of a fuel consumption optimization model for the capacitated vehicle routing problemComputers & Operations Research, 2012
- The capacitated vehicle routing problem with stochastic demands and time windowsComputers & Operations Research, 2011
- A hybrid particle swarm optimization algorithm for the vehicle routing problemEngineering Applications of Artificial Intelligence, 2010
- A hybrid genetic – Particle Swarm Optimization Algorithm for the vehicle routing problemExpert Systems with Applications, 2010
- Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problemComputers & Industrial Engineering, 2009
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problemJournal of Zhejiang University-SCIENCE A, 2006
- Expanding Neighborhood GRASP for the Traveling Salesman ProblemComputational Optimization and Applications, 2005
- Optimization by Simulated AnnealingScience, 1983
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- Bases for Vehicle Fleet SchedulingJournal of the Operational Research Society, 1967