본문 바로가기
  • Home
Basic Search

Stack Bin Packing Algorithm for Containers Pre-Marshalling Problem

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2015, 20(10), pp.61-68
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

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    time complexity that this problem deals with bin packing problem for  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.

Statistics

  • 409 Viewed
  • 96 Downloaded

Tools

Issue List

Citation status

* References for papers published after 2023 are currently being built.

Basic Search Advanced Search