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

  • 제35권2호
  • /
  • Pages.129-140
  • /
  • 2009
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

평면적 저장 위치 할당 문제에 대한 유전자 알고리즘

Genetic Algorithm of the Planar Storage Location Assignment Problem

  • Park, Chang-Kyu (College of Business Administration, University of Ulsan) ;
  • Seo, Jun-Yong (College of Business Administration, University of Ulsan)
  • 투고 : 20080000
  • 심사 : 20080000
  • 발행 : 2009.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper introduces the planar storage location assignment problem (PSLAP) that no research has attempted to mathematically solve. The PSLAP can be defined as the assignment of the inbound and outbound objects to the storage yard with aim of minimizing the number of obstructive object moves. The storage yard allows only planar moves of objects. The PSLAP usually occurs in the assembly block stockyard operations at a shipyard. This paper formulates the PSLAP using a mathematical programming model, but which belongs to the NP-hard problems category. Thus this paper utilizes an efficient genetic algorithm (GA) to solve the PSLAP for real-sized instances. The performance of the proposed mathematical programming model and developed GA is verified by a number of numerical experiments.

키워드

참고문헌

  1. 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, 56(1), 44-52 https://doi.org/10.1016/j.cie.2008.03.012
  2. Gen, M. and Cheng, R. (1997), Genetic algorithms and engineering design, New York : John Wiley and Sons
  3. Imai, A., Nishimura, E., and Papadimitriou, S. (2003), Berth allocation with service priority, Transportation Research Part B, 37, 437-457 https://doi.org/10.1016/S0191-2615(02)00023-1
  4. Imai, A., Sasaki, K., Nishimura, E., and Papadimitriou, S. (2006), Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks, European Journal of Operational Research, 171, 373-389 https://doi.org/10.1016/j.ejor.2004.07.066
  5. Imai, A., Chen, H. C., Nishimura, E., and Papadimitriou, S. (2008), The simultaneous berth and quay crane allocation problem, Transportation Research Part E, 44(5), 900-920 https://doi.org/10.1016/j.tre.2007.03.003
  6. Imai, A., Nishimura, E., Hattori, M., and Papadimitriou, S. (2007), Berth allocation at indented berths for mega-container ships, European Journal of Operational Research, 179, 579-593 https://doi.org/10.1016/j.ejor.2006.03.034
  7. Imai, A., Nishimura, E., and Papadimitriou, S. (2008), Berthing ships at a multi-user container terminal with a limited quay capacity, Transportation Research Part E, 44, 136-151 https://doi.org/10.1016/j.tre.2006.05.002
  8. Kozan, E. and Preston, P. (1999), Genetic algorithms to schedule container transfers at multimodal terminals, International Transactions in Operational Research, 6, 311-329 https://doi.org/10.1111/j.1475-3995.1999.tb00158.x
  9. 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
  10. Nishimura, E., Imai, A., and Papadimitriou, S. (2001), Berth allocation planning in the public berth system by genetic algorithms, European Journal of Operational Research, 131, 282-292 https://doi.org/10.1016/S0377-2217(00)00128-4
  11. Preston, P. and Kozan, E. (2001), An approach to determine storage locations of containers at seaport terminals, Computers and Operations Research, 28, 983-995 https://doi.org/10.1016/S0305-0548(00)00020-4
  12. Sarker, R. and Newton, C. (2002), A genetic algorithm for solving economic lot size scheduling problem, Computers and Industrial Engineering, 42, 189-198 https://doi.org/10.1016/S0360-8352(02)00027-X
  13. Vollmann, T. E., Berry, W. L., and Whybark, D. C. (1988), Manufacturing planning and control systems, Illinois : Irwin
  14. Watters, L. J. (1967), Reduction of integer polynomial programming problems to zero-one liner programming problems, Operations Research, 15, 1171-1174 https://doi.org/10.1287/opre.15.6.1171
  15. Zhang, C., Liu, J., Wan, Y., Murty, K. G., and Linn, R. J. (2003), Storage space allocation in container terminals, Transportation Research Part B, 37, 883-903 https://doi.org/10.1016/S0191-2615(02)00089-9