Efficient Heuristics for Large-Scale Vehicle Routing Problems Using Particle Swarm Optimization

Efficient Heuristics for Large-Scale Vehicle Routing Problems Using Particle Swarm Optimization

A. Chandramouli, L. Vivek Srinivasan, T. T. Narendran
Copyright: © 2012 |Volume: 3 |Issue: 2 |Pages: 17
ISSN: 1948-5018|EISSN: 1948-5026|EISBN13: 9781466612303|DOI: 10.4018/jgc.2012070103
Cite Article Cite Article

MLA

Chandramouli, A., et al. "Efficient Heuristics for Large-Scale Vehicle Routing Problems Using Particle Swarm Optimization." IJGC vol.3, no.2 2012: pp.34-50. http://doi.org/10.4018/jgc.2012070103

APA

Chandramouli, A., Srinivasan, L. V., & Narendran, T. T. (2012). Efficient Heuristics for Large-Scale Vehicle Routing Problems Using Particle Swarm Optimization. International Journal of Green Computing (IJGC), 3(2), 34-50. http://doi.org/10.4018/jgc.2012070103

Chicago

Chandramouli, A., L. Vivek Srinivasan, and T. T. Narendran. "Efficient Heuristics for Large-Scale Vehicle Routing Problems Using Particle Swarm Optimization," International Journal of Green Computing (IJGC) 3, no.2: 34-50. http://doi.org/10.4018/jgc.2012070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper addresses the Capacitated Vehicle Routing Problem (CVRP) with a homogenous fleet of vehicles serving a large customer base. The authors propose a multi-phase heuristic that clusters the nodes based on proximity, orients them along a route, and allots vehicles. For the final phase of determining the routes for each vehicle, they have developed a Particle Swarm Optimization (PSO) approach. Benchmark datasets as well as hypothetical datasets have been used for computational trials. The proposed heuristic is found to perform exceedingly well even for large problem instances, both in terms of quality of solutions and in terms of computational effort.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.