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.
Mots clés : 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://archive.numdam.org/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://archive.numdam.org/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://archive.numdam.org/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. http://archive.numdam.org/articles/10.1051/ro/2013049/
[1] An exact method for the car pooling problem based on Lagrangian column generation. Oper. Res. 52 (2004) 422-439. | Zbl
, and ,[2] Bellevue smart traveler: Design, demonstration and assessment, Internet, USA (1997).
, , , , and ,[3] A distributed geographic information system for the daily car pooling problem. Comput. Oper. Res. Arch. 31 (2004) 2263-2278. | Zbl
, , and ,[4] Ant Colony Optimization MIT Press (2004). | Zbl
and ,[5] Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Part B 26 (1996) 29-41.
, and ,[6] Optimization, learning and natural algorithms, Ph.D. Thesis Politecnico di Milano, Italie (1992).
,[7] The car pooling problem: heuristic algorithms based on savings functions. J. Adv. Transp. 37 (2003) 243-272.
and ,[8] The Lagrangian relaxation method for solving integer programming problem. Manag. Sci. 27 (1981) 1-18. | MR | Zbl
,[9] Vehicle routing problem with time windows Column Generation (2005) 67-98. | Zbl
, , and ,[10] Genghis: a multiagent carpooling system. Dissertation, University of Bath, UK (2004).
,[11] A metaheuristic for the pickup and delivery problem with time windows. Int. J. Artificial Intell. Tools 12 (2003) 173-186.
and ,[12] PoliUniPool: a car pooling system for universities. Soc. Behavior. Sci. 20 (2011) 558-567.
, , and ,[13] Seattle smart traveler: dynamic ride matching on the World Wide Web. Transp. Res. C 7 (1999) 17-32.
, and ,[14] Car pooling optimization: a case study in Strasbourg. Systems and Information Engineering Design Symposium, Virginia, USA (2008).
, , , and ,Cité par Sources :