SOLVING THE 3D CONTAINER SHIP LOADING PLANNING PROBLEM BY REPRESENTATION BY RULES AND BEAM SEARCH

Anibal Tavares de Azevedo, Cassilda Maria Ribeiro, Galeno José de Sena, Antônio Augusto Chaves, Luis Leduíno Salles Neto, Antônio Carlos Moretti

Abstract

This paper formulates the 3D Container ship Loading Planning Problem (3D CLPP) and also proposes a new and compact representation to efficiently solve it. Containers on board a Container ship are placed in vertical stacks, located in different sections. The only way to access the containers is through the top of the stack. In order to unload a container at a given port j, it is necessary to remove the container whose destination is the port j+1, because it is located above the container we want to download. This operation is called “shifting”. A ship container carrying cargo to several ports may require a large number of shifting operations. These operations spend a lot of time and cost and can be avoided by using efficient stowage planning. The key objective of the stowage planning is to minimize the number of container movements and also the ship instability. The binary formulation of this problem is properly described and also an alternative formulation called representation by rules is proposed. A Beam Search is combined with representation by rules to solve the 3D CLPP in manner that ensures that every solution analyzed in the optimization process is compact and feasible.

References

  1. Ambrosino, D.; Sciomachen A.; Tanfani, E., 2006. A decomposition heuristics for the container ship stowage problem, J. Heuristics, v.12, p. 211-233.
  2. Ambrosino, D., Anghinolfi, D., Paolucci, M., Sciomachen, A., 2010. An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem. In SEA, 314-325.
  3. Avriel, M.; Penn, M., 1993. Container ship stowage problem, Computers and Industrial Engineering, v. 25, p. 271-274.
  4. Avriel, M.; Penn, M.; Shpirer, N.; Wittenboon, S., 1998. Stowage planning for container ships to reduce the number of shifts, Annals of Operations Research, v. 76, p. 55-71.
  5. Avriel, M.; Penn, M.; Shpirer, N., 2000. Container ship stowage problem: complexity and connection to the coloring of circle graphs, Discrete Applied Mathematics, v. 103, p. 271-279.
  6. Della Croce, F.; T'kindt, V., 2002. A Recovering Beam Search Algorithm for the One-Machine Dynamic Total Completion Time Scheduling Problem, Journal of the Operational Research Society, vol 54, pp. 1275-1280.
  7. Dubrovsky, O.; Levitin, G., Penn, M., 2002. A Genetic Algorithm with a Compact Solution Encoding for the Container Ship Stowage Problem, Journal of Heuristics, v. 8, p. 585-599.
  8. Lowerre, B. T.; 1976. The HARPY Speech Recognition System, PhD. thesis, Carnegie-Mellon University, USA, 1976.
  9. Ow, P. S, Morton, T. E., 1988. Filtered Beam Search in Scheduling, International Journal of Production Research, vol. 26, pp. 35-62.
  10. Ribeiro, C. M., Azevedo, A. T., Teixeira, R. F., Problem of Assignment Cells to Switches in a Cellular Mobile Network via Beam Search Method, WSEAS Transactions on Communications, vol 1, pp. 11-21, 2010.
  11. Valente, J. M. S; Alves, R. A. F. S., 2005. Filtered and Recovering Beam Search Algorithm for the Early/Tardy Scheduling Problem with No Idle Time, Computers & Industrial Engineering, vol. 48, pp. 363- 375, 2005.
  12. Wilson, I.; Roach, P. Container stowage planning: a methodology for generating computerised solutions, Journal of the Operational Research Society, v. 51, p. 1248-1255, 2000.
Download


Paper Citation


in Harvard Style

Tavares de Azevedo A., Maria Ribeiro C., José de Sena G., Augusto Chaves A., Leduíno Salles Neto L. and Carlos Moretti A. (2012). SOLVING THE 3D CONTAINER SHIP LOADING PLANNING PROBLEM BY REPRESENTATION BY RULES AND BEAM SEARCH . In Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-8425-97-3, pages 132-141. DOI: 10.5220/0003757801320141


in Bibtex Style

@conference{icores12,
author={Anibal Tavares de Azevedo and Cassilda Maria Ribeiro and Galeno José de Sena and Antônio Augusto Chaves and Luis Leduíno Salles Neto and Antônio Carlos Moretti},
title={SOLVING THE 3D CONTAINER SHIP LOADING PLANNING PROBLEM BY REPRESENTATION BY RULES AND BEAM SEARCH},
booktitle={Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2012},
pages={132-141},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003757801320141},
isbn={978-989-8425-97-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - SOLVING THE 3D CONTAINER SHIP LOADING PLANNING PROBLEM BY REPRESENTATION BY RULES AND BEAM SEARCH
SN - 978-989-8425-97-3
AU - Tavares de Azevedo A.
AU - Maria Ribeiro C.
AU - José de Sena G.
AU - Augusto Chaves A.
AU - Leduíno Salles Neto L.
AU - Carlos Moretti A.
PY - 2012
SP - 132
EP - 141
DO - 10.5220/0003757801320141