본문 바로가기
  • Home

An Iterative Improvement search for the Optimal Berth and crane Scheduling

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2004, 9(4), pp.117-125
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Junha Hwang ORD ID 1

1금오공과대학교

Candidate

ABSTRACT

The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship, determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which all the constraints should be satisfied. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible, while the operation cost of the terminal should be minimized. In this paper, I present an effective approach to solving this problem, which combines both constraint satisfaction search and iterative improvement search. I test this method on a real world container terminal problem and the results show that the method can produce better results than any other existing method.

Citation status

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