Abstract
In a dynamic dial-a-ride problem (DARP) the task is to provide a transportation service in a given area by dynamically routing a set of vehicles in response to passengers’ trip requests. Passengers share vehicles similarly as with buses, while the schedule and routes are chosen ad hoc. Each trip is defined by the origin-destination pair in plane augmented with a latest feasible delivery time. Optimal control of such a system is a complicated task in general and outside the scope of this paper. Instead, we consider a set of well-defined heuristic control policies that can be evaluated by means of simulations. The main contribution of this paper is two-fold: (i) to demonstrate that a phenomenon known as congestive collapse occurs as the rate of trip requests increases beyond a capacity threshold of the given control policy (the value of which itself is unknown a priori); (ii) to propose a robust and computationally lightweight countermeasure to avoid the congestive collapse in such a way that the system’s performance still improves after the capacity threshold has been passed. Despite its appealing simplicity, the proposed method succeeds in rejecting customers detrimental for the common good.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. European Journal of Operational Research 202(1), 8–15 (2010)
Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)
Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Annals of Operations Research 153(1), 29–46 (2007)
Ephremides, A., Varaiya, P., Walrand, J.: A simple dynamic routing problem. IEEE Transactions on Automatic Control 25(4), 690–693 (1980)
Gast, M.: 802.11 Wireless Networks: The Definitive Guide, 2nd edn. O’Reilly, Sebastopol (2005)
Hyytiä, E., Häme, L., Penttinen, A., Sulonen, R.: Simulation of a large scale dynamic pickup and delivery problem. In: 3rd International ICST Conference on Simulation Tools and Techniques, SIMUTools 2010 (March 2010)
Kleinrock, L.: Queueing Systems, Volume I: Theory. Wiley Interscience, Hoboken (1975)
Kurose, J., Ross, K.: Computer Networking: a top-down approach featuring the Internet. Addison-Wesley, Reading (2001)
Lam, S.H., Toan, T.D.: Land transport policy and public transport in Singapore. Transportation 33(2), 171–188 (2006)
A world class land transport system. White paper, Land Transport Authority, Singapore (Januaruy 1996)
Parragh, S., Doerner, K., Hartl, R.: A survey on pickup and delivery problems. part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft 58(2), 81–117 (2008)
Ross, S.M.: Introduction to Probability Models, 7th edn. Academic Press, London (2000)
Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2001)
Winston, W.: Optimality of the shortest line discipline. Journal of Applied Probability 14, 181–189 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hyytiä, E., Penttinen, A., Sulonen, R. (2010). Congestive Collapse and Its Avoidance in a Dynamic Dial-a-Ride System with Time Windows. In: Al-Begain, K., Fiems, D., Knottenbelt, W.J. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2010. Lecture Notes in Computer Science, vol 6148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13568-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-13568-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13567-5
Online ISBN: 978-3-642-13568-2
eBook Packages: Computer ScienceComputer Science (R0)