Abstract
This article presents the design and application of real-time routing modelling to the problem of geographically dispersed emergency requests through service mobile teams. Based on the dynamic repairman travelling problem (DRTP), the search of the solution was done using a computer model for evaluate the operational strategies that result in less waiting times for a given demand profile. A solution algorithm based on the Hungarian method that resulted in appropriate computational response times is presented and tested.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms and Requests Prentice Hall, Englewood Cliffs.
Bertsimas DJ, Van Ryzin G (1991) Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane. Operations Research 39(4):601–615.
Bertsimas DJ, Van Ryzin G (1993) Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane with Multiple Capacitated Vehicles. Operations Research 41(1):601–615.
Branke J, Middendorf M, Noedth G, Dessouky M (2005) Waiting Strategies for Dynamic Vehicle Routing. Transportation Science 39(3):298–311.
Dantzig GB (1963) Linear Programming and Extensions. Princeton University Press.
Fleischmann B, Gnutzmann S, Sandvoss E (2004) Dynamic Vehicle Routing Based on Online Traffic Information. Transportation Science 38(4):420–433.
Ichoua S, Gendreau M, Potvin JY (2000) Diversion Issues in Real Time Vehicle Dispatching. Transportation Science 34:426–438.
Knuth DE (1998) The Art of Computer Programming. Addison Wesley, Reading.
Kuhn HW (1955) The Hungarian Method for the Assignment Problem. Naval Research Logistic Quarterly 2:83–97.
Larsen A (2000) The Dynamic Routing Problem—Thesis for the Degree on Ph.D. Math. Model. Dpt. Denmark Tech. University.
Lund K, Madsen OBG, Rygaard JM (1996) Vehicle Routing Problems with Varying Degrees of Dynamism. Technical Report IMM, Technical University of Denmark.
Papastavrou JD (1996) A Stochastic and Dynamic Routing Policy Using Branching Processes with State Dependent Immigration. European Journal of Operational Research 95(1):167–177.
Psaraftis HN (1988) Dynamic Vehicle Routing Problems, Vehicle Routing: Methods and Studies. Elsevier Science Publishers, Amsterdam.
Psaraftis HN (1995) Dynamic Vehicle Routing: Status and Prospects. Annals of Operations Research 61(1):61–143.
Regan AC, Mahmassani HS, Jaillet P (1995) Improving Efficiency of Commercial Vehicle Operations Using Real-Time Information: Potential Uses and Assignment Strategies. Transportation Research Record 1493:188–198.
Spivey MZ, Powell WB (2004) The Dynamic Assignment Problem. Transportation Science, 38(4):399–419.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer -Verlag Berlin Heidelberg
About this paper
Cite this paper
Raduan, A.C., Gualda, N.D.F. (2011). Dynamic Routing Applied to Mobile Field Service. In: Kreowski, HJ., Scholz-Reiter, B., Thoben, KD. (eds) Dynamics in Logistics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11996-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-11996-5_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11995-8
Online ISBN: 978-3-642-11996-5
eBook Packages: EngineeringEngineering (R0)