Abstract
The Shortest Route Problem concerns routing one vehicle to one customer while minimizing some objective functions. The problem is essentially a shortest path problem and has been studied extensively in the literature. We report a system with the objective to address two dynamic aspects of the Shortest Route Problem. The first aspect corresponds to handing incremental changes during the routing plan. The second one is about finding the most probable shortest path i.e. the path with the highest probability of being not congested. We describe how each of these two aspects has been implemented in the system as well as the other features and components of this latter.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Golden, B.L., Raghavan, S., Wasil, E.A.: The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces Series, vol. 43. Springer Science & Business Media, US (2008)
Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345–358 (1992)
Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part i: route construction and local search algorithms. Transp. Sci. 39(1), 104–118 (2005)
Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20(1), 255–282 (1981)
Eksioglu, B., Vural, A.V., Reisman, A.: The vehicle routing problem: a taxonomic review. Comput. Ind. Eng. 57(4), 1472–1483 (2009)
Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications, vol. 18. SIAM, Philadelphia (2014)
Bertsimas, D.J., Van Ryzin, G.: A stochastic and dynamic vehicle routing problem in the euclidean plane. Oper. Res. 39(4), 601–615 (1991)
Montemanni, R., Gambardella, L.M., Rizzoli, A.E., Donati, A.V.: Ant colony system for a dynamic vehicle routing problem. J. Comb. Optim. 10(4), 327–343 (2005)
Psaraftis, H.N.: Dynamic vehicle routing: status and prospects. Ann. Oper. Res. 61(1), 143–164 (1995)
Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms 21(2), 267–305 (1996)
Koenig, S., Likhachev, M.: Incremental a*. In: Advances in Neural Information Processing Systems 14. Neural Information Processing Systems: Natural and Synthetic, NIPS 2011, 3–8 December 2001, Vancouver, British Columbia, Canada, pp. 1539–1546 (2001)
Chen, M., Chowdhury, R.A., Ramachandran, V., Roche, D.L., Tong, L.: Priority queues and dijkstra’s algorithm. Computer Science Department, University of Texas at Austin (2007)
Alarabi, L., Eldawy, A., Alghamdi, R., Mokbel, M.F.: TAREEG: a mapreduce-based web service for extracting spatial data from OpenStreetMap. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD 2014, pp. 897–900. ACM, New York (2014)
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
Alanazi, E., Mouhoub, M., Halfawy, M. (2017). A New System for the Dynamic Shortest Route Problem. In: Benferhat, S., Tabia, K., Ali, M. (eds) Advances in Artificial Intelligence: From Theory to Practice. IEA/AIE 2017. Lecture Notes in Computer Science(), vol 10350. Springer, Cham. https://doi.org/10.1007/978-3-319-60042-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-60042-0_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60041-3
Online ISBN: 978-3-319-60042-0
eBook Packages: Computer ScienceComputer Science (R0)