Abstract
The rising auto usage deriving from growth in jobs and residential population is making traffic congestion less tolerable in urban and suburban areas. This results in air pollution, energy waste and unproductive and unpleasant consumption of people’s time. Public transport cannot be the only answer to this increasing transport demand. Car pooling 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, most important, the capability of effectively solving the underlying combinatorial optimization problem. This paper presents an application of the ANTS approach, one of the approaches which follow the Ant Colony Optimization (ACO) paradigm, to the car pooling optimization problem. Computational results are presented both on datasets derived from the literature about problems similar to car pooling and on real-world car pooling instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Valley Metro Regional Public Transportation Authority. http://www.valleymetro.maricopa.gov/Rideshare/index.html, 2000.
R. Baldacci, V. Maniezzo, and A. Mingozzi. An exact algorithm for the car pooling problem. In Proceedings of CASPT - 2000, 8th International Conference “Computer-Aided Scheduling of Public Transport”, 2000.
ATC Corporate. http://www.intelitran.com, 2000.
M. Dorigo, V. Maniezzo, and A. Colorni. The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26 (1): 29–41, 1996.
D.Vigo. Heuristic approaches for the car pooling problem. Technical Report DEIS - OR - 00–02, University of Bologna, Italy, 2000.
M. Fischetti and P. Toth. An additive bounding procedure for combinatorial optimization problems. Operations Research, 37, 1989.
Telematics for car pooling. http://195.65.25.241999.
The New South Wales Government. http://www.rta.nsw.gov.au./index.htm, 1999.
H. Hildmann. An ants metaheuristic to solve car pooling problems. M.Sc. AI thesis, University of Amsterdam, Faculty of Science, Department of Artificial Intelligence, 2001.
V. Maniezzo. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing, 11 (4): 358–369, 1999.
V. Maniezzo and A. Carbonaro. An ants heuristic for the frequency assignment problem. In Proceedings of MIC’99, 1999.
V. Maniezzo and A. Carbonaro. Ant Colony Optimization: an Overview, volume Recent Advances in Metaheuristics. Kluwer, 2001.
V. Maniezzo, A. Carbonaro, D. Vigo, and H. Hildmann. An ants algorithm for the car pooling problem. In Proceedings of ANTS’2000, 2nd International Conference “Ant Colony Optimization”, 2000.
V. Maniezzo, Mendes I., and Paruccini M. Decision support for siting problems. Int. Journal of Decision Support Systems, 23: 273–284, 1998.
A. Mingozzi, R. Baldacci, and V. Maniezzo. Lagrangean column generation for the car pooling problem. Technical Report WP-CO0002, University of Bologna, S.I., Cesena, Italy, 2000 (Operations Research,to appear).
N. Mladenovic and P. Hansen. Variable Neighborhood Search, volume Recent Advances in Metaheuristics. Kluwer, 2001.
Land of Sky Regional Council. Commute connections project report., 1999.
Inc. Trapeze Software Group. http://www.trapezesoftware.com, 2001.
E. Turban. Decision support and expert systems. Macmillan Publishing Company, 1990.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Maniezzo, V., Carbonaro, A., Hildmann, H. (2004). An ANTS Heuristic for the Long — Term Car Pooling Problem. In: New Optimization Techniques in Engineering. Studies in Fuzziness and Soft Computing, vol 141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39930-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-39930-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05767-0
Online ISBN: 978-3-540-39930-8
eBook Packages: Springer Book Archive