Abstract
In this paper, we present the agent-based approach we have developed to solve dynamic multi-vehicle pickup and delivery problems with soft time windows. While many of the existing research frameworks have been focusing on reaching near-optimal solutions, the central theme of our work is the optimization of real-world sized problems in near real time. In order to describe our approach and analyse its performance, we introduce a real case scenario in which a logistics company must dynamically optimize a set of transportation requests. The aim is to show how our adaptive solution produces significantly better results than can be achieved with manual optimization of professional dispatchers.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
T. G. Crainic. Long haul freight transportation. In R. W. Hall, editor, Handbook of Transportation Science. 2nd Edition, Kluwer, 2002.
Exel. Cost reduction still the biggest pressure on logistics for the industrial sector. In http://www.exel.com/mediacentre/newsreleases/releases.asp?int_articlelD=710, London, UK, 2004.
K. Fischer, J. P. Müller, and M. Pischel. Cooperative transportation scheduling: an application domain for DAI. Journal of Applied Artificial Intelligence, 10, 1995.
M. Gendreau and J. Potvin. Dynamic vehicle routing and dispatching. In T. Crainic and G. Laporte, editors, Fleet Management and Logistics, pages 115–126. Kluwer, 1998.
M. Hickman and K. Blume. A method for scheduling integrated transit service. In 8th International Conference on Computer-Aided Scheduling of Public Transport (CASPT), 2000.
I. Ioachim, J. Desrosiers, Y. Dumas, M. Solomon, and D. Villeneuve. Clustering algorithm for door-to-door handicapped transportation. Transportation Science, 29(1):63–78, 1995.
J.-J. Jaw, A. R. Odoni, H. N. Psaraftis, and N. H. Wilson. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research, 20 B(3):243–257, 1986.
R.M. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85–104. Plenum Press, New York, 1972.
Robert Kohout and Kutluhan Erol. In-time agent-based vehicle routing with a stochastic improvement heuristic. In Proceedings of the 6th National Conference on Artificial Intelligence (AAAI-99); Proceedings of the 11th Conference on Innovative Applications of Artificial Intelligence, pages 864–869, Menlo Park, Cal., July 18–22 1999. AAAI/MIT Press.
G. Laporte and I. H. Osman. Routing problems: A bibliography. Annals of Operations Research, 61:227–262, 1995.
Snezana Mitrovic-Minic. Pickup and delivery problem with time windows: A survey. Technical Report TR. 1998-12, School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, May 1998.
W. P. Nanry and J. W. Barnes. Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research, 34B:107–121, 2000.
H. Psaraftis. Dynamic vehicle routing: status and prospects. Annals of Operations Research, 61:143–164, 1995.
M. W. P. Savelsbergh and M. Sol. The general pickup and delivery problem. Transportation Science, 29(1):17–29, 1995.
P. M. Thompson and H. N. Psaraftis. Cyclic transfer algorithm for multivehicle routing and scheduling problems. Operations Research, 41(5), 1993.
Hang Xu, Zhi-Long Chen, Srinivas Rajagopal, and Sundar Arunapuram. Solving a practical pickup and delivery problem. Transportation Science, 37(3):347–364, 2003.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Birkhäuser Verlag
About this paper
Cite this paper
Dorer, K., Calisti, M. (2005). An Adaptive Approach to Dynamic Transport Optimization. In: Klügl, F., Bazzan, A., Ossowski, S. (eds) Applications of Agent Technology in Traffic and Transportation. Whitestein Series in Software Agent Technologies. Birkhäuser Basel. https://doi.org/10.1007/3-7643-7363-6_3
Download citation
DOI: https://doi.org/10.1007/3-7643-7363-6_3
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-7258-3
Online ISBN: 978-3-7643-7363-4
eBook Packages: Computer ScienceComputer Science (R0)