Abstract
Highly automated transport systems play an important role in the transformation towards a digital society, and planning the optimal routes for a set of fleet vehicles has been proved useful for improving the delivered services. Traditionally, routes are planned beforehand. However, with the advent of autonomous urban transport systems (e.g. autonomous cars), possible obstructions of tracks due to traffic congestion or bad weather conditions need to be handled on the fly. In this paper we tackle the problem of dynamically computing routes of vehicles in urban lines in the presence of potential obstructions. The problem is formulated as an integer linear optimization problem. The proposed algorithm will assign routes to vehicles dynamically, considering the track segments that are no longer available and the positions of the vehicles in the urban area. The recomputed routes guarantee the minimal waiting time for passengers. Safety of the computed routes is also guaranteed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Assad, A.: Analysis of rail classification policies. INFOR: Inf. Syst. Oper. Res. 21(4), 293–314 (1983). doi:10.1080/03155986.1983.11731905
Bodin, L.D., Golden, B.L., Schuster, A.D., Romig, W.: A model for the blocking of trains. Transp. Res. Part B: Methodol. 14(1), 115–120 (1980). http://www.sciencedirect.com/science/article/pii/0191261580900375
Borndörfer, R., Klug, T., Schlechte, T., Fügenschuh, A., Schang, T., Schülldorf, H.: The freight train routing problem for congested railway networks with mixed traffic. Transp. Sci. 50(2), 408–423 (2016)
Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6, 80–91 (1959)
Flood, M.M.: The traveling-salesman problem. Oper. Res. 4(1), 61–75 (1956)
Ford, D.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (2010)
Ford, L.R., Fulkerson, D.R.: A simple algorithm for finding maximal network flows and an application to the hitchcock problem. Canadian J. Mathe, 210–218 (1957)
Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: a mathematical programming language. AT & T Bell Laboratories Murray Hill (1987)
Ghiani, G., Guerriero, F., Laporte, G., Musmanno, R.: Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies. Eur. J. Oper. Res. 151(1), 1–11 (2003)
Hemmecke, R., Koppe, M., Lee, J., Weismantel, R.: Nonlinear integer programming. In: Junger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958–2008, pp. 561–618. Springer, Heidelberg (2010)
Klein, M.: A primal method for minimal cost flows, with applications to the assignment and transportation problems (1967)
Li, F., Gao, Z., Li, K., Yang, L.: Efficient scheduling of railway traffic based on global information of train. Transp. Res. Part B Methodol. 42(10), 1008–1030 (2008). http://www.sciencedirect.com/science/article/pii/S0191261508000337
Martinelli, D.R., Teng, H.: Optimization of railway operations using neural networks. Transp. Res. Part C Emerg. Technol. 4(1), 33–49 (1996). http://www.sciencedirect.com/science/article/pii/0968090X9500019F
Mazzanti, F., Ferrari, A., Spagnolo, G.O.: Experiments in formal modelling of a deadlock avoidance algorithm for a CBTC system. In: Margaria, T., Steffen, B. (eds.) ISoLA 2016. LNCS, vol. 9953, pp. 297–314. Springer, Cham (2016). doi:10.1007/978-3-319-47169-3_22
Pillac, V., Gendreau, M., Guéret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1–11 (2013)
Psaraftis, H.N., Wen, M., Kontovas, C.A.: Dynamic vehicle routing problems: three decades and counting. Netw. 67(1), 3–31 (2016)
Schoitsch, E.: Introduction to the special theme - autonomous vehicles. ERCIM News 2017 (109) (2017)
Sun, Y., Cao, C., Wu, C.: Multi-objective optimization of train routing problem combined with train scheduling on a high-speed railway network. Transp. Res. Part C Emerg. Technol. 44, 1–20 (2014). http://www.sciencedirect.com/science/article/pii/S0968090X14000655
Wallace, S.W. (ed.): Algorithms and Model Formulations in Mathematical Programming. Springer, New York (1989)
Yanfeng, L., Ziyou, G., Jun, L.: Vehicle routing problem in dynamic urban traffic network. In: ICSSSM 2011, pp. 1–6 (2011)
Acknowledgements
This work has been partially supported by the Tuscany Region project POR FESR 2014–2020 SISTER and H2020 2017–2019 S2R-OC-IP2-01-2017 ASTRail.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Basile, D., Di Giandomenico, F., Gnesi, S. (2017). Dependable Dynamic Routing for Urban Transport Systems Through Integer Linear Programming. In: Fantechi, A., Lecomte, T., Romanovsky, A. (eds) Reliability, Safety, and Security of Railway Systems. Modelling, Analysis, Verification, and Certification. RSSRail 2017. Lecture Notes in Computer Science(), vol 10598. Springer, Cham. https://doi.org/10.1007/978-3-319-68499-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-68499-4_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68498-7
Online ISBN: 978-3-319-68499-4
eBook Packages: Computer ScienceComputer Science (R0)