Abstract
Transportation on-demand represents a mode of transport in which a set of users formulate transport requests between pickup and delivery points, which must be served by means of vehicles of a given capacity. When the items to be transported are people, it is necessary to simultaneously consider a minimization of operating costs (perspective of transportation systems managers) and a reduction of the inconveniences for the user. An unexpected failure of planned scheduling in the transport system (e.g. a failure in the engine of a train) may cause a service disruption to a large number of passengers who would remain isolated at origin stations. The result of that situation would be a scattered distributed population in points, with a heterogeneous demand in terms of destinations and specific requirements of service. In this paper, a model of transportation on-demand is formulated to address an incidence which happens in a transit line (metro, trains), forcing to reschedule the service in such transit lines. The goal is to minimize the total cost associated to the delay experienced by users who have to be served by an auxiliary fleet to attend this incidence.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Arriola, R., Ortega, F.A., Pozo M.A.: Aplicación de los Problemas Pickup and Delivery en la Gestión de Emergencias de un Sistema de Ferrocarril. Actas de las II Jornadas sobre Modelos de Optimización Aplicados a la Planificación Robusta y la Gestión de los servicios de transporte en caso de Emergencia (MORE 2009), Sevilla, España, pp. 55–64 (2009). ISBN-13:978-84-692-6689-2
Baldacci, R., Bartolini, E., Mingozzi, A.: An exact algorithm for the pickup and delivery problem with time windows. Oper. Res. 59(2), 414–426 (2011)
Bent, R., Hentenryck, P.V.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput. Oper. Res. 33, 875–893 (2006)
Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP 15, 1–31 (2007)
Cepeda, M., Cominetti, R., Florian, M.: A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria. Transp. Res. B 40, 437–459 (2006)
Cordeau, J.-F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54, 573–586 (2006)
Cortés, C.E., Matamala, M., Contardo, C.: The pickup-and-delivery problem with transfers: formulation and a branch-and-cut solution method. Eur. J. Oper. Res. 200, 711–724 (2010)
Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F.: VRP with pickup and delivery. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, pp. 225–242 (2002)
Dumas, Y., Desrosiers, J., Soumis, F.: Large scale multi-vehicle dial-a-ride problems. Les Cahiers du GERAD, G-89-30, HEC Montréal (1989)
Eberlein, X.J., Wilson, N.H., Barnhart, C., Bernstein, D.: The real-time deadheading problem in transit operations control. Transp. Res. Part B 32, 77–100 (1998)
Freyss, M., Giesen, R., Muñoz, J.C.: Continuous approximation for skip-stop operation in rail transit. Transp. Res. Part C 36, 419–433 (2013)
Furuhata, M., Dessouky, M., Ordóñez, F., Brunet, M., Wang, X., Koenig, S.: Ridesharing: the state-of-the-art and future directions. Transp. Res. Part B 57, 28–46 (2013)
Ioachim, I., Desrosiers, J., Dumas, Y., Solomon, M.M.: A request clustering algorithm for door-todoor handicapped transportation. Transp. Sci. 29(1), 63–78 (1995)
Jørgensen, R.M., Larsen, J., Bergvinsdottir, K.B.: Solving the dial-a-ride problem using genetic algorithms. J. Oper. Res. Soc. 58, 1321–1331 (2007)
Leiva, C., Muñoz, J.C., Giesen, R., Larrain, H.: Design of limited-stop services for an urban bus corridor with capacity constraints. Transp. Res. B 44, 1186–1201 (2010)
Lin, D., Ku, Y.: Using genetic algorithms to optimize stopping patterns for passenger rail transportation. Comput. Aided Civ. Infrastruct. Eng. 29, 264–278 (2014)
Lu, Q., Dessouky, M.: An exact algorithm for the multiple vehicle pickup and delivery problem. Transp. Sci. 38(4), 503–514 (2004)
Melachrinoudis, E., Ilhan, A.B., Min, H.: A dial-a-ride problem for client transportation in a healthcare organization. Comput. Oper. Res. 34, 742–759 (2007)
Mesa, J.A., Ortega, F.A., Pozo, M.A.: Effective allocation of fleet frequencies by reducing intermediate stops and short turning in transit systems. In: Ahuja, R.K., Möhring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 293–309. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-05465-5_12
Mesa, J.A., Ortega, F.A., Pozo, M.A.: Locating optimal timetables and vehicle schedules in a transit line. Ann. Oper. Res. 222, 439–455 (2014)
Mitrović-Minić, S., Laporte, G.: Waiting strategies for the dynamic pickup and delivery problem with time windows. Transp. Res. B 38, 635–655 (2004)
Mitrović-Minić, S., Krishnamurti, R., Laporte, G.: Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transp. Res. B 38, 669–685 (2004)
Nanry, W.P., Barnes, J.W.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transp. Res. B 34, 107–121 (2000)
Ortega, F.A., Mesa, J.A., Pozo, M.A.: Robustez Ante Incidencias en el Diseño TopolĂłgico de Redes Metropolitanas de Transporte PĂşblico. Actas del VIII Congreso de IngenierĂa del Transporte. A Coruña, España (2008). ISBN 978-84-380-03
Ropke, S., Cordeau, J.-F.: Branch and cut and price for the pickup and delivery problem with time windows. Transp. Sci. 43, 267–286 (2009)
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455–472 (2006)
Tirachini, A., CortĂ©s, C.E., Jara-DĂaz, S.: Estrategia Integrada de AsignaciĂłn de Flota en un Corredor de Transporte PĂşblico. Actas del XIII Congreso Chileno de IngenierĂa de Transporte, Santiago, Chile (2007)
Acknowledgements
This research has been partially supported by the Spanish Ministry of Science and Education through grants MTM2013-46962-C02-01 (MICINN, Spain) and MTM2016-74983-C2-1-R, and finally by the FEDER funds of the European Union. This support is gratefully acknowledged.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Ortega, F.A., Mesa, J.A., Pozo, M.A. (2018). Determining Routes for an Auxiliary Fleet in Presence of Emergencies on a Railway Line. In: Temponi, C., Vandaele, N. (eds) Information Systems, Logistics, and Supply Chain. ILS 2016. Lecture Notes in Business Information Processing, vol 262. Springer, Cham. https://doi.org/10.1007/978-3-319-73758-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-73758-4_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73757-7
Online ISBN: 978-3-319-73758-4
eBook Packages: Computer ScienceComputer Science (R0)