Agent Performance in Vehicle Routing when the Only Thing Certain is Uncertainty

While intermodal transport has the potential to introduce efficiency to the transport network, this transport environment also suffers from a lot of uncertainty at the interface of modes. For example, trucks moving containers to and from a port terminal are often uncertain as to when exactly their container will be released from the ship, from the stack, or from customs. This leads to much difficulty and inefficiency in planning a profitable routing for multiple containers in one day. In this paper, we examine agent-based solutions as a mechanism to handle job arrival uncertainty in the context of a drayage case at the Port of Rotterdam. We compare our agent-based solution approach to a well known on-line optimization approach and study the comparative performance of both systems across four scenarios of varying job arrival uncertainty. We conclude that when less than 50% of all jobs are known at the start of the day then an agent-based approach performs competitively with an on-line optimization approach.

[1]  Leon Sterling,et al.  A distributed agent approach to global transportation scheduling , 2003, IEEE/WIC International Conference on Intelligent Agent Technology, 2003. IAT 2003..

[2]  Kutluhan Erol,et al.  In-Time Agent-Based Vehicle Routing with a Stochastic Improvement Heuristic , 1999, AAAI/IAAI.

[3]  Klaus Fischer,et al.  Holonic transport scheduling with teletruck , 2000, Appl. Artif. Intell..

[4]  Monique Calisti,et al.  An adaptive solution to dynamic transport optimization , 2005, AAMAS '05.

[5]  Nicholas R. Jennings,et al.  Agent-based control systems: Why are they suited to engineering complex systems? , 2003 .

[6]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

[7]  Jörg P. Müller,et al.  A Model for Cooperative Transportation Scheduling , 1995, ICMAS.

[8]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[9]  Hon Wai Leong,et al.  A multi-agent algorithm for vehicle routing problem with time window , 2006, SAC '06.

[10]  Marius M. Solomon,et al.  Partially dynamic vehicle routing—models and algorithms , 2002, J. Oper. Res. Soc..

[11]  Paul Davidsson,et al.  Combining Agent-Based Approaches and Classical Optimization Techniques , 2005, EUMAS.

[12]  Paul Davidsson,et al.  An Analysis of Agent-Based Approaches to Transport Logistics , 2005 .

[13]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[14]  Christian Kray,et al.  The eager bidder problem: a fundamental problem of DAI and selected solutions , 2002, AAMAS '02.

[15]  Victor R. Lesser,et al.  Leveled Commitment Contracts and Strategic Breach , 2001, Games Econ. Behav..

[16]  Han La Poutré,et al.  A Decommitment Strategy in a Competitive Multi-agent Transportation Setting , 2003, AMEC.

[17]  Martijn Mes,et al.  Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems , 2007, Eur. J. Oper. Res..

[18]  Hani S. Mahmassani,et al.  On-Line Algorithms for Truck Fleet Assignment and Scheduling Under Real-Time Information , 1999 .

[19]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .