Summary
Public transport systems are generally organized in a static, a priori way. In such systems, the demand must be adapted to the offer. In this paper, we propose a model based on self-organization in order to dispatch a fleet of vehicles in a purely dynamic Transportation On Demand system (TOD). Our proposal consists in a decentralized approach and a multi-agent system (MAS) to model the environment. This will tackle the problem of vehicles over-concentration or the lack of service in certain areas of the city. We demonstrate that our model addresses these problems by providing vehicle agents, for a given request, to make the final decision thanks to a negotiation process and to calculate overcosts according to an original insertion heuristic.
This is a preview of subscription content, log in via an institution to check access.
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
Attanasio, A., Cordeau, J.F., Ghiani, G., Laporte, G.: Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. 30, 377–387 (2004)
Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Combinatorial Optimization, vol. 11, pp. 315–338. John Wiley, Chichester (1979)
Cordeau, J.F., Laporte, G., Potvin, J.Y., Martin, W.P.: Transportation on Demand. In: Handbooks in Operations Research and Management Science (2004)
Hauptmeier, D., Krumke, S.O., Rambau, J.: The online dial-a-ride problem under reasonable load. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, p. 125. Springer, Heidelberg (2000)
Jaw, J.J., Odoni, A.R., Psaraftis, H.N., Wilson, N.H.M.: A heuristic algorithm for the multi-vehicle many-to-many advance request dial-a-ride problem with time windows. Pergamon Journals Ltd. 20B(3), 243–257 (1986)
Koźlak, J., Créput, J.C., Hilaire, V., Koukam, A.: Multiagent approach to dynamic pick-up and delivery problem with uncertain knowledge about future transport demands. Fundam. Inf. 71(1), 27–36 (2006)
Krumke, S.O., de Paepe, W.E., Poensgen, D., Lipmann, M., Marchetti-Spaccamela, A., Stougie, L.: On minimizing the maximum flow time in the online dial-a-ride problem. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 258–269. Springer, Heidelberg (2006)
Laporte, G., Gendreau, M., Potvin, J.Y., Semet, F.: Classical and Modern Heuristics for the Vehicle Routing Problem. International Transactions in Operational Research 7, 285–300 (1999)
Larsen, A.: The dynamic vehicle routing problem. PhD thesis, Technical University of Denmark (2000)
Lenstra, J., Rinnooy Kan, A.H.G.: Complexity of the vehicle routing and scheduling problems. Networks 11, 221–228 (1981)
Lipmann, M., Lu, X., De Paepe, W.E., Sitters, R.A., Stougie, L.: On-Line Diala-Ride Problems Under a Restricted Information Model. Algorithmica 40, 319–329 (2004)
Madsen, O.B.G., Ravn, H.F., Rygaard, J.M.: A heuristic algorithm for the a diala-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research 60, 193–208 (1995)
Montemanni, R., Gambardella, L., Rizzoli, A., Donati, A.: A new algorithm for a dynamic vehicle routing problem based on ant colony system. In: Second International Workshop on Freight Transportation and Logistics (2003)
North, M.J., Howe, T.R., Collier, N.T., Vos, R.J.: The Repast Simphony Runtime System. In: Proceedings of the Agent 2005 Conference on Generative Social Processes, Models, and Mechanisms, Argonne National Laboratory, Argonne, IL USA (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bertelle, C., Nabaa, M., Olivier, D., Tranouez, P. (2009). A Decentralised Approach for the Transportation On Demand Problem. In: Aziz-Alaoui, M.A., Bertelle, C. (eds) From System Complexity to Emergent Properties. Understanding Complex Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02199-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-02199-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02198-5
Online ISBN: 978-3-642-02199-2
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)