Deriving stacking strategies for export containers with uncertain weight information

In a container terminal, export containers are usually classified into one of a few weight groups and those belonging to the same group are stored together on a same stack. The reason for this stacking by weight groups is that it becomes easy to have heavier containers be loaded onto a ship before lighter ones, which is important for the balancing of the ship. However, since the weight information available at the time of container arrival is only an estimate, containers belonging to different weight groups are often stored together on a same stack. This becomes the cause of extra moves, or re-handlings, of containers at the time of loading to fetch out the heavier containers placed under the lighter ones. In this paper, we propose a method based on a simulated annealing search to derive a good stacking strategy for containers with uncertain weight information. Simulation experiments have shown that our strategies more effectively reduce the number of re-handlings than the traditional same-weight-group-stacking strategy. Also, additional experiments have shown that further improvement can be obtained if we increase the accuracy of the weight classification by applying machine learning.

[1]  Jong-Hwan Kim,et al.  Approximate analysis of finite fork/join queueing networks , 1997 .

[2]  Kap Hwan Kim,et al.  Deriving decision rules to locate export containers in container yards , 2000, Eur. J. Oper. Res..

[3]  Di Yuan,et al.  Optimized planning of frequency hopping in cellular networks , 2005, Comput. Oper. Res..

[4]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[5]  Nir Friedman,et al.  Bayesian Network Classifiers , 1997, Machine Learning.

[6]  Robert C. Holte,et al.  Very Simple Classification Rules Perform Well on Most Commonly Used Datasets , 1993, Machine Learning.

[7]  Carlos F. Daganzo,et al.  Handling Strategies for Import Containers at Marine Terminals , 1993 .

[8]  Kap Hwan Kim,et al.  Evaluation of the number of rehandles in container yards , 1997 .

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  Lefteris Angelis,et al.  A simulated annealing approach for multimedia data placement , 2004, J. Syst. Softw..

[11]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[12]  Ian H. Witten,et al.  Data mining: practical machine learning tools and techniques with Java implementations , 2002, SGMD.

[13]  Ian H. Witten,et al.  Generating Accurate Rule Sets Without Global Optimization , 1998, ICML.

[14]  Shinn-Ying Ho,et al.  An orthogonal simulated annealing algorithm for large floorplanning problems , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[15]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[16]  Pedro M. Domingos,et al.  On the Optimality of the Simple Bayesian Classifier under Zero-One Loss , 1997, Machine Learning.

[17]  Patrick Siarry,et al.  A theoretical study on the behavior of simulated annealing leading to a new cooling schedule , 2005, Eur. J. Oper. Res..

[18]  Chinyao Low,et al.  Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines , 2005, Comput. Oper. Res..