Flexible Services and Manufacturing Journal

, Volume 25, Issue 4, pp 576–608

A scheduling problem for a novel container transport system: a case of mobile harbor operation schedule

Article

DOI: 10.1007/s10696-012-9135-6

Cite this article as:
Nam, H. & Lee, T. Flex Serv Manuf J (2013) 25: 576. doi:10.1007/s10696-012-9135-6

Abstract

Mobile Harbor (MH) is a movable floating platform with a container handling system on board so that it can load/discharge containers to/from an anchored container ship in the open sea. As with typical quay crane operation, an efficient schedule for its operation is a key to enhancing its operational productivity. A MH operation scheduling problem is to determine a timed sequence of loading/discharging tasks, assignment of MH units to each task, and their docking position, with an objective of minimizing the makespan of a series of incoming container ships. A mixed integer programming model is formulated to formally define the problem. As a practical solution method to the problem, this paper proposes a rule-based algorithm and a random key based genetic algorithm (rkGA). Computational results show that the rkGA method produces a better-quality solution than the rule-based method, while requiring longer computation time.

Keywords

Random key based genetic algorithm Mobile harbor Operation scheduling problem Quay crane scheduling Vehicle routing problem Genetic algorithm Mixed integer programming 

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Department of Industrial and Systems EngineeringKorea Advanced Institute of Science and TechnologyTaejonRepublic of Korea

Personalised recommendations