Multiobjective Optimization for Autonomous Straddle Carrier Scheduling at Automated Container Terminals

A multiobjective optimization model is presented in this paper for the Autonomous Straddle Carriers Scheduling (ASCS) problem in automated container terminals, which is more practical than the single objective model. The model considers three objectives [i.e., Straddle Carriers (SCs) traveling time, SC waiting time and finishing time of high-priority container-transferring jobs], and their weighted sum is investigated as the representative example. The presented model is formulated as a pickup and delivery problem with time windows in the form of binary integer programming. An exact algorithm based on Branch-and-Bound with Column Generation (BBCG) is employed for solving the multiobjective ASCS problem. Based on the map of an actual fully automated container terminal, simulation results are compared with the single-objective scheduling to demonstrate the effectiveness and flexibility of the presented multiobjective model, as well as the efficacy of the BBCG algorithm for autonomous SC scheduling.

[1]  Gamini Dissanayake,et al.  Optimisation model and exact algorithm for autonomous straddle carrier scheduling at automated container terminals , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[2]  Iris F. A. Vis,et al.  Survey of research in the design and control of automated guided vehicle systems , 2006, Eur. J. Oper. Res..

[3]  François Soumis,et al.  Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows , 2009, Comput. Oper. Res..

[4]  A. K. Kulatunga,et al.  Simultaneous Planning and Scheduling for Multi-Autonomous Vehicles , 2007, Evolutionary Scheduling.

[5]  Leyuan Shi,et al.  Hybrid Nested Partitions and Mathematical Programming Approach and Its Applications , 2008, IEEE Transactions on Automation Science and Engineering.

[6]  Walter Ukovich,et al.  A Metamodeling Approach to the Management of Intermodal Transportation Networks , 2011, IEEE Transactions on Automation Science and Engineering.

[7]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[8]  Jonathan Halpern,et al.  Shortest route with time dependent length of edges and limited delay possibilities in nodes , 1977, Math. Methods Oper. Res..

[9]  Sönke Hartmann.  A general framework for scheduling equipment and manpower at container terminals , 2004 .

[10]  Matthias Lehmann,et al.  Dispatching multi-load AGVs in highly automated seaport container terminals , 2004, OR Spectr..

[11]  Iris F. A. Vis,et al.  Transshipment of containers at a container terminal: An overview , 2003, Eur. J. Oper. Res..

[12]  Celso C. Ribeiro,et al.  A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem , 1991, Oper. Res..

[13]  M. Fischetti,et al.  Heuristic algorithms for the multiple depot vehicle scheduling problem , 1993 .

[14]  Tatsushi Nishi,et al.  Petri Net Decomposition Approach to Optimization of Route Planning Problems for AGV Systems , 2010, IEEE Transactions on Automation Science and Engineering.

[15]  Guy Desaulniers,et al.  Multi-depot vehicle scheduling problems with time windows and waiting costs , 1996, Eur. J. Oper. Res..

[16]  Stefan Voß,et al.  Container terminal operation and operations research - a classification and literature review , 2004, OR Spectr..

[17]  Der-San Chen,et al.  Applied Integer Programming: Modeling and Solution , 2010 .

[18]  Deniz Türsel Eliiyi,et al.  A vehicle scheduling problem with fixed trips and time limitations , 2009 .

[19]  Hassan Rashidi,et al.  A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals , 2011, Comput. Math. Appl..

[20]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

[21]  Kay Chen Tan,et al.  Multi-objective and prioritized berth allocation in container ports , 2010, Ann. Oper. Res..

[22]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[23]  Alexander H. G. Rinnooy Kan,et al.  Vehicle Routing with Time Windows , 1987, Oper. Res..

[24]  Kap Hwan Kim,et al.  A dispatching method for automated lifting vehicles in automated port container terminals , 2009, Comput. Ind. Eng..

[25]  Hugh F. Durrant-Whyte,et al.  Field and service applications - An autonomous straddle carrier for movement of shipping containers - From Research to Operational Autonomous Systems , 2007, IEEE Robotics & Automation Magazine.

[26]  Gamini Dissanayake,et al.  Mathematical modelling of container transfers for a fleet of autonomous straddle carriers , 2010, 2010 IEEE International Conference on Robotics and Automation.

[27]  Graeme Nelmes,et al.  Container Port Automation , 2005, International Symposium on Field and Service Robotics.

[28]  A.I. Sivakumar,et al.  Online multiobjective Pareto optimal dynamic scheduling of semiconductor back-end using conjunctive simulated scheduling , 2006, IEEE Transactions on Electronics Packaging Manufacturing.

[29]  Henry Y. K. Lau,et al.  Integrated scheduling of handling equipment at automated container terminals , 2008, Ann. Oper. Res..

[30]  Lu Zhen,et al.  A Comparative Study on Two Types of Automated Container Terminal Systems , 2012, IEEE Transactions on Automation Science and Engineering.

[31]  Zdenko Kovacic,et al.  Time Windows Based Dynamic Routing in Multi-AGV Systems , 2010, IEEE Transactions on Automation Science and Engineering.

[32]  Satoshi Hoshino,et al.  Hybrid Design Methodology and Cost-Effectiveness Evaluation of AGV Transportation Systems , 2007, IEEE Transactions on Automation Science and Engineering.

[33]  Gamini Dissanayake,et al.  A job grouping approach for planning container transfers at automated seaport container terminals , 2011, Adv. Eng. Informatics.