An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems
Yazarlar (3)
Adil Baykasoğlu Dokuz Eylül Üniversitesi, Türkiye
Türkay Dereli Gaziantep Üniversitesi, Türkiye
Doç. Dr. İbrahim SABUNCU Yalova Üniversitesi, Türkiye
Makale Türü Özgün Makale (SSCI, AHCI, SCI, SCI-Exp dergilerinde yayınlanan tam makale)
Dergi Adı Omega (Q1)
Dergi ISSN 0305-0483 Wos Dergi Scopus Dergi
Dergi Tarandığı Indeksler SSCI
Makale Dili İngilizce Basım Tarihi 08-2006
Kabul Tarihi Yayınlanma Tarihi 01-08-2006
Cilt / Sayı / Sayfa 34 / 4 / 385–396 DOI 10.1016/j.omega.2004.12.001
Makale Linki http://dx.doi.org/10.1016/j.omega.2004.12.001
Özet
The main characteristic of today's manufacturing environments is volatility. Under a volatile environment, demand is not stable. It changes from one production period to another. To operate efficiently under such environments, the facilities must be adaptive to changing production requirements. From a layout point of view, this situation requires the solution of the dynamic layout problem (DLP). DLP is a computationally complex combinatorial optimization problem for which optimal solutions can only be found for small size problems. It is known that classical optimization procedures are not adequate for this problem. Therefore, several heuristics including taboo search, simulated annealing and genetic algorithm are applied to this problem to find a good solution. This work makes use of the ant colony optimization (ACO) algorithm to solve the DLP by considering the budget constraints. The paper makes the first attempt to show how the ACO can be applied to DLP with the budget constraints. In the paper, example applications are presented and computational experiments are performed to present suitability of the ACO to solve the DLP problems. Promising results are obtained from the solution of several test problems. (c) 2005 Elsevier Ltd. All rights reserved.
Anahtar Kelimeler
dynamic facility layout | ant colony optimization | heuristics