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

Cited 8 time in webofscience Cited 0 time in scopus
  • Hit : 355
  • Download : 0
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.
Publisher
SPRINGER
Issue Date
2013-12
Language
English
Article Type
Article
Keywords

VEHICLE-ROUTING PROBLEMS; GENETIC ALGORITHM; TERMINALS; SINGLE; BRANCH

Citation

FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, v.25, no.4, pp.576 - 608

ISSN
1936-6582
DOI
10.1007/s10696-012-9135-6
URI
http://hdl.handle.net/10203/201480
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 8 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0