본문 바로가기
KERD
논문KCI 등재

Heuristic Algorithms for Assigning Ship Assembly Blocks to Storage Locations at a Shipyard

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

초록

We consider the problem of assigning ship assembly blocks to storage locations at a ship yard while allowing one-way movement of the blocks. The objective is to minimize the number of blocks obstructing other blocks’ movements. We show that the integer program in a previous study contains errors in identifying obstructive blocks and therefore, suggest another integer program without the error. Also, we suggest construction heuristics and a tabu search algorithm using properties characterizing optimal solutions of subproblems. Computational experiment results indicate that our heuristics outperform the existing algorithm in terms of solution quality.

Abstract

We consider the problem of assigning ship assembly blocks to storage locations at a ship yard while allowing one-way movement of the blocks. The objective is to minimize the number of blocks obstructing other blocks’ movements. We show that the integer program in a previous study contains errors in identifying obstructive blocks and therefore, suggest another integer program without the error. Also, we suggest construction heuristics and a tabu search algorithm using properties characterizing optimal solutions of subproblems. Computational experiment results indicate that our heuristics outperform the existing algorithm in terms of solution quality.

참고문헌 (7)

  1. Glover, F., "Tabu search-Part I", ORSA Journal on Computing, 1, pp.190~206 (1989)
  2. Glover, F., "Tabu search-Part II", ORSA Journal on Computing, 2, pp.4~32 (1990)
  3. Glover, F., "Tabu search : A tutorial", Interfaces, 20, pp.74~94 (1990)
  4. Park, C., "Assembly block storage location assignment at a shipyard : A case of Hyundai Heavy Industries", Production Planning and Control, 18, pp.180~189 (2007)
  5. Park, C., "Assembly block storage location assignment problem : Revisited", Production Planning and Control, 20, pp.216~226 (2009)
  6. Park, C., "Mathematical modeling and solving procedure of the planar storage location assignment problem", Computers and Industrial Engineering, 57, pp.1062~1071 (2009)
  7. Park, C., "Comparing heuristic algorithm of the planar storage location assignment problem", Transportation Research Part E: Logistics and Transportation Review, 46, pp.171~185 (2010)

관련 논문AI추천

이 간행물의 다른 논문 (2건)