Iterated fast local search algorithm for solving quadratic assignment problems

Robotics and Computer-Integrated Manufacturing

Volumn 24, Issue 3, 2008, Pages 392-401

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

^a AMRITA SCHOOL OF ENGINEERING   (India)

^b MONASH UNIVERSITY MALAYSIA   (Malaysia)

^c THIAGARAJAR COLLEGE OF ENGINEERING   (India)

Author keywords

Evolutionary algorithm; Facility layout; Optimization; QAP

Indexed keywords

GENETIC ALGORITHMS; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING;

LOCAL SEARCH ALGORITHM; QUADRATIC ASSIGNMENT PROBLEMS (QAP);

SEARCH ENGINES;

EID: 39749174457     PISSN: 07365845     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.rcim.2007.01.004     Document Type: Article

References (37)

1. Koopmans T.C., and Beckman M. Assignment problems and the location of economic activities. Econometric 25 (1957) 53-76
2. Anstreicher K.M. Recent advances in the solution of quadratic assignment problems. Math Prog Ser B 97 (2003) 27-42
3. Burkard R.E., and Rendl F. Thermodynamically motivated simulation procedure for combinatorial optimization problems. Eur J Oper Res 17 (1984) 169-174
4. Malucelli F. Quadratic assignment problems: solution methods and applications. Unpublished doctoral dissertation, Italy: Departmento Informatica, Universita Di Pisa; 1993.
5. Pardalos P.M., Rendl F., and Wolkowicz H. The quadratic assignment problem: a survey and recent developments, in quadratic assignment and related problems. DIMACS Ser Discrete Math Theor Comput Sci 16 (1994) 1-42
6. Sahni S., and Gonzalez T. P-complete approximation problems. J ACM 23 (1976) 555-565
7. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), WH Freeman Company
8. Gilmore P.C. Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J Appl Math 10 (1962) 305-313
9. Lawler E.L. The quadratic assignment problem. Manage Sci 9 (1963) 586-599
10. Pardalos P.M., and Crouse J. A parallel algorithm for the quadratic assignment problem. Proceedings of the supercomputing conference (1989), ACM Press 351-360
11. Carraresi P., and Malucelli F. A new lower bound for the quadratic assignment problem. Oper Res 40 1 (1992) 22-27
12. Bazaraa M.S., and Sherali M.D. Bender's partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Res Logistics Q 27 (1980) 29-41
13. Christofides N., and Benavent E. An exact algorithm for the quadratic assignment problem. Oper Res 37 (1989) 760-768
14. Buffa E.S., Armour G.C., and Vollmann T.E. Allocating facilities with CRAFT. Harvard Bus Rev 42 (1964) 136-158
15. Muller-Merbach H. Optimale reihenfolgen (1970), Springer p. 158-79
16. Pitsoulis L. A sparse GRASP for solving the quadratic assignment problem. Master's Thesis, The University of Florida, 1994.
17. Li Y., Pardalos P.M., and Resende M. A greedy randomized adaptive search procedure for the quadratic assignment problem. DIMACS Ser Discrete Math Theor Comput Sci 16 (1994) 237-261
18. Wilhelm M.R., and Ward T.L. Solving quadratic assignment problems by simulated annealing. IIE Trans 19 (1987) 107-119
19. Connolly D.T. An improved annealing scheme for the QAP. Eur J Oper Res 46 (1990) 93-100
20. Skorin-Kapov J. Tabu search applied to the quadratic assignment problem. ORSA J Comput 2 (1990) 33-45
21. Taillard E.D. Robust taboo search for the quadratic assignment problem. Parallel Comput 17 (1991) 443-455
22. Ahuja K.R., Orlin J.B., and Tiwari A. A greedy algorithm for the quadratic assignment problem. Comput Oper Res 27 (2000) 917-934
23. Fleurent C., and Ferland J. Genetic hybrids for the quadratic assignment problem. DIMACS Ser Math Theor Comput Sci 16 (1994) 190-206
24. Tate D.M., and Smith A.E. A genetic approach to the quadratic assignment problem. Comput Oper Res 22 1 (1995) 78-83
25. Merz P, Freisleben B. A genetic local search approach to the quadratic assignment problem. In: Proceedings of the seventh international conference on genetic algorithms. 1997. East Lansing, USA.
26. Maniezzo V, Dorigo M, Colorini A. The ant system applied to the quadratic assignment problem. Technical Report IRIDIA/94-28. Belgium: Universite Libre de Bruxelles; 1994.
27. Stützle T., and Dorigo M. ACO algorithms for the quadratic assignment problem. New Ideas in optimization (1999), Mcgraw-Hill, London
28. Dorigo M., Maniezzo V., and Colorni A. The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B 26 (1996) 29-41
29. Gambardella LM, Dorigo M. HAS-SOP: Ant colony optimization for sequential ordering problems. Technical report, IDSIA, Lugano, Switzerland: 1997. p. 11-97.
30. Thomas Baeck F. Hoffmeister, Schwefel HP. A survey of evolution strategies. In: Proceedings of the fourth international conference on genetic algorithms. San Mateo, CA: Morgan Kaufmann; 1991.
31. Radcliffe NJ, Surry PD. Formal memetic algorithm, evolutionary computing. In: Selected papers from AISB workshop. Lecture Notes in Computer Science. Berlin: Springer; 1994. p. 1-16.
32. Davis L. Applying adaptive algorithms to epistatic domains. In: Proceedings of the international joint conference on artificial intelligence. 1985. p. 162-64.
33. Starweather T, McDaniel S, Whitley C, Mathias K, Whitley D. A comparison of genetic sequencing operators. In: Proceedings of the fourth international conference on genetic algorithms. San Mateo, CA: Morgan Kaufmann; 1991. p. 69-76.
34. Mattfeld D.C. Evolutionary search and the job shop: investigations on genetic algorithms for production scheduling (1996), Physica-Verlag Heidelberg, Germany
35. Parthasarathy S., and Rajendran C. An experimental evaluation of heuristics for scheduling in a real life flow shop with sequence-department set up time (sec) of jobs. Int J Prod Econ 49 (1997) 255-263
36. Nugent C.E., Vollmann T.E., and Ruml J. An experimental comparison of techniques for the assignment of facilities to locations. Oper Res 16 (1968) 150-173
37. Burkard R.E., Karisch S.E., and Rendl F. QAPLIB-a quadratic assignment problem library. J Global Optim 10 (1997) 391-403