ACM Home Page
Please provide us with feedback. Feedback
An adaptive solution to dynamic transport optimization
Full text PdfPdf (755 KB)
Source International Conference on Autonomous Agents archive
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems table of contents
The Netherlands
SESSION: Industrial track: logistics & transport table of contents
Pages: 45 - 51  
Year of Publication: 2005
ISBN:1-59593-093-0
Authors
Klaus Dorer  Whitestein Technologies AG, Zürich, Switzerland
Monique Calisti  Whitestein Technologies AG, Zürich, Switzerland
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 98,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1082473.1082803
What is a DOI?

ABSTRACT

This paper describes LS/ATN, Living Systems®Adaptive Transportation Networks, an agent-based solution we have developed to solve transportation problems in the charter business logistics. LS/ATN provides automatic optimization and execution capabilities that extend the existing planning systems accordingly. To describe our solution and analyse its performance, we report on a real case scenario in which transportation requests of a big logistics provider were optimized. Besides describing the agent approach and the LS/ATN features we stress the necessity to integrate such agent system into a real-world IT architecture. Finally, we show that our adaptive solution produces significantly better results in real case scenarios than what achieved with manual optimization of professional dispatchers.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
K. Fischer, J. P. Müller, and M. Pischel. Cooperative transportation scheduling: an application domain for DAI. Journal of Applied Artificial Intelligence, 10, 1995.
 
2
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.
 
3
P. Klaus. TOP 100 in European Transport and Logistics Services. Deutscher Verkehrs-Verlag, 2004.
 
4
 
5
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.
 
6
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.
 
7
Exel News. Uk consumer products industry cites cost reduction as its biggest logistics challenge. In http://www.exel.com/exel/home/media/news/newsreleases/-pressreleasecostreduction.htm, London, UK, 2002.
 
8
H. Psaraftis. Dynamic vehicle routing: status and prospects. Annals of Operations Research, 61:143--164, 1995.
 
9
M. W. P. Savelsbergh and M. Sol. The general pickup and delivery problem. Transportation Science, 29(1):17--29, 1995.
 
10

CITED BY  11

Collaborative Colleagues:
Klaus Dorer: colleagues
Monique Calisti: colleagues