Abstract
Nowadays, shipyards are making every effort to efficiently manage their resources such as gantry cranes, transporters, and block stock yards. The scheduling of block lifting for a gantry crane has been manually performed by an expert shipyard manager for many years. Such a practice, however, can lead to an undesirably long time to produce scheduling plans. In addition, the quality of the scheduling plans may not be optimal. To improve the overall process, a block lifting scheduling system for a gantry crane was developed in this study by using optimization techniques. A block lifting scheduling problem was first formulated as a multiobjective optimization problem. For a gantry crane, minimization of the traveling distance while unloaded and wire and shackle replacement between block lifting was considered. An optimization algorithm based on the genetic algorithm was then proposed and implemented so as to solve the problem. To evaluate the efficiency and applicability of the developed system, the system was applied to an actual block lifting scheduling problem in a shipyard. Compared to results achieved by manual scheduling by an expert manager, the results of this work show that blocks can be more efficiently lifted by a gantry crane when the developed system is applied.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Abbreviations
- α and β:
-
Weighting factors
- D i :
-
Traveling distance of block i from the initial position to the target position
- d i,i+1 :
-
Traveling distance of the crane while unloaded from block i to the next block i + 1
- d i,W :
-
Traveling distance of the crane while unloaded from block i to the wire and shackle stockyard for replacement
- d W,i+1 :
-
Traveling distance of the crane while unloaded from the wire and shackle stockyard to block i + 1 after replacement
- f i :
-
Lifting finish time of block i
- l i :
-
Available lifting time of block i (start of the lifting time slot)
- N :
-
Total number of blocks
- p j :
-
Lifting start time of block j of high priority
- p k :
-
Lifting start time of block k of low priority
- r i,i+1 :
-
Whether wire and shackle replacement is necessary when traveling from block i to block i + 1 (unnecessary = 0, necessary = 1)
- R u :
-
Penalty coefficients
- s i :
-
Lifting start time of block i
- T e :
-
Daily work finish time of the shipyard
- T i :
-
Traveling time of block i from the initial position to the target position
- t i,i+1 :
-
Traveling time of the crane while unloaded from block i to the next block i + 1
- t i,W :
-
Traveling time of the crane while unloaded from block i to the wire and shackle stockyard for replacement
- T r :
-
Necessary time for wire and shackle replacement
- t W,i+1 :
-
Traveling time of the crane while unloaded from the wire and shackle stockyard to block i + 1 after replacement
- u i :
-
Planned lifting finish time of block i (end of the lifting time slot)
- V il :
-
Moving speed of the crane while unloaded in the longitudinal direction of the building dock
- V it :
-
Moving speed of the crane while unloaded in the transverse direction of the building dock
- V ll :
-
Moving speed of the crane while loaded in the longitudinal direction of the building dock
- V lt :
-
Moving speed of the crane while loaded in the transverse direction of the building dock
References
Daganzo CF (1989) The crane scheduling problem. Transp Res B 23(3):159–175
Daganzo CF (1990) Crane productivity and ship delay in ports. Transp Res Rec 1251:1–9
Peterkofsky RI, Daganzo CF (1990) A branch and bound solution method for the crane scheduling problem. Transp Res B 24(3):159–172
Kim KH, Kim KY (1999) An optimal routing algorithm for a transfer crane in port container terminals. Transp Sci 33(1):17–33
Ng WC, Mak KL (2005) An effective heuristic for scheduling a yard crane to handle jobs with different ready times. Eng Optim 37(8):867–877
Kim KH, Park KT (1998) A dynamic space allocation method for outbound containers in carrier-direct system. In: Proceedings of the third annual international conference on industrial engineering theories, applications and practice, vol 2. Hong Kong, 28–31 December, pp 859–867
Kim HG, Kim CH (2007) A study on the optimal routing problem for a transfer crane. In: Proceedings of the annual spring meeting on Korean Operations Research and Management Science Society/Korean Institute of Industrial Engineers. Jinju, Korea, 25–26 May, pp 497–505
Cohon JL (1978) Multiobjective programming and planning. Academic Press Inc., New York
Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison Wesley, Reading
Davis L (1991) Handbook of genetic algorithms. Van Nostrand-Reinhold, New York
Lee KY, Han SN, Roh MI (2003) An improved genetic algorithm for facility layout problems having inner structure walls and passages. Comput Oper Res 30(1):117–138
Grefenstette J (1986) Optimization of control parameters for genetic algorithms. IEEE Trans Syst Man Cybern 16(1):122–128
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Roh, MI., Lee, KY. Optimal scheduling of block lifting in consideration of the minimization of traveling distance while unloaded and wire and shackle replacement of a gantry crane. J Mar Sci Technol 15, 190–200 (2010). https://doi.org/10.1007/s00773-009-0080-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00773-009-0080-3