A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals

In this paper, a scheduling problem for automated guided vehicles in container terminals is defined and formulated as a Minimum Cost Flow model. This problem is then solved by a novel algorithm, NSA+, which extended the standard Network Simplex Algorithm (NSA). Like NSA, NSA+ is a complete algorithm, which means that it guarantees optimality of the solution if it finds one within the time available. To complement NSA+, an incomplete algorithm Greedy Vehicle Search (GVS) is designed and implemented. The NSA+ and GVS are compared and contrasted to evaluate their relative strength and weakness. With polynomial time complexity, NSA+ can be used to solve very large problems, as verified in our experiments. Should the problem be too large for NSA+, or the time available for computation is too short (as it would be in dynamic scheduling), GVS complements NSA+.

[1]  B J Wook,et al.  A POOLED DISPATCHING STRATEGY FOR AUTOMATED GUIDED VEHICLES IN PORT CONTAINER TERMINALS , 2000 .

[2]  Edward Tsang,et al.  Constraint Based Scheduling: Applying Constraint Programming to Scheduling Problems , 2003, J. Sched..

[3]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[4]  W. H. Cunningham,et al.  Theoretical Properties of the Network Simplex Method , 1979, Math. Oper. Res..

[5]  V G Andrew,et al.  AN EFFICIENT IMPLEMENTATION OF A SCALING MINIMUM-COST FLOW ALGORITHM , 1997 .

[6]  Torsten Reiners,et al.  Vehicle dispatching at seaport container terminals using evolutionary algorithms , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[7]  István Maros.  A General Pricing Scheme for the Simplex Method , 2003, Ann. Oper. Res..

[8]  Philippe Baptiste,et al.  Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .

[9]  Stefan Voß,et al.  Meta-heuristics: The State of the Art , 2000, Local Search for Planning and Scheduling.

[10]  Rommert Dekker,et al.  Operations research supports container handling , 2001 .

[11]  Alexander Nareyek.  Local search for planning and scheduling : ECAI 2000 Workshop, Berlin, Germany, August 21, 2000 : revised papers , 2001 .

[12]  Edward P. K. Tsang,et al.  Constraint Based Scheduling: Applying Constraint Programming to Scheduling Problems , 2003, J. Sched..

[13]  R. Helgason,et al.  Chapter 2 Primal simplex algorithms for minimum cost network flows , 1995 .

[14]  Chung-Piaw Teo,et al.  Dispatching Automated Guided Vehicles in a Container Terminal , 2005 .

[15]  Michael Florian,et al.  AN EFFICIENT IMPLEMENTATION OF THE NETWORK SIMPLEX METHOD. , 1997 .

[16]  Ling Qiu,et al.  Scheduling and routing algorithms for AGVs: A survey , 2002 .

[17]  B. Comm,et al.  The Minimum Cost Flow Problem and The Network Simplex Solution Method , 2003 .

[18]  John M. Mulvey,et al.  Pivot Strategies for Primal-Simplex Network Codes , 1978, JACM.

[19]  LinnRichard,et al.  A decision support system for operations in a container terminal , 2005 .

[20]  Philippe Baptiste,et al.  Incorporating Efficient Operations Research Algorithms in Constraint-Based Scheduling , 1995 .

[21]  Andrew V. Goldberg,et al.  An efficient cost scaling algorithm for the assignment problem , 1995, Math. Program..

[22]  Edward Tsang.  Scheduling techniques: a comparative study , 1995 .

[23]  Masakazu Muramatsu.  ON NETWORK SIMPLEX METHOD USING THE PRIMAL-DUAL SYMMETRIC PIVOTING RULE , 2000 .

[24]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[25]  Ravindra K. Ahuja,et al.  A network simplex algorithm with O(n) consecutive degenerate pivots , 2002, Oper. Res. Lett..

[26]  J. Orlin,et al.  Algorithms for the Simple Equal Flow Problem , 1999 .

[27]  Gerald G. Brown,et al.  Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .

[28]  David Eppstein.  Clustering for faster network simplex pivots , 1994, SODA '94.

[29]  Katta G. Murty,et al.  A decision support system for operations in a container terminal , 2005, Decis. Support Syst..