An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems

Omega

Volumn 34, Issue 4, 2006, Pages 385-396

  Baykasoglu, Adil ^a   Dereli, Turkay ^a   Sabuncu, Ibrahim ^a  

^a GAZIANTEP UNIVERSITY   (Turkey)

Author keywords

Ant colony optimization; Dynamic facility layout; Heuristics

Indexed keywords

EID: 27844552850     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2004.12.001     Document Type: Article

References (27)

1. J.A. Tompkins J.A. White Y.A. Bozer E.H. Frazelle J.M.A. Tanchoco J. Trevino Facilities planning 1996 Wiley New York
2. A. Baykasoglu N.N.Z. Gindy A simulated annealing algorithm for dynamic layout problem Computers and Operations Research 28 2001 1403-1426
3. T. Gupta H. Seifoddini Production data based similarity coefficient for machine-component grouping decisions in the design of cellular manufacturing system International Journal of Production Research 28 1990 1247-1269
4. J. Driscol J.H.F. Sawyer A computer model for investigating the relayout of batch production areas International Journal of Production Research 23 1985 783-794
5. M.J. Rosenbaltt The dynamics of plant layout Management Science 32 1986 76-85
6. T.A. Lacksonen E.E. Enscore Quadratic assignment algorithms for the dynamic layout problem International Journal of Production Research 31 1993 503-517
7. P. Afentakis R. Millen M.M. Solomon Dynamic layout strategies for flexible manufacturing systems International Journal of Production Research 28 1990 311-323
8. R.S. Liggett Automated facilities layout: Past present and future. Automation in Construction 9 2000 197-215
9. T.A. Lacksonen Static and dynamic layout problems with varying areas Journal of the Operational Research Society 45 1994 59-69
10. T.A. Lacksonen Preprocessing for static and dynamic layout problems International Journal of Production Research 35 1997 1095-1106
11. T.L. Urban A heuristic for the dynamic facility layout problem IIE Transactions 25 1993 57-63
12. D.G. Conway M.A. Venkataramanan Genetic search and the dynamic facility layout problem Computers and Operations Research 21 1994 955-960
13. J. Balakrishnan C.H. Cheng Genetic search and the dynamic layout problem Computers and Operations Research 27 2000 587-593
14. B.K. Kaku J.B. Mazzola A tabu search heuristic for the dynamic plant layout problem INFORMS: Journal on Computing 9 1997 374-384
15. E. Erel J.B. Ghosh J.T. Simon New heuristic for the dynamic layout problem Journal of the Operational Research Society 54 2003 1202-1275
16. J. Balakrishnan C.H. Cheng Dynamic layout algorithms: A state-of-the-art survey Omega: International Journal of Management Science 26 1998 507-521
17. J. Balakrishnan F.R. Jacobs M.A. Venkataramanan Solutions for the constrained dynamic facility layout problem European Journal of Operational Research 57 1992 280-286
18. Dorigo M, Maniezzo V, Colorni A. Positive feedback as a search strategy. Technical Report, 91-016, Politecnico idi Milano; 1991.
19. L.M. Gambardella M. Dorigo Ant-Q a reinforcement learning approach to the travelling salesman problem In: A. Prieditis S. Russell editors. Proceedings of the 12th international conference on machine learning, ML-95 1995 Morgan Kaufmann Tahoe City, CA 252-260
20. M. Dorigo V. Maniezzo A. Colorni The ant system: Optimization by a colony of cooperating agents IEEE Transactions on Systems, Man, and Cybernetics-Part B 26 1 1996 29-41
21. B. Bullnheimer R.F. Hartl C. Strauss A new rank-based version of the ant system: A computational study Central European Journal of Operations Research and Economics 7 1999 25-38
22. M. Dorigo G.D. Caro L.M. Gambardella Ant algorithms for optimisation Artificial Life 5 1999 137-172
23. M. Dorigo E. Bonabeau G. Theraulaz Ant algorithm and stigmergy Future Generation Computer Systems 16 2000 851-871
24. A. Colorni M. Dorigo V. Maniezzo M. Trubian Ant system for job-shop scheduling JORBEL-Belgian Journal of Operations Research, Statistics and Computer Science 34 1994 39-53
25. D. Costa A. Hertz Ants can color graphs Journal of the Operational Research Society 48 1997 295-305
26. Maniezzo V. Exact and approximate non-deterministic tree-search procedures for the quadratic assignment problem. Research Report CSR 98-1, Scienze dell'Informazione, University Di Bologna Sede Di Cesena, Italy; 1998.
27. Dereli T, Baykasoglu A, Erol R, Sabuncu I. Araç yönl endirme problemi için karýnca kolonisi optimizasyonu Yaklaşimi. TAINN'2003, Proceedings of the 12th international Turkish symposium on artificial intelligence and neural networks, 2-4 July 2003, Çanakkale, Turkey; 2003.