A Clustering Ant Colony Algorithm for the Long-Term Car Pooling Problem - Université d'Artois Access content directly
Journal Articles International Journal of Swarm Intelligence Research Year : 2012

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

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.
Not file

Dates and versions

hal-03595768 , version 1 (03-03-2022)

Identifiers

Cite

Yuhan Guo, Gilles Goncalves, Tienté Hsu. A Clustering Ant Colony Algorithm for the Long-Term Car Pooling Problem. International Journal of Swarm Intelligence Research, 2012, 3 (2), pp.39-62. ⟨10.4018/jsir.2012040103⟩. ⟨hal-03595768⟩

Collections

UNIV-ARTOIS LGI2A
7 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More