×

A distributed geographic information system for the daily car pooling problem. (English) Zbl 1067.68784

Summary: Following the difficulty of public transport to adequately cover all passenger transportation needs, different innovative mobility services are emerging. Among those are car pooling services, which are based on the idea that sets of car owners having the same travel destination share their vehicles. Until now these systems have had a limited use due to lack of an efficient information processing and communication support. In this study an integrated system for the organization of a car pooling service is presented, using several current Information and Communication Technologies (ICT’s) technologies: web, GIS and SMS. The core of the system is an optimization module which solves heuristically the specific routing problem. The system has been tested in a real-life case study.

MSC:

68U35 Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.)
90B35 Deterministic scheduling theory in operations research
90C27 Combinatorial optimization
90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut

Software:

VRP
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Colorni A, Cordone R, Laniado E, Wolfler Calvo R. L’innovazione nei trasporti: pianificazione e gestione. In: Pallottino S, Sciomachen A. (Eds.), Scienze delle decisioni per i Trasporti, FrancoAngeli, 1999.; Colorni A, Cordone R, Laniado E, Wolfler Calvo R. L’innovazione nei trasporti: pianificazione e gestione. In: Pallottino S, Sciomachen A. (Eds.), Scienze delle decisioni per i Trasporti, FrancoAngeli, 1999.
[2] Baldacci R, Maniezzo V, Mingozzi A. An exact algorithm for the car pooling problem. Proceedings of CASPT-2000, 8th International Conference “Computer-Aided Scheduling of Public Transport”, 2000.; Baldacci R, Maniezzo V, Mingozzi A. An exact algorithm for the car pooling problem. Proceedings of CASPT-2000, 8th International Conference “Computer-Aided Scheduling of Public Transport”, 2000. · Zbl 1165.90555
[3] Mingozzi A, Baldacci R, Maniezzo V. Lagrangean column generation for the car pooling problem. Technical Report WP-CO0002, University of Bologna, S.I., Cesena, Italy, 2000.; Mingozzi A, Baldacci R, Maniezzo V. Lagrangean column generation for the car pooling problem. Technical Report WP-CO0002, University of Bologna, S.I., Cesena, Italy, 2000. · Zbl 1165.90555
[4] Hildmann H. An ants metaheuristic to solve car pooling problems. Master’s thesis, University of Amsterdam, Faculty of Science, Department of Artificial Intelligence, 2001.; Hildmann H. An ants metaheuristic to solve car pooling problems. Master’s thesis, University of Amsterdam, Faculty of Science, Department of Artificial Intelligence, 2001.
[5] Maniezzo V, Carbonaro A, Hildmann H. An ants heuristic for the long-term car pooling problem. In: Onwubolu G, Babu BV (Eds.), New Optimization Techniques in Engineering, 2003, to appear.; Maniezzo V, Carbonaro A, Hildmann H. An ants heuristic for the long-term car pooling problem. In: Onwubolu G, Babu BV (Eds.), New Optimization Techniques in Engineering, 2003, to appear. · Zbl 1078.90519
[6] Telematics for car pooling, 1999, http://195.65.25.24; Telematics for car pooling, 1999, http://195.65.25.24
[7] The New South Wales Government, 1999, http://www.rta.nsw.gov.au./index.htm; The New South Wales Government, 1999, http://www.rta.nsw.gov.au./index.htm
[8] Land of Sky, 1999, http://www.landofsky.org/planning/lu-trans/transp_opts.htm; Land of Sky, 1999, http://www.landofsky.org/planning/lu-trans/transp_opts.htm
[9] Valley Metro, 2000, http://www.valleymetro.maricopa.gov/carpool.html; Valley Metro, 2000, http://www.valleymetro.maricopa.gov/carpool.html
[10] Dailey, D. J.; Loseff, D.; Meyers, D., Seattle smart travelerdynamic ridematching on the world wide web, Transportation Research Part C, 7, 17-32 (1999)
[11] Cordeau J-F, Laporte G. The dial-a-ride problem: variants, modelling issues and algorithms, 4OR-Quarterly journal of the Belgian. French and Italian Operations Research Societies, Forthcoming.; Cordeau J-F, Laporte G. The dial-a-ride problem: variants, modelling issues and algorithms, 4OR-Quarterly journal of the Belgian. French and Italian Operations Research Societies, Forthcoming.
[12] Cordeau J-F, Desaulniers G, Desrosiers J, Solomon MM, Soumis F. Vrp with pickup and delivery. In: Toth P, Vigo D (Eds.), The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications. Philadelphia: SIAM, 2002. p. 225-42.; Cordeau J-F, Desaulniers G, Desrosiers J, Solomon MM, Soumis F. Vrp with pickup and delivery. In: Toth P, Vigo D (Eds.), The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications. Philadelphia: SIAM, 2002. p. 225-42.
[13] Cordeau J-F, Desaulniers G, Desrosiers J, Solomon MM, Soumis F. Vrp with time windows. In: Toth P, Vigo D (Eds.), The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications. Philadelphia: SIAM, 2002. p. 157-93.; Cordeau J-F, Desaulniers G, Desrosiers J, Solomon MM, Soumis F. Vrp with time windows. In: Toth P, Vigo D (Eds.), The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications. Philadelphia: SIAM, 2002. p. 157-93. · Zbl 1076.90543
[14] Mulvey JM, Beck MP, Solving Capacitated Clustering Problems. European Journal of Operational Research 1984;18:339-48.; Mulvey JM, Beck MP, Solving Capacitated Clustering Problems. European Journal of Operational Research 1984;18:339-48.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.