Abstract
This chapter introduces the proposed deterministic real-time control approach which is used to control the transportation process during its execution. Since the solution method consumes a time period which cannot be considered as zero time for adapting the tour plan and since the transportation process continues its execution during the adaptation, the proposed real-time control approach considers the concurrency of transportation process execution and adaptation. Furthermore, the mathematical model utilized for modeling individual problem instances arising during the execution of the transportation process is described. In this mathematical formulation, both evaluated objective functions comprising a linear and a quadratic evolution of customer inconvenience are introduced. Afterwards, the proposed real-time control approach is classified according to a general classification scheme for real-time control approaches.
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 subscriptionsNotes
- 1.
The shortest path is defined as the path in a weighted graph connecting two given nodes i and j with the property that the sum of the weights of all the edges is minimized over all such paths (cf. Sedgewick 1983, p. 413).
References
Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. Englewood Cliffs: Prentice-Hall.
Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., & Wagner, D. (2008). Combining hierarchical and goal-directed speed-up techniques for Dijkstra’s algorithm. In C. McGeoch (Ed.), Lecture notes in computer science: Vol. 5038. Experimental algorithms (pp. 303–318). Berlin: Springer.
Bock, S. (2004). Echtzeitfähige Steuerung von Speditionsnetzwerken: Nutzung moderner Informations- und Kommunikationstechnologien zur effizienten Durchführung von Transporten: Habilitationsschrift Universität Paderborn, 2004 (1st ed.). Wiesbaden: Deutscher Universitäts-Verlag. Gabler Edition Wissenschaft: Schriften zur quantitativen Betriebswirtschaftlehre. ISBN 3-8244-8214-2.
Bock, S. (2010). Real-time control of freight forwarder transportation networks by integrating multimodal transport chains. European Journal of Operational Research, 200(3), 733–746.
Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271.
Ferrucci, F. (2006). Entwicklung und Validierung einer Echtzeitsteuerung für realitätsnahe Pickup-and-Delivery-Probleme. Diploma Thesis, University of Paderborn.
Schultes, D. (2008). Route Planning in Road Networks. PhD Thesis, Karlsruhe Institute of Technology.
Sedgewick, R. (1983). Addison-Wesley series in computer science. Algorithms. Reading: Addison-Wesley. ISBN 0201066726.
Zhan, F. B. (1997). Three fastest shortest path algorithms on real road networks: data structures and procedures. Journal of Geographic Information and Decision Analysis, 1(1), 69–82.
Zhan, F. B., & Noon, C. E. (1998). Shortest path algorithms: an evaluation using real road networks. Transportation Science, 32(1), 65–73.
Zhan, F. B., & Noon, C. E. (2000). A comparison between label-setting and label-correcting algorithms for computing one-to-one shortest paths. Journal of Geographic Information and Decision Analysis, 4(2), 1–11.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ferrucci, F. (2013). A New Deterministic Real-Time Control Approach for RDOPG Applications. In: Pro-active Dynamic Vehicle Routing. Contributions to Management Science. Physica, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33472-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-33472-6_5
Publisher Name: Physica, Berlin, Heidelberg
Print ISBN: 978-3-642-33471-9
Online ISBN: 978-3-642-33472-6
eBook Packages: Business and EconomicsBusiness and Management (R0)