Comparing heuristic algorithms of the planar storage location assignment problem |
| |
Authors: | Changkyu Park Junyong Seo |
| |
Institution: | aCollege of Business Administration, University of Ulsan, Daehakro 102, Nam-Gu, Ulsan 680-749, Republic of Korea |
| |
Abstract: | This paper discusses the newly defined planar storage location assignment problem (PSLAP). We develop a mathematical programming model and GA-based and dynamic PSLAP heuristic algorithms for the solving procedure. Using the testing set, we compare the performance of GA-based and dynamic PSLAP heuristic algorithms. The mathematical programming model is utilized as a comparison criterion. The comparison results demonstrate that the dynamic PSLAP heuristic algorithm performs better than the other solving procedures. In addition, we describe simulation experiments conducted to investigate the effects of stock yard layout and production schedule instability on the operation of the block stock yard. |
| |
Keywords: | Shipbuilding Block stock yard Storage location assignment problem Heuristic algorithm Genetic algorithm Mathematical programming model |
本文献已被 ScienceDirect 等数据库收录! |