Skip to main content
SpringerLink
Log in

Dynamic Routing Applied to Mobile Field Service

  • Conference paper
  • First Online:
Dynamics in Logistics

  • 1132 Accesses

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.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms and Requests Prentice Hall, Englewood Cliffs.

    Google Scholar 

  • Bertsimas DJ, Van Ryzin G (1991) Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane. Operations Research 39(4):601–615.

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  • Branke J, Middendorf M, Noedth G, Dessouky M (2005) Waiting Strategies for Dynamic Vehicle Routing. Transportation Science 39(3):298–311.

    Article  Google Scholar 

  • Dantzig GB (1963) Linear Programming and Extensions. Princeton University Press.

    Google Scholar 

  • Fleischmann B, Gnutzmann S, Sandvoss E (2004) Dynamic Vehicle Routing Based on Online Traffic Information. Transportation Science 38(4):420–433.

    Article  Google Scholar 

  • Ichoua S, Gendreau M, Potvin JY (2000) Diversion Issues in Real Time Vehicle Dispatching. Transportation Science 34:426–438.

    Article  MATH  Google Scholar 

  • Knuth DE (1998) The Art of Computer Programming. Addison Wesley, Reading.

    Google Scholar 

  • Kuhn HW (1955) The Hungarian Method for the Assignment Problem. Naval Research Logistic Quarterly 2:83–97.

    Article  Google Scholar 

  • Larsen A (2000) The Dynamic Routing Problem—Thesis for the Degree on Ph.D. Math. Model. Dpt. Denmark Tech. University.

    Google Scholar 

  • Lund K, Madsen OBG, Rygaard JM (1996) Vehicle Routing Problems with Varying Degrees of Dynamism. Technical Report IMM, Technical University of Denmark.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  • Psaraftis HN (1988) Dynamic Vehicle Routing Problems, Vehicle Routing: Methods and Studies. Elsevier Science Publishers, Amsterdam.

    Google Scholar 

  • Psaraftis HN (1995) Dynamic Vehicle Routing: Status and Prospects. Annals of Operations Research 61(1):61–143.

    Article  Google Scholar 

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

    Google Scholar 

  • Spivey MZ, Powell WB (2004) The Dynamic Assignment Problem. Transportation Science, 38(4):399–419.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programa de Mestrado em Engenharia de Sistemas Logísticos, Escola Politécnica da, Universidade de São Paulo, Av. Prof. Almeida Prado, Travessa 2, no 83, CEP 05508-900, São Paulo, SP, Brazil

    Auro C. Raduan

  2. Departamento de Engenharia de Transportes, Escola Politécnica da Universidade de, São Paulo, Av. Prof. Almeida Prado, Travessa 2, no 83, CEP 05508-900, São Paulo, SP, Brazil

    Nicolau D. F. Gualda

Authors
  1. Auro C. Raduan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicolau D. F. Gualda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Auro C. Raduan .

Editor information

Editors and Affiliations

  1. FB Mathematik und Informatik, AG Theoretische Informatik, Universität Bremen, Linzer Str. 9a, Bremen, 28359, Germany

    Hans-Jörg Kreowski

  2. BIBA GmbH, Bremer Institut für Messtechnik, Universität Bremen, Hochschulring 20, Bremen, 28359, Germany

    Bernd Scholz-Reiter

  3. BIBA GmbH, Bremer Institut für Messtechnik, Universität Bremen, Hochschulring 20, Bremen, 28359, Germany

    Klaus-Dieter Thoben

Rights and permissions

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

Publish with us

Policies and ethics

Search

Navigation