Computer-Aided Scheduling of Public Transport pp 253-273 | Cite as
Adaptive Memory Programming for a Class of Demand Responsive Transit Systems
Abstract
In this paper we discuss Demand Adaptive Systems (DAS) which are intended as a hybrid public transportation system that integrates traditional bus transportation and on demand service, DAS lines regularly serve a given set of compulsory stops according to a predefined schedule and regardless of current demand. Between a compulsory stop and the next, optional stops can be activated on demand. Vehicles have to be rerouted and scheduled in order to satisfy as many requests as possible, complying with passage-time constraints at compulsory stops. This paper provides a general description of DAS, and discusses potential applications and solution methods, emphasizing differences and analogies with classical Demand Responsive Systems. The particular mathematical structure of DAS requires innovative solution methods even when addressing its simplest version, the single vehicle, single line case. An efficient meta-heuristic algorithm based on adaptive memory ideas has been developed for this case. The method integrates sophisticated mathematical programming tools into a tabu search framework, taking advantage of the particular structure of the problem. The methodology is briefly discussed and experimental results are presented for the single line case. We show that the basic case can be efficiently solved, thus providing efficient algorithmic building blocks for more comprehensive approaches tackling the general case.
Keywords
Local Search Phase Flexible Service Swap Move Passive User Feasible TourPreview
Unable to display preview. Download preview PDF.
Bibliography
- Borndörfer, R., M. Grötsehel, F. Klostermeier, and C. Küttner (1999). Telebus Berlin: Vehicle scheduling in a dial-a-ride system. In N.H.M. Wilson (Ed.), Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems, 471, Springer, Berlin, 391–422.CrossRefGoogle Scholar
- Carraresi, P., A. Prangioni, and M. Nonato (1996). Applying bundle methods to the optimization of polyhedral functions: An applications oriented development. Ricerca Operativa 25, 5–49.Google Scholar
- Cordeau, J.-F., G. Laporte, and A. Mercier (2000). A unified tabu search heuristic for vehicle routing problems with time windows. Technical Report CRT-2000-03, Centre de Recherche sur les Transports, University of Montreal, Montréal, Canada.Google Scholar
- CPLEX (2000). ILOG CPLEX 7.0 Reference Manual ILOG Inc., CPLEX Division.Google Scholar
- Crainic, T.G., F. Guertin, F. Malucelli, and M. Nonato (2001a). Metaheuristics for a class of demand responsive transit systems. Technical report, Centre de Recherche sur les Transports, University of Montreal, Montreal, Canada.Google Scholar
- Crainic, T.G., F. Malucelli, and M. Nonato (2000). A demand responsive feeder bus system. In Proceedings of the 7th World Congress on Intelligent Transport Systems, 6–9 November 2000, Turin, Italy.Google Scholar
- Crainic, T.G., F. Malucelli, and M. Nonato (2001b). Many-to-few + few-to-many = an almost personalized transit system. TRISTAN IV, São Miguel, Portugal, June 2001.Google Scholar
- Desrosiers, J., Y. Dumas, M.M. Solomon, and F. Soumis (1995). Time constrained routing and scheduling. In M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Eds.), Network Routing, Handbooks in Operations Research and Management Science, 8, Elsevier, Amsterdam, 35–139.Google Scholar
- Ioachim, I., J. Desrosiers, Y. Dumas, M. Solomon, and D. Villeneuve (1995). A request clustering algorithm for door-to-door handicapped transportation. Transportation Science 29, 63–78.CrossRefGoogle Scholar
- Laporte, G. (1992). The travelling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59, 231–247.CrossRefGoogle Scholar
- Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (1985). The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York.Google Scholar
- Malucelli, F. and M. Nonato (2001). Formulations and bounding procedures for optimization problems in demand adaptive transit systems. Technical report, Politecnico di Milano.Google Scholar
- Malucelli, F., M. Nonato, and S. Pallottino (1999). Some proposals on flexible transit. In T. Ciriani, S. Gliozzi, E.L. Johnson, and R. Tadei (Eds.), Operations Research in Industry, Macmillan Press, London, 157–182.Google Scholar
- Savelsbergh, M.W.P. and M. Sol (1995). The general pickup and delivery problem. Transportation Science 29, 17–29.CrossRefGoogle Scholar
- Shen, Y., J.-Y. Potvin, J.-M. Rousseau, and S. Roy (1995). A computer assistant for vehicle dispatching with learning capabilities. Annals of Operations Research 61, 189–211.CrossRefGoogle Scholar