A Clustering Ant Colony Algorithm for the Long-Term Car Pooling Problem - Université d'Artois Accéder directement au contenu
Article Dans Une Revue International Journal of Swarm Intelligence Research Année : 2012

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

Résumé

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.
Fichier non déposé

Dates et versions

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

Identifiants

Citer

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
8 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More