A population-based hybrid ant system for quadratic assignment formulations in facility layout design

International Journal of Advanced Manufacturing Technology

Volumn 44, Issue 5-6, 2009, Pages 548-558

  Ramkumar, A S ^a   Ponnambalam, S G ^b   Jawahar, N ^c  

^a AMRITA SCHOOL OF ENGINEERING   (India)

^b MONASH UNIVERSITY MALAYSIA   (Malaysia)

^c THIAGARAJAR COLLEGE OF ENGINEERING   (India)

Author keywords

Ant systems; Facility layout; Metaheuristics; Quadratic assignment problem

Indexed keywords

ANT ALGORITHMS; ANT COLONIES; ANT SYSTEMS; ANT-COLONY OPTIMIZATION; BIOLOGICALLY INSPIRED; COMBINATORIAL OPTIMIZATION PROBLEMS; FACILITY LAYOUT; FACILITY LAYOUT DESIGN; HYBRID ANT SYSTEM; HYBRID METHOD; MAX-MIN ANT SYSTEM; METAHEURISTIC; METAHEURISTICS; NP-HARD; QUADRATIC ASSIGNMENT; QUADRATIC ASSIGNMENT PROBLEM; QUADRATIC ASSIGNMENT PROBLEMS; REACTIVE TABU SEARCH; RESEARCH PROBLEMS;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PLANT LAYOUT; ROUTING ALGORITHMS; TABU SEARCH; TRAVELING SALESMAN PROBLEM;

SIMULATED ANNEALING;

EID: 68949203876     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-008-1849-y     Document Type: Article

References (39)

1. Francis RL, McGinnis LF, White JA (1992) Facility layout and location: an analytical approach. Prentice Hall, Englewood Cliffs, NJ
2. RD Meller KY Gau 1996 The facility layout problem: recent and emerging trends and perspectives J Manuf Syst 15 5 351 366 doi:10.1016/0278-6125(96) 84198-7
3. A Kusiak SS Heragu 1987 The facility layout problem Eur J Oper Res 29 229 251 doi:10.1016/0377-2217(87)90238-4 (Pubitemid 17598427)
4. SP Singh RRK Sharma 2006 A survey on various approaches to solve facility layout problem Int J Adv Manuf Technol 30 425 433 doi:10.1007/s00170-005-0087-9 (Pubitemid 44370977)
5. TC Koopmans M Beckmann 1957 Assignment problems and the location of economic activities Econometrica 25 53 76 doi:10.2307/1907742
6. MS Bazaraa 1975 Computerized layout design: a branch and bound approach AIIE Trans 7 4 432 437
7. EL Lawler 1963 The quadratic assignment problem Manag Sci 9 586 599
8. L Kaufman F Broeckx 1978 An algorithm for the quadratic assignment problem using Bender's decomposition Eur J Oper Res 15 169 177
9. LR Foulds DF Robinson 1978 Graph theoretic heuristics for the plant layout problem Int J Prod Res 16 1 27 37 doi:10.1080/00207547808929997
10. Malucelli F (1993) Quadratic assignment problems: solution methods and applications. Unpublished Doctoral Dissertation, Departmento Informatica, Universita Di Pisa, Italy
11. Paradalos PM, Rendl F, Wolkowicz H (1994) The quadratic assignment problem: A survey and recent developments. In: PM Paradalos and H Wolkowicz, eds., Quadratic assignment related problems, DIMACS Series in discrete mathematics and theoretical computer science 16:1-42
12. RE Burkaard SE Karish F Rendl 1997 QAPLIB-a quadratic assignment problem library J Glob Optim 10 391 403 doi:10.1023/A:1008293323270
13. Pardalos PM, Crouse J (1989) A parallel algorithm for the quadratic assignment problem. Proceedings of the Supercomputing 1989 Conference, ACM Press, pp 351-360
14. MS Bazaraa HD Sherli 1980 Bender's partitioning scheme applied to a new formulation of the quadratic assignment problem Nav Res Logist Q 27 1 29 41 doi:10.1002/nav.3800270104
15. N Christofides E Benavent 1989 An exact algorithm for the quadratic assignment problem Oper Res 37 760 768
16. ES Buffa GC Armour TE Vollmann 1964 Allocating facilities with CRAFT Harv Bus Rev 42 136 158
17. Muller-Merbach H (1970) Optimale reihenfolgen. Springer, Berlin, pp 158-179
18. DH West 1983 Algorithm 608: approximate solution of the quadratic assignment problem ACM Trans Math Softw 9 461 466 doi:10.1145/356056.356062 (Pubitemid 14491774)
19. RE Burgard T Bonniger 1983 A heuristic for quadratic boolean programs with applications to quadratic assignment problems Eur J Oper Res 13 374 386 doi:10.1016/0377-2217(83)90097-8 (Pubitemid 13571641)
20. Li Y, Paradalos PM, Resende MGC (1994) A greedy randomized adaptive search procedure for the quadratic assignment problem. In: PM Paradalos and H Wolkowicz, eds., Quadratic assignment related problems, DIMACS Series in discrete mathematics and theoretical computer science 16:237-261
21. MR Wilhelm TL Ward 1987 Solving quadratic assignment problems by simulated annealing IIE Trans 19 107 119 doi:10.1080/07408178708975376
22. J Skorin-Kapov 1990 Tabu search applied to the quadratic assignment problem ORSA J Comput 2 33 45
23. ED Taillard 1991 Robust tabu search for the quadratic assignment problem Parallel Comput 17 443 455 doi:10.1016/S0167-8191(05)80147-4
24. Fleurent C, Ferland JA (1994) Genetic hybrids for the quadratic assignment problem. DIMACS series in discrete mathematics and theoretical computer science, vol. 16. American Mathematical Society, Providence, RI, pp 173-187
25. DM Tate AE Smith 1995 A genetic approach to the quadratic assignment problem Comput Oper Res 22 1 78 83 doi:10.1016/0305-0548(93)E0020-T
26. KR Ahuja JB Orlin A Tiwari 2000 A greedy algorithm for the quadratic assignment problem Comput Oper Res 27 917 934 doi:10.1016/S0305-0548(99)00067-2 (Pubitemid 30334510)
27. Maniezzo V, Dorigo M, Colorini A (1994) The ant system applied to the quadratic assignment problem. Technical Report IRIDIA/94-28, Universite Libre de Bruxelles, Belgium
28. M Dorido V Maniezzo A Colorni 1996 The ant system: optimization by a colony of cooperating agents IEEE Trans Syst Man Cybern Part B 26 1 29 41
29. EM Loiola NMM Abreu PO Boaventura-Netto P Hahn T Querido 2007 A survey for the quadratic assignment problem Eur J Oper Res 176 2 657 690 doi:10.1016/j.ejor.2005.09.032 (Pubitemid 44537635)
30. T Stutzle M Dorigo 1999
31. Gambardella LM, Tailard ED, Dorigo M (1997) Ant colonies for the quadratic assignment problem. Technical Report IDSIA-4-97, IDSIA, Lugano, Switzerland
32. T Stutzle H Hoos 2000 MAX-MIN ant system Future Gener Comput Syst 16 8 889 914 doi:10.1016/S0167-739X(00)00043-1 (Pubitemid 30869499)
33. Maniezzo V (1998) Exact and approximate nondeterministic tree-search procedure for the quadratic assignment problem. Technical Report CSR 98-1, C.L. in Scienze dell'Informazione, Universita' di Bolonga, Sede di Cesena, Italy
34. Taillard ED, Gambardella L (1997) Adaptive memories for the quadratic assignment problem. Technical Report 87-97, IDSIA, Lugano, Switzerland
35. Garey MR, Jhonson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
36. S Sahni T Gonzalez 1976 P-complete approximation problem J Assoc Comput Mach 23 3 555 565
37. ED Taillard 1995 Comparison of iterative searches for the quadratic assignment problem Location Sci 3 87 105 doi:10.1016/0966-8349(95)00008-6
38. M Solimanpur P Vrat R Shankar 2004 Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing Eur J Oper Res 157 592 606 doi:10.1016/S0377-2217(03)00248-0
39. EG Talbi O Roux C Fonlupt D Robillard 2001 Parallel ant colonies for the quadratic assignment problem Future Gener Comput Syst 17 441 449 doi:10.1016/S0167-739X(99)00124-7 (Pubitemid 32092215)