Browse > Article

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)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.35, no.2, 2009 , pp. 129-140 More about this Journal
Abstract
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.
Keywords
Planar Storage Location Assignment Problem; Mathematical Programming Model; Genetic Algorithm; Assembly Block Stockyard;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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   DOI   ScienceOn
2 Vollmann, T. E., Berry, W. L., and Whybark, D. C. (1988), Manufacturing planning and control systems, Illinois : Irwin
3 Watters, L. J. (1967), Reduction of integer polynomial programming problems to zero-one liner programming problems, Operations Research, 15, 1171-1174   DOI   ScienceOn
4 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   DOI   ScienceOn
5 Kozan, E. and Preston, P. (2006), Mathematical modeling of container transfers and storage locations at seaport terminals, OR Spectrum, 28, 519-537   DOI   ScienceOn
6 Gen, M. and Cheng, R. (1997), Genetic algorithms and engineering design, New York : John Wiley and Sons
7 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   DOI   ScienceOn
8 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   DOI   ScienceOn
9 Preston, P. and Kozan, E. (2001), An approach to determine storage locations of containers at seaport terminals, Computers and Operations Research, 28, 983-995   DOI   ScienceOn
10 Kozan, E. and Preston, P. (1999), Genetic algorithms to schedule container transfers at multimodal terminals, International Transactions in Operational Research, 6, 311-329   DOI   ScienceOn
11 Sarker, R. and Newton, C. (2002), A genetic algorithm for solving economic lot size scheduling problem, Computers and Industrial Engineering, 42, 189-198   DOI   ScienceOn
12 Imai, A., Nishimura, E., and Papadimitriou, S. (2003), Berth allocation with service priority, Transportation Research Part B, 37, 437-457   DOI   ScienceOn
13 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   DOI   ScienceOn
14 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   DOI   ScienceOn
15 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   DOI   ScienceOn