Layout of facilities using an ant system approach

Engineering Optimization

Volumn 32, Issue 1, 1999, Pages 101-115

  Bland, J A ^a  

^a NOTTINGHAM TRENT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; FACILITIES LAYOUT;

PLANT LAYOUT;

EID: 0033345301     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/03052159908941293     Document Type: Article

References (21)

1. Koopmans, T. C. and Beckmann, M. (1957). Assignment problems and the location of economic activities. Econometrica, 25, 53-76.
2. Gavett, J. W. and Plyter, N. V. (1966). The optimal assignment of facilities to locations by branch and bound. Oper. Res., 14, 210-232.
3. Nugent, C. E., Vollmann, T. E. and Ruml, J. (1968). An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res., 16, 150-173.
4. Gilmore, P. C. (1970). Optimal and suboptimal algorithms for the quadratic assignment problem. Management Science, 16, 453-471.
5. Bazaara, M. S. and Elshafei, A. N. (1979). Exact and heuristic procedures for the quadratic assignment problem. Naval Res. Log. Quart., 26, 109-121.
6. Carey, M. R. and Johnson, D. S. (1979). Computers and Intractability, Freeman, San Fransisco.
7. Burkard, R. E. and Stratmann, K. H. (1978). Numerical investigations on quadratic assignment problems. Naval Res. Log. Quart., 25, 129-148.
8. Bazaara, M. S. and Kirka, O. (1983). A branch and bound based heuristic for solving the quadratic assignment problem. Naval Res. Log. Quart., 30, 287-304.
9. Burkard, R. E. and Rendl, F. (1984). A thermodynamically motivated simulation procedure for combinatorial optimization problems. Eur. J. of O.R., 17, 169-174.
10. Wilhelm, M. R. and Ward, T. L. (1987). Solving quadratic assignment problems by simulated annealing. IIE Transactions, March, pp. 107-119.
11. Heragu, S. S. and Alfa, A. S. (1992). Experimental analysis of simulated annealing based algorithms for the layout problem. Eur. J. of O.R., 57, 190-202.
12. Skorin-Kapov, J. (1990). Tabu search applied to the quadratic assignment problem. ORSA J. on Computing, 2(1), 33-45.
13. Taillard, E. (1991). Robust taboo search for the quadratic assignment problem. Parallel Computing, 17, 443-455.
14. Chan, K. C. and Tansri, H. (1994). A study of genetic crossover operations on the facilities layout problem. Computers Ind. Engng., 26, 537-550.
15. Tate, D. M. and Smith, A. E. (1995). A genetic approach to the quadratic assignment problem. Computers Ops. Res., 22, 73-83.
16. Laarhoven, P. J. M. and Aarts, E. H. L. (1987). Simulated Annealing, Theory and Applications. D. Reidel Publishing Co., Holland.
17. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, U.S.A.
18. Dorigo, M., Maniezzo, V. and Colorni, A. (1996). The ant system: optimization by a colony of co-operating agents. IEEE Trans. Syst. Man and Cybernetics, 26, 1-13.
19. Glover, F. (1989). Tabu search, Part I. ORSA J. on Computing, 1(3), 190-206.
20. Glover, F. (1990). Tabu search, Part II. ORSA J. on Computing, 2(1), 4-32.
21. Maniezzo, V., Colorni, A. and Dorigo, M. (1994). The ant system applied to the quadratic assignment problem. Technical Report 94/28, IRIDIA, Universite de Bruxelles, Belgium.