Welcome to the InfoSci Platform
Reference Hub5
A Clustering Ant Colony Algorithm for the Long-Term Car Pooling Problem

A Clustering Ant Colony Algorithm for the Long-Term Car Pooling Problem

Yuhan Guo, Gilles Goncalves, Tienté Hsu
Copyright: © 2012 |Volume: 3 |Issue: 2 |Pages: 24
ISSN: 1947-9263|EISSN: 1947-9271|EISBN13: 9781466614345|DOI: 10.4018/jsir.2012040103
Cite Article Cite Article

MLA

Guo, Yuhan, et al. "A Clustering Ant Colony Algorithm for the Long-Term Car Pooling Problem." IJSIR vol.3, no.2 2012: pp.39-62. http://doi.org/10.4018/jsir.2012040103

APA

Guo, Y., Goncalves, G., & Hsu, T. (2012). A Clustering Ant Colony Algorithm for the Long-Term Car Pooling Problem. International Journal of Swarm Intelligence Research (IJSIR), 3(2), 39-62. http://doi.org/10.4018/jsir.2012040103

Chicago

Guo, Yuhan, Gilles Goncalves, and Tienté Hsu. "A Clustering Ant Colony Algorithm for the Long-Term Car Pooling Problem," International Journal of Swarm Intelligence Research (IJSIR) 3, no.2: 39-62. http://doi.org/10.4018/jsir.2012040103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Along with the increase of population and the dispersion of habitation, the use of private cars has been increasing drastically. More and more vehicles on the road have caused significant traffic congestion, noise, and energy waste. Car pooling, which is based on the idea that sets of car owners having the same travel destination share their vehicles, has emerged to be a viable possibility for reducing private car usage around the world. This paper describes a clustering ant colony algorithm for solving the long-term car pooling problem. Computational results are given to show the superiority of the authors’ approach compared with other metaheuristics.

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.