Journal of Intelligent Learning Systems and Applications

Volume 6, Issue 2 (May 2014)

ISSN Print: 2150-8402   ISSN Online: 2150-8410

Google-based Impact Factor: 1.5  Citations  

Simulation Model Using Meta Heuristic Algorithms for Achieving Optimal Arrangement of Storage Bins in a Sawmill Yard

HTML  XML Download Download as PDF (Size: 1467KB)  PP. 125-139  
DOI: 10.4236/jilsa.2014.62010    4,788 Downloads   6,439 Views  Citations

ABSTRACT

Bin planning (arrangements) is a key factor in the timber industry. Improper planning of the storage bins may lead to inefficient transportation of resources, which threaten the overall efficiency and thereby limit the profit margins of sawmills. To address this challenge, a simulation model has been developed. However, as numerous alternatives are available for arranging bins, simulating all possibilities will take an enormous amount of time and it is computationally infeasible. A discrete-event simulation model incorporating meta-heuristic algorithms has therefore been investigated in this study. Preliminary investigations indicate that the results achieved by GA based simulation model are promising and better than the other meta-heuristic algorithm. Further, a sensitivity analysis has been done on the GA based optimal arrangement which contributes to gaining insights and knowledge about the real system that ultimately leads to improved and enhanced efficiency in sawmill yards. It is expected that the results achieved in the work will support timber industries in making optimal decisions with respect to arrangement of storage bins in a sawmill yard.

Share and Cite:

Rahman, A. , Yella, S. and Dougherty, M. (2014) Simulation Model Using Meta Heuristic Algorithms for Achieving Optimal Arrangement of Storage Bins in a Sawmill Yard. Journal of Intelligent Learning Systems and Applications, 6, 125-139. doi: 10.4236/jilsa.2014.62010.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.