Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

Deployment Planning of Blocks from Storage Yards Using a Tabu Search Algorithm

타부서치 알고리즘을 이용한 적치장의 블록 반출계획

  • Lee, Sang-Hyup (Automation and Control Research Department, Industrial Research Institute, Hyundai Heavy Industries Co. LTD.) ;
  • Kim, Ji-On (Automation and Control Research Department, Industrial Research Institute, Hyundai Heavy Industries Co. LTD.) ;
  • Moon, Il-Kyeong (Department of Industrial Engineering, Pusan National University)
  • 이상협 (현대중공업 산업기술연구소 자동화연구실) ;
  • 김지온 (현대중공업 산업기술연구소 자동화연구실) ;
  • 문일경 (부산대학교 산업공학과)
  • Received : 2011.05.07
  • Accepted : 2011.07.11
  • Published : 2011.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

At a shipyard, the efficient handling of blocks is one of the most important factors in the shipbuilding process. We consider the problem of deployment planning of blocks from storage yards. As some information of block arrangement should be considered to handle the problem, we adopt the block arrangement based on the coordinates and sizes of each block at a storage yard. Deployment planning for a block involves deciding upon its transportation route from the storage yard and searching for blocks that would obstruct its transportation along this route. A tabu search algorithm for deploying several blocks is developed to minimize the number of obstructive blocks deployed together from the storage yards at a shipyard. The results of computational experiments show that the developed algorithm is very useful in the deployment planning of multiple blocks from the storage yards.

Keywords

References

  1. Aladag, C., Hocaoglu, G., and Basaran, M. (2009), The effect of neighborhood structure on tabu search algorithm in solving course timetabling problem, Expert Systems with Applications, 36, 12349-12356. https://doi.org/10.1016/j.eswa.2009.04.051
  2. Bazzazi, M., Safaei, N., and Javadian, N. (2009), A genetic algorithm to solve the storage space allocation problem in a container terminal, Computers and Industrial Engineering, 53(1), 44-52.
  3. Eksioglu, B., Eksioglu, S., and Jain, P. (2008), A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods, Computers and Industrial Engineering, 54, 1-11. https://doi.org/10.1016/j.cie.2007.04.004
  4. Gao, M., Gen, M., Sun, L., and Zhao, X. (2007), A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems, Computers and Industrial Engineering, 53, 149-162. https://doi.org/10.1016/j.cie.2007.04.010
  5. Glover, F. (1989), Tabu search-Part I. ORSA Journal on Computing, 1, 190-206. https://doi.org/10.1287/ijoc.1.3.190
  6. Kim, K. and Hong, G. (2006), A heuristic rule for relocating blocks, Computers and Operations Research, 33, 940-954. https://doi.org/10.1016/j.cor.2004.08.005
  7. Koh, S., Park, J., Choi, Y., and Joo, M. (1999), Development of a Block Assembly Scheduling System for Shipbuilding Company, IE interfaces, 12(4), 586-594.
  8. Kozan, E. and Preston, P. (2006), Mathematical modeling of container transfers and storage locations at seaport terminals, OR Spectrum, 28, 519-537. https://doi.org/10.1007/s00291-006-0048-1
  9. Lee, K., Lee, J., and Choi, S. (1996), A spatial scheduling system and its application to shipbuilding : DAS-CURVE, Expert Systems with Applications, 10, 311-324. https://doi.org/10.1016/0957-4174(96)00010-3
  10. Lee, K., Lee, J., Park, H., Hong, J. and Lee, S. (1997), Developing scheduling systems for Daewoo Shipbuilding : DAS project, European Journal of Operational Research, 97, 380-395. https://doi.org/10.1016/S0377-2217(96)00205-6
  11. Park, C. and Seo, J. (2009a), Genetic Algorithm of Planar Storage Location Assignment Problem, Journal of the Korean Institute of Industrial Engineers, 35(2), 129-140.
  12. Park, C. and Seo, J. (2009b), Mathematical modeling and solving procedure of the planar storage location assignment problem, Computers and Industrial Engineering, 57, 1062-1071. https://doi.org/10.1016/j.cie.2009.04.010
  13. Park, C. and Seo, J. (2010), Comparing heuristic algorithm of the planar storage location assignment problem, Transportation Research Part E, 46, 171-185. https://doi.org/10.1016/j.tre.2009.07.004
  14. Xu, J., Sohoni, M., McCleery, M., and Bailey, T. (2006), A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems, European Journal of Operational Research, 169, 978-993. https://doi.org/10.1016/j.ejor.2004.08.023
  15. Zhang, C., Liu, J., Wan, Y., Murth, K., and Linn, R. (2003), Storage space allocation in container terminals, Transportation Research Part B, 37, 883-903. https://doi.org/10.1016/S0191-2615(02)00089-9

Cited by

  1. A Mathematical Programming Approach for Block Storage Problem in Shipbuilding Process vol.30, pp.3, 2013, https://doi.org/10.7737/KMSR.2013.30.3.099
  2. Analysis Framework using Process Mining for Block Movement Process in Shipyards vol.39, pp.6, 2013, https://doi.org/10.7232/JKIIE.2013.39.6.577
  3. A Heuristic Algorithm for Block Storage Planning in Shipbuilding vol.51, pp.3, 2014, https://doi.org/10.3744/SNAK.2014.51.3.239
  4. Quay Wall Scheduling of Ships Using Assignment Method and Tabu Search Algorithm vol.41, pp.1, 2015, https://doi.org/10.7232/JKIIE.2015.41.1.001