Article ID Journal Published Year Pages File Type
1024016 Transportation Research Part E: Logistics and Transportation Review 2010 15 Pages PDF
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.

Related Topics
Social Sciences and Humanities Business, Management and Accounting Business and International Management
Authors
, ,