A multi-destination daily carpooling problem and an ant colony based resolution method
RAIRO - Operations Research - Recherche Opérationnelle, Tome 47 (2013) no. 4, pp. 399-428

Voir la notice de l'article provenant de la source Numdam

The rising car usage deriving from growth in jobs and residential population causes air pollution, energy waste and consumption of people's time. Public transport cannot be the only answer to this increasing transport demand. Carpooling, which is based on the idea that sets of car owners pick up colleagues while driving to or from the workplace, has emerged to be a viable possibility for reducing private car usage in congested areas. Its actual practice requires a suitable information system support and, the most important, the capability of effectively solving the underlying combinatorial optimization problem. This paper describes an ant colony algorithm based hybrid approach (HAC) for solving the multi-destination carpooling problem. Experiments have been performed to confirm the efficiency and the effectiveness of the approach.

DOI : 10.1051/ro/2013049
Classification : 90B06
Keywords: transportation, vehicle routing, carpooling problem, ant colony algorithm
@article{RO_2013__47_4_399_0,
     author = {Guo, Yuhan and Goncalves, Gilles and Hsu, Tient\'e},
     title = {A multi-destination daily carpooling problem and an ant colony based resolution method},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {399--428},
     publisher = {EDP-Sciences},
     volume = {47},
     number = {4},
     year = {2013},
     doi = {10.1051/ro/2013049},
     mrnumber = {3143761},
     zbl = {1282.90034},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2013049/}
}
TY  - JOUR
AU  - Guo, Yuhan
AU  - Goncalves, Gilles
AU  - Hsu, Tienté
TI  - A multi-destination daily carpooling problem and an ant colony based resolution method
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2013
SP  - 399
EP  - 428
VL  - 47
IS  - 4
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2013049/
DO  - 10.1051/ro/2013049
LA  - en
ID  - RO_2013__47_4_399_0
ER  - 
%0 Journal Article
%A Guo, Yuhan
%A Goncalves, Gilles
%A Hsu, Tienté
%T A multi-destination daily carpooling problem and an ant colony based resolution method
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2013
%P 399-428
%V 47
%N 4
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2013049/
%R 10.1051/ro/2013049
%G en
%F RO_2013__47_4_399_0
Guo, Yuhan; Goncalves, Gilles; Hsu, Tienté. A multi-destination daily carpooling problem and an ant colony based resolution method. RAIRO - Operations Research - Recherche Opérationnelle, Tome 47 (2013) no. 4, pp. 399-428. doi: 10.1051/ro/2013049

Cité par Sources :