Finding a cluster of points and the grey pattern quadratic assignment problem

OR Spectrum

Volumn 28, Issue 3, 2006, Pages 417-436

  Drezner, Zvi ^a  

^a CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Cluster; Grey pattern; Metaheuristics; Quadratic assignment problem

Indexed keywords

EID: 33748291532     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-005-0010-7     Document Type: Article

References (21)

1. Beasley JE (1990) OR-library - distributing test problems by electronic mail. J Oper Res Soc 41:1069-1072. Also available at http://mscmga.ms.ic.ac.uk/ jeb/orlib/pmedinfo.html
2. Berman O, Drezner Z (2005) The multiple server location problem, J Oper Res Soc (in press)
3. Current J, Daskin M, Schilling D (2002) Discrete network location models, Ch. 3 In: Drezner Z, Hamacher HW (eds) Location analysis: applications and theory, pp 81-118
4. Daskin M (1995) Network and discrete location: models, algorithms and applications. Wiley, New York
5. Drezner Z (1981) On a modified one-center model. Manage Sci 27:848-851
6. Drezner Z, Hahn PM, Taillard ED (2005) Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann Oper Res 139:65-94
7. Drezner Z, Marcoulides GA (2005) On the range of tabu tenure in solving quadratic assignment problems, Under review
8. Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13:533-549
9. Glover F, Laguna M (1997) Tabu search. Kluwer, Boston
10. Kirkpatrick S, Gelat CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671-680
11. Koopmans TC, Beckmann MJ (1957) Assignment problems and the location of economics activities. Econometrica 25:53-76
12. Misevicius A (2003a) Ruin and recreate principle based approach for the quadratic assignment problem. Lecture notes in computer science, vol 2723. In: Cant-Paz E, Foster JA, Deb K, et al (eds) Genetic and evolutionary computation - GECCO 2003 (Chicago, USA), Proceedings, Parti, pp 598-609, Springer, Berlin Heidelberg New York
13. Misevicius A (2003b) Genetic algorithm hybridized with ruin and recreate procedure: application to the quadratic assignment problem. Knowl Based Syst 16:261-268
14. Misevicius A (2004) An improved hybrid genetic algorithm: new results for the quadratic assignment problem, Knowl Based Syst 17:65-73
15. Misevicius A (2005) A tabu search algorithm for the quadratic assignment problem. Working paper, Kaunas University of Technology, Kaunas, Lithuania Comput Optim Appl 30:95-111
16. Rendl F (2002) The quadratic assignment problem, In: Drezner Z, Hamacher H (eds) Facility location: applications and theory, Springer, Berlin Heidelberg New York
17. Salhi S (1998) Heuristic search methods. In: Marcoulides G (ed) Modern methods for business research. Lawrence Erlbaum Associates, Mahwah, NJ
18. Taillard ED (1995) Comparison of iterative searches for the quadratic assignment problem. Location Science 3:87-105
19. Taillard ED, Gambardella LM (1997) Adaptive memories for the quadratic assignment problem. Tech. report IDSIA-8797. Lugano, Switzerland
20. Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper Res 16:955-961
21. Watson-Gandy CDT (1982) Heuristic procedures for the M-partial cover problem on a plane. Eur J Oper Res 11:149-157