Skip to main content
SpringerLink
Log in

Determining Routes for an Auxiliary Fleet in Presence of Emergencies on a Railway Line

  • Conference paper
  • First Online:
Information Systems, Logistics, and Supply Chain (ILS 2016)

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 262))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

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

    Google Scholar 

  • 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)

    Article  MathSciNet  Google Scholar 

  • 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)

    Article  Google Scholar 

  • Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP 15, 1–31 (2007)

    Article  MathSciNet  Google Scholar 

  • 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)

    Article  Google Scholar 

  • Cordeau, J.-F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54, 573–586 (2006)

    Article  MathSciNet  Google Scholar 

  • 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)

    Article  MathSciNet  Google Scholar 

  • 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)

    Google Scholar 

  • 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)

    Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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)

    Article  Google Scholar 

  • Lin, D., Ku, Y.: Using genetic algorithms to optimize stopping patterns for passenger rail transportation. Comput. Aided Civ. Infrastruct. Eng. 29, 264–278 (2014)

    Article  Google Scholar 

  • Lu, Q., Dessouky, M.: An exact algorithm for the multiple vehicle pickup and delivery problem. Transp. Sci. 38(4), 503–514 (2004)

    Article  Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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

    Chapter  MATH  Google Scholar 

  • 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)

    Article  MathSciNet  Google Scholar 

  • Mitrović-Minić, S., Laporte, G.: Waiting strategies for the dynamic pickup and delivery problem with time windows. Transp. Res. B 38, 635–655 (2004)

    Article  Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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

    Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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)

    Article  Google Scholar 

  • 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)

    Google Scholar 

Download references

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

  1. University of Seville, Seville, Spain

    Francisco A. Ortega & Juan A. Mesa

  2. University of Cadiz, Cádiz, Spain

    Miguel A. Pozo

Authors
  1. Francisco A. Ortega
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juan A. Mesa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Miguel A. Pozo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Francisco A. Ortega .

Editor information

Editors and Affiliations

  1. McCoy College of Business, Texas State University, San Marcos, Texas, USA

    Cecilia Temponi

  2. Katholieke Universiteit Leuven, Leuven, Belgium

    Nico Vandaele

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics

Search

Navigation