A HYBRID PSO ALGORITHM FOR THE CVRP PROBLEM

Yucheng Kao, Mei Chen

2011

Abstract

The Capacitated Vehicle Routing Problem (CVRP) has been studied over five decades. The goal of CVRP is to minimize the total distance travelled by vehicles under the constraints of vehicles’ capacity. Because CVRP is a kind of NP-hard problem, a number of meta-heuristics have been proposed to solve the problem. The objective of this paper is to propose a hybrid algorithm combining Combinatorial Particle Swarm Optimization (CPSO) with Simulated Annealing (SA) for solving CVRP. The experimental results show that the proposed algorithm can be viewed as an effective approach for solving the CVRP.

Paper Citation

in Harvard Style

Kao Y. and Chen M. (2011). A HYBRID PSO ALGORITHM FOR THE CVRP PROBLEM . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FEC, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 539-543. DOI: 10.5220/0003724005390543

in Bibtex Style

@conference{fec11,
author={Yucheng Kao and Mei Chen},
title={A HYBRID PSO ALGORITHM FOR THE CVRP PROBLEM},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FEC, (IJCCI 2011)},
year={2011},
pages={539-543},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003724005390543},
isbn={978-989-8425-83-6},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: FEC, (IJCCI 2011)
TI - A HYBRID PSO ALGORITHM FOR THE CVRP PROBLEM
SN - 978-989-8425-83-6
AU - Kao Y.
AU - Chen M.
PY - 2011
SP - 539
EP - 543
DO - 10.5220/0003724005390543