산업공학 (IE interfaces)

  • 제24권4호
  • /
  • Pages.362-372
  • /
  • 2011
  • /
  • 1225-0996(pISSN)
  • /
  • 2234-6465(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지
DOI QR코드

DOI QR Code

컨테이너 픽업문제를 위한 유전자 알고리듬

A Genetic Algorithm for the Container Pick-Up Problem

  • 이시우 (부산대학교 산업공학과)
  • Lee, Shi-W. (Department of Industrial Engineering, Pusan National University)
  • 투고 : 2011.08.15
  • 심사 : 2011.11.05
  • 발행 : 2011.12.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Container pick-up scheduling problem is to minimize the total container handling time, which consists of the traveling distance and the setup time of yard cranes in a container yard. Yard cranes have to pick-up the containers which are stacked in the yard-bays to satisfy the work schedule requirement of quay crane, which loads and unloads containers on or from container ships. This paper allows the movement of multiple yard cranes among storage blocks. A mixed integer programming model has been formulated and a genetic algorithm (GA) has been proposed to solve problems of large sizes. Computational results show that the proposed GA is an effective method.

키워드

참고문헌

  1. Behenna, P. (2001), Container Asset Visibility : The Key to Reducing Ocean Carrier Operating Costs, International Asset Systems, 1-9.
  2. Jung, S. H. and Kim, K. H. (2006), Load scheduling for multiple quay cranes in port container terminals, Journal of Intelligent Manufacturing, 17, 479-492. https://doi.org/10.1007/s10845-005-0020-y
  3. Kim, K. Y. and Kim, K. H. (1999a), A routing algorithm for a single straddle carrier to load export containers onto a containership, International Journal of Production Economics, 59, 425-433. https://doi.org/10.1016/S0925-5273(98)00108-X
  4. Kim, K. H. and Kim, K. Y. (1999b), Routing straddle carriers for the loading operation of containers using a beam search algorithm, Computers and Industrial Engineering, 36 , 109-136. https://doi.org/10.1016/S0360-8352(99)00005-4
  5. Kim, K. H. and Kim, K. Y. (1999c), An optimal routing algorithm for a transfer crane in port container terminals, Transportation Science, 33(1), 17-33. https://doi.org/10.1287/trsc.33.1.17
  6. Kim, K. Y. and Kim, K. H. (2002), Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals, Naval Research Logistics, 50, 498-514.
  7. Kozan, E. and Preston, P. (1999), Genetic algorithms to schedule container transfers at multimodal terminals, International Transactions in Operational Research, 6, 331-329. https://doi.org/10.1111/j.1475-3995.1999.tb00159.x
  8. Lee, D. H., Zhi, C., and Meng, Q. (2007), Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm, International Journal of Production Economics, 107, 115-124. https://doi.org/10.1016/j.ijpe.2006.08.003
  9. Linn, J. R. and Zhang, C. Q. (2003), A heuristic for dynamic yard crane deployment in a container terminal, IIE Transactions, 35, 161- 174. https://doi.org/10.1080/07408170304384
  10. Narasimhan, A. and Palekar, U. S. (2002), Analysis and algorithms for the transtainer routing problem in container port operations, Transportation Science, 36(1), 63-78.
  11. Ng, W. C. (2005), Crane scheduling in container yards with intercrane interference, European Journal of Operational Research, 164, 64-78. https://doi.org/10.1016/j.ejor.2003.11.025
  12. Zhang, C., Wan, Y. W., Liu, J., and Linn, R. J. (2002), Dynamic crane deployment in container storage yards, Transportation Research, Part B, 36, 537-555. https://doi.org/10.1016/S0191-2615(01)00017-0

피인용 문헌

  1. 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