Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-28T16:09:32.896Z Has data issue: false hasContentIssue false
  • English
  • Français

A multi-destination daily carpooling problem and an ant colonybased resolution method

Published online by Cambridge University Press:  29 November 2013

Yuhan Guo ,
Gilles Goncalves  and
Tienté Hsu
Yuhan Guo
Affiliation:
Univ Lille Nord de France, 59000 Lille, France. UArtois, LGI2A, 62400, Béthune, France.. [email protected]
Gilles Goncalves
Affiliation:
Univ Lille Nord de France, 59000 Lille, France. UArtois, LGI2A, 62400, Béthune, France.. [email protected]
Tienté Hsu
Affiliation:
Univ Lille Nord de France, 59000 Lille, France. UArtois, LGI2A, 62400, Béthune, France.. [email protected]
Get access

Abstract

The rising car usage deriving from growth in jobs and residential population causes airpollution, energy waste and consumption of people’s time. Public transport cannot be theonly answer to this increasing transport demand. Carpooling, which is based on the ideathat sets of car owners pick up colleagues while driving to or from the workplace, hasemerged to be a viable possibility for reducing private car usage in congested areas. Itsactual 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 themulti-destination carpooling problem. Experiments have been performed to confirm theefficiency and the effectiveness of the approach.

Keywords

Transportationvehicle routingcarpooling problemant colony algorithm
Type
Research Article
Information
RAIRO - Operations Research , Volume 47 , Issue 4: ROADEF 2012 , September 2013 , pp. 399 - 428
Copyright
© EDP Sciences, ROADEF, SMAI 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Baldacci, R., Maniezzo, V. and Mingozzi, A., An exact method for the car pooling problem based on Lagrangian column generation. Oper. Res. 52 (2004) 422–439. Google Scholar
C. Blumenthal, S. Michalak, B. Goble, M. Garner, M. Haselkorn and J. Spyridakis, Bellevue smart traveler: Design, demonstration and assessment, Internet, USA (1997).
Calvo, R.W., Luigib, F., Haastrupc, P. and Maniezzod, V., A distributed geographic information system for the daily car pooling problem. Comput. Oper. Res. Arch. 31 (2004) 2263–2278. Google Scholar
M. Dorigo and T. Stützle, Ant Colony Optimization MIT Press (2004).
Dorigo, M., Maniezzo, V. and Colorni, A., Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Part B 26 (1996) 29–41. Google Scholar
M. Dorigo, Optimization, learning and natural algorithms, Ph.D. Thesis Politecnico di Milano, Italie (1992).
Ferrari, E. and Manzini, R., The car pooling problem: heuristic algorithms based on savings functions. J. Adv. Transp. 37 (2003) 243–272. Google Scholar
Fisher, M.L., The Lagrangian relaxation method for solving integer programming problem. Manag. Sci. 27 (1981) 1–18. Google Scholar
B. Kallehauge, J. Larsen, B.G. Madsen and M.M. Solomon, Vehicle routing problem with time windows Column Generation (2005) 67–98.
A.B. Kothari, Genghis: a multiagent carpooling system. Dissertation, University of Bath, UK (2004).
Li, H. and Lim, A., A metaheuristic for the pickup and delivery problem with time windows. Int. J. Artificial Intell. Tools 12 (2003) 173–186. Google Scholar
Maurizio, B., Diego, C., Alberto, C. and Alessandro, L., PoliUniPool: a car pooling system for universities. Soc. Behavior. Sci. 20 (2011) 558–567. Google Scholar
Meyers, D., Dailey, D.J. and Lose, D., Seattle smart traveler: dynamic ride matching on the World Wide Web. Transp. Res. C 7 (1999) 17–32. Google Scholar
M. Vargas, J. Sefair, J. Walteros, A.L. Medaglia and L. Rivera, Car pooling optimization: a case study in Strasbourg. Systems and Information Engineering Design Symposium, Virginia, USA (2008).