An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems
- 3 February 2005
- journal article
- Published by Elsevier BV in Omega
- Vol. 34 (4), 385-396
- https://doi.org/10.1016/j.omega.2004.12.001
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- New heuristic for the dynamic layout problemJournal of the Operational Research Society, 2003
- Automated facilities layout: past, present and futureAutomation in Construction, 2000
- Dynamic layout algorithms: a state-of-the-art surveyOmega, 1998
- Preprocessing for static and dynamic facility layout problemsInternational Journal of Production Research, 1997
- Ants can colour graphsJournal of the Operational Research Society, 1997
- Ant system: optimization by a colony of cooperating agentsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996
- Static and Dynamic Layout Problems with Varying AreasJournal of the Operational Research Society, 1994
- A HEURISTIC FOR THE DYNAMIC FACILITY LAYOUT PROBLEMIIE Transactions, 1993
- Quadratic assignment algorithms for the dynamic layout problemInternational Journal of Production Research, 1993
- Production data based similarity coefficient for machine-component grouping decisions in the design of a cellular manufacturing systemInternational Journal of Production Research, 1990