The Cross-Entropy Method for Combinatorial Optimization Problems of Seaport Logistics Terminal

Abstract Studies on seaport operations emphasize the fact that the numbers of resources utilized at seaport terminals add a multitude of complexities to dynamic optimization problems. In such dynamic environments, there has been a need for solving each complex operational problem to increase service efficiency and to improve seaport competitiveness. This paper states the key problems of seaport logistics and proposes an innovative cross‐entropy (CE) algorithm for solving the complex problems of combinatorial seaport logistics. Computational results exhibit that the CE algorithm is an efficient, convenient and applicable stochastic method for solving the optimization problems of seaport logistics operations.

[1]  Reuven Y. Rubinstein,et al.  Modern simulation and modeling , 1998 .

[2]  Lifeng Xi,et al.  A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal , 2007, Eur. J. Oper. Res..

[3]  Carlos F. Daganzo,et al.  Storage space vs handling work in container terminals , 1993 .

[4]  Kap Hwan Kim,et al.  Models and Methods for Operations in Port Container Terminals , 2005 .

[5]  Carlos F. Daganzo,et al.  A branch and bound solution method for the crane scheduling problem , 1990 .

[6]  Youfang Huang,et al.  A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning , 2009, Comput. Ind. Eng..

[7]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[8]  Damminda Alahakoon,et al.  Hybrid BDI agents with improved learning capabilities for adaptive planning in a container terminal application , 2004, Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004)..

[9]  C. McDiarmid.  SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing , 1991 .

[10]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[11]  Anne Goodchild,et al.  Crane double cycling in container ports: Planning methods and evaluation , 2007 .

[12]  Yi Zhu,et al.  Crane scheduling with spatial constraints , 2004 .

[13]  Christian Bierwirth,et al.  A fast heuristic for quay crane scheduling with interference constraints , 2009, J. Sched..

[14]  R. Rubinstein.  The Cross-Entropy Method for Combinatorial and Continuous Optimization , 1999 .

[15]  Reuven Y. Rubinstein,et al.  Optimization of computer simulation models with rare events , 1997 .

[16]  Kap Hwan Kim,et al.  Re-marshaling export containers in port container terminals , 1998 .

[17]  I. V. Sergienko,et al.  Classification of applied methods of combinatorial optimization , 2009 .

[18]  Lei Wang,et al.  Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures , 2006 .

[19]  Chung-lun Li,et al.  Scheduling with multiple-job-on-one-processor pattern , 1998 .

[20]  Yusin Lee,et al.  An optimization heuristic for the berth scheduling problem , 2009, Eur. J. Oper. Res..

[21]  van Km Kees Hee,et al.  Decision support system for container terminal planning , 1988 .

[22]  Kap Hwan Kim,et al.  A beam search algorithm for the load sequencing of outbound containers in port container terminals , 2004 .

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  Kwang Ryel Ryu,et al.  Optimization of Container Load Sequencing by a Hybrid of Ant Colony Optimization and Tabu Search , 2005, ICNC.

[25]  Pasquale Legato,et al.  Berth planning and resources optimisation at a container terminal via discrete event simulation , 2001, Eur. J. Oper. Res..

[26]  Kap Hwan Kim,et al.  A crane scheduling method for port container terminals , 2004, Eur. J. Oper. Res..

[27]  R. Rubinstein.  Combinatorial Optimization, Cross-Entropy, Ants and Rare Events , 2001 .

[28]  Y. Zhu,et al.  Crane scheduling with non-crossing constraint , 2006, J. Oper. Res. Soc..

[29]  Kap Hwan Kim,et al.  The optimal determination of the space requirement and the number of transfer cranes for import containers , 1998 .

[30]  Luca Maria Gambardella,et al.  An optimization methodology for intermodal terminal management , 2001, J. Intell. Manuf..

[31]  Ruhul A. Sarker,et al.  Optimization Modelling: A Practical Approach , 2007 .

[32]  Giovanni Righini,et al.  Heuristics from Nature for Hard Combinatorial Optimization Problems , 1996 .

[33]  Dirk P. Kroese,et al.  The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning , 2004 .

[34]  Chung-Lun Li,et al.  Analysis of a new vehicle scheduling and location problem , 2001 .

[35]  C. Leake.  Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method , 1994 .

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

[37]  Richard J. Linn,et al.  Storage space allocation in container terminals , 2003 .

[38]  Lixin Miao,et al.  Quay crane scheduling with non-interference constraints in port container terminals , 2008 .

[39]  Kap Hwan Kim,et al.  A beam search algorithm for the load sequencing of outbound containers in port container terminals , 2004, OR Spectr..

[40]  Reza Tavakkoli-Moghaddam,et al.  An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports , 2009, Comput. Ind. Eng..

[41]  Jason H. Goodfriend,et al.  Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method , 1995 .

[42]  Erhan Kozan,et al.  Genetic algorithms to schedule container transfers at multimodal terminals , 1999 .

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

[44]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[45]  Lixin Miao,et al.  Quay crane scheduling with handling priority in port container terminals , 2008 .

[46]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[47]  Yi Zhu,et al.  Crane scheduling using tabu search , 2002, 14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings..

[48]  Stefan Voß,et al.  Operations research at container terminals: a literature update , 2007, OR Spectr..

[49]  Petros A. Ioannou,et al.  Design, simulation, and evaluation of automated container terminals , 2002, IEEE Trans. Intell. Transp. Syst..

[50]  Andrew Lim,et al.  A m‐parallel crane scheduling problem with a non‐crossing constraint , 2007 .

[51]  Stefan Voß,et al.  Container terminal operation and operations research — a classification and literature review , 2004 .

[52]  Damminda Alahakoon,et al.  Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents , 2007, Eur. J. Oper. Res..

[53]  Maja Krčum,et al.  Models and Methods for Operations in Port Container Terminals , 2010 .