Ant colonies for the quadratic assignment problem

Journal of the Operational Research Society

Volumn 50, Issue 2, 1999, Pages 167-176

  Gambardella, L M ^a   Taillard, E D ^a   Dorigo, M ^b  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Ant colony optimisation; Ant systems; Meta heuristics; Quadratic assignment problem

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION;

QUADRATIC ASSIGNMENT PROBLEM;

COMBINATORIAL MATHEMATICS;

EID: 0033076868     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600676     Document Type: Article

References (22)

1. Koopmans TC and Beckmann MJ (1957). Assignment problems and the location of economics activities. Econometrica 25: 53-76.
2. Shani S and Gonzalez T (1976). P-complete approximation problems. J of the ACM 23: 555-565.
3. Taillard ED (1995). Comparison of iterative searches for the quadratic assignment problem. Location Sci 3: 87-105.
4. Connolly DT (1990). An improved annealing scheme for the QAP. Eur J Op Res 46: 93-100.
5. Taillard ED (1991). Robust taboo search for the quadratic assignment problem. Parallel Computing 17: 443-455.
6. Battiti R and Tecchiolli G (1994). The reactive tabu search. ORSA J on Computing 6: 126-140.
7. Sondergeld L and VoB S (1996). A star-shaped diversification approach in tabu search. In: Osman IH and Kelly JP (eds.). Meta-Heuristics: Theory and Applications. Kluwer Academic Publishers: Boston/London/Dordnecht, pp 489-502.
8. Fleurent C and Ferland J (1994). Genetic hybrids for the quadratic assignment problems. DIMACS Series in Mathematics and Theoretical Computer Science 16: 190-206.
9. Cung V-D, Mautor T, Michelon P and Tavares A (1997). A scatter search based approach for the quadratic assignment problem. Proceedings of the IEEE International Conference on Evolutionary Computation and Evolutionary Programming. (ICEC’ 97), Indianapolis, USA, pp 165-170.
10. Dorigo M, Maniezzo Vand Colorni A (1991). Positive feedback as a search strategy. Technical Report 91-016, Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy.
11. Dorigo M, Maniezzo V and Colorni A (1996). The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics—Part B 26: 29-41.
12. Dorigo M (1992). Ottimizzazione, apprendimento automatico, ed algoritmi basati su metafora naturale (Optimisation, learning and natural algorithms). Doctoral dissertation, Dipartimento di Elettronica e Informazione, Policecnico di Milano, Italy.
13. Goss S, Aron, Deneubourg JL and Pasteels JM (1989). Selforganized shortcuts in the Argentine ant. Naturwissenschaften 76: 579-581.
14. Dorigo M and Gambardella LM (1997). Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1: 53-66.
15. Lin S and Kernighan BW (1973). An effective heuristic algorithm for the travelling salesman problem. Operations Research 21: 498-516.
16. Gambardella LM and Dorigo M (1997). HAS-SOP: Ant colony optimization for sequential ordering problems. Tech. Rep. IDSIA-11-97, IDSIA, Lugano, Switzerland.
17. Burkard RE and Rendl F (1983). A thermodynamically motivated simulation procedure for combinatorial optimization problems. Eur J Op Res 17: 169-174.
18. Burkard RE, Karisch S and Rendl F (1991). QAPLIB—A quadratic assignment problem library. Eur J Op Res 55: 115-119.
19. Liggett RS (1981). The quadratic assignment problem: An experimental evaluation of solution strategies. Mgmt Sei 27: 442-458.
20. Scriabin M and Vergin RC (1975). Comparison of computer algorithms and visual based methods for plant layout. Mgmt Sei 22: 172-181.
21. Burkard RE and Cela E (1996). Quadratic and three-dimensional assignments: An annotated bibliography. Technical report 63, Discrete Optimisation Group, Technische Universität Graz, Austria.
22. Siegel S and Castellan NJ (1956). Nonparametric Statistics for the Behavioral Sciences. McGraw-Hill, New York.