A considerable volume of research exists concerning the domain of automatic planning and scheduling, hut many real-world scheduling problems, and especially that of transportation logistics, remain difficult to solve. In particular, this domain demands schedule-solving for every vehicle in a transportation fleet where pick-up and delivery of customer orders is distributed across multiple geographic locations, while satisfying time-window constraints on pickup and delivery per location. This paper presents a successful commercial-grade solution to this problem called living systems adaptive transportation networks (LS/ATN), which has been proven through real-world deployment to reduce transportation costs through the optimization of route solving for both small and large fleets. LS/ATN is a novel agent-based resource management and decision system designed to address this highly dynamic and complex domain in commercial settings. We show how LS/ATN employs agent cooperation algorithms to derive truck schedules that optimize the use of available resources leading to significant cost savings. The solution is designed to support, rather than replace, the day-to-day activities of human dispatchers
[1]
Nigel H. M. Wilson,et al.
A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows
,
1986
.
[2]
Monique Calisti,et al.
An adaptive solution to dynamic transport optimization
,
2005,
AAMAS '05.
[3]
Kutluhan Erol,et al.
In-Time Agent-Based Vehicle Routing with a Stochastic Improvement Heuristic
,
1999,
AAAI/IAAI.
[4]
Klaus Dorer.
Agent-based Dynamic Transport Optimization
,
2004
.
[5]
T. Crainic.
Long-Haul Freight Transportation
,
2003
.
[6]
Michel Gendreau,et al.
DYNAMIC VEHICLE ROUTING AND DISPATCHING
,
1998
.
[7]
Martin W. P. Savelsbergh,et al.
The General Pickup and Delivery Problem
,
1995,
Transp. Sci..
[8]
Klaus Fischer,et al.
Cooperative Transportation Scheduling: An Application Domain for DAI
,
1996,
Appl. Artif. Intell..