한국컴퓨터정보학회논문지 (Journal of the Korea Society of Computer and Information)

한국컴퓨터정보학회 (Korean Society of Computer Information)
권호 표지
DOI QR코드

DOI QR Code

Stack Bin Packing Algorithm for Containers Pre-Marshalling Problem

  • Lee, Sang-Un (Dept. of Multimedia Engineering, Gangneung-Wonju National University)
  • 투고 : 2015.07.06
  • 심사 : 2015.08.18
  • 발행 : 2015.10.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper deals with the pre-marshalling problem that the containers of container yard at container terminal are relocated in consensus sequence of loading schedule of container vessel. This problem is essential to improvement of competitive power of terminal. This problem has to relocate the all of containers in a bay with minimum number of movement. There are various algorithms such as metaheuristic as genetic algorithm and heuristic algorithm in order to find the solution of this problem. Nevertheless, there is no unique general algorithm that is suitable for various many data. And the main drawback of metaheuristic methods are not the solution finding rule but can be find the approximated solution with many random trials and by coincidence. This paper can be obtain the solution with O(m) time complexity that this problem deals with bin packing problem for m stack bins with descending order of take out ranking. For various experimental data, the proposed algorithm can be obtain the optimal solutions for all of data. And to conclude, this algorithm can be show that most simple and general algorithm with simple optimal solution finding rule.

키워드

참고문헌

  1. B. H. Ha and S. S. Kim, "A$^*$ Algorithm for Optimal Intra-Bay Container Pre-Marshalling Plan," Journal of the Korean Institute of Industrial Engineers, Vol. 38, No. 2, pp. 157-172, Jun. 2012. https://doi.org/10.7232/JKIIE.2012.38.2.157
  2. M. S. Gheith, A. B. Eltawil, and N. A. Harraz, "A Proposed Heuristic for Solving the Container Pre-Marshalling Problem," The 19th International Conference on Industrial Engineering and Engineering Management, pp. 955-964, Apr. 2013.
  3. M. S. Gheith, A. B. Eltawil, and N. A. Harraz, "Container Pre-Marshalling Problem: Review and Solution Framework," The IEEE International Conference on Industrial Engineering and Engineering Management, At Hong Kong, pp. 283-287, Oct. 2012.
  4. W. Zhu, H. Qin, A. Lim, and H. Zhang, "Iterative Deepening A$^*$ Algorithms for the Container Relocation Problem," IEEE Trans. on Automation Science and Engineering, Vol. 9, No. 4, pp. 710-722, Oct. 2012. https://doi.org/10.1109/TASE.2012.2198642
  5. K. Tierney, D. Pacino, and S. VoB, "Solving the Pre-Marshalling Problem to Optimality with A$^*$ and IDA$^*$," Conference of the International Federation of Operational Research Societies., Barcelona, Spain, Mar. 2014.
  6. A. Bortfeldt and F. Forster, "A Tree Search Procedure for the Container Pre-Marshalling Problem," European Journal of Operational Research, Vol. 217, No. 3, pp. 531-540, Mar. 2012. https://doi.org/10.1016/j.ejor.2011.10.005
  7. F. Forster and A. Bortfeldt, "A Tree Search Procedure for the Container Relocation Problem," Computers & Operations Research, Vol. 39, No. 2, pp. 299-309, Feb. 2012. https://doi.org/10.1016/j.cor.2011.04.004
  8. B. Jin, W. Zhu, and A. Lim, "Solving the Container Relocation Problem by an Improved Greedy Look-Ahead Heuristic," European Journal of Operational Research, Vol. 240, No. 3, pp. 837-847, Feb. 2015. https://doi.org/10.1016/j.ejor.2014.07.038
  9. M. S. Gheith, A. B. Eltawil, N. A. Harraz, and S. Mizuno, "An Integer Programming Formulation and Solution for the Container Pre-Marshalling Problem," Proceedings of 44th International Conference on Computers and Industrial Engineering & 9th International Symposium on Intelligent Manufacturing and Service Systems, Istanbul, Turkey, pp. 2047-2056, Oct. 2014.
  10. Y. S. Lee and N. Y. Hsu, "A Neighborhood Search Heuristic for Pre-Marshalling Export Containers," European Journal of Operational Research, Vol. 196, No. 2, pp. 468-475, Jul. 2009. https://doi.org/10.1016/j.ejor.2008.03.011
  11. M. Caserta, S. VoB, and M. Sniedovich, "Applying the Corridor Method to a Blocks Relocation Problem," OR Spectrum, Vol. 33, No. 4, pp. 915-929, Oct. 2011. https://doi.org/10.1007/s00291-009-0176-5
  12. M. Caserta and S. VoB, "A Corridor Method-Based Algorithm for the Pre-Marshalling Problem," Proceedings of Applications of Evolutionary Computing, Lecture Notes in Computer Science, Vol. 5484, pp. 788-797, Apr. 2009.
  13. E. Zehendner and D. Feillet, "Branch and Price Approach for the Container Relocation Problem," International Journal of Production Research, Vol. 52, No. 24, pp. 7159-7176, Sep. 2014 https://doi.org/10.1080/00207543.2014.965358
  14. P. Sriphrabu, K. Sethanan, and B. Arnonkijpanich, "A Solution of the Container Stacking Problem by Genetic Algorithm," IACSIT International Journal of Engineering and Technology, Vol. 5, No. 1, pp. 45-49, Feb. 2013.
  15. R. Jovanovic, M. Tuba, and S. VoB, "A Multi-Heuristic Approach for Solving the Pre-Marshalling Problem," Cornell University Library, arXiv:1411. 0967, pp. 1-19, Nov. 2014.
  16. A. B. Eltawil, "A Systematic Approach to Container Terminal Planning and Operational Decision Making," The International Maritime Transport & Logistics Conference, pp. 1-14, Mar. 2013.
  17. E. I. Christopher, M. B. Belen, and M. V. Marcos, "Pre-Marshalling Problem: Heuristic Solution Method and Instance Generator," Expert Systems with Applications, Vol. 39, No. 9, pp. 8337-8349, Jul. 2012. https://doi.org/10.1016/j.eswa.2012.01.187
  18. S. H. Huang and T. H. Lin, "Heuristic Algorithms for Container Pre-Marshalling Problems," Computers & Industrial Engineering, Vol. 62, No. 1, pp. 13-20, Feb. 2012. https://doi.org/10.1016/j.cie.2011.08.010
  19. Y. S. Lee and N. Y. Hsu, "An Optimization Model for the Container Pre-Marshalling Problem," Journal of Computers and Operations Research, Vol. 34, No. 11, pp. 3295-3313, Nov. 2007. https://doi.org/10.1016/j.cor.2005.12.006