Optimization of the quadratic assignment problem using an ant colony algorithm
type: Item
instance of: scholarly article
title: Optimization of the quadratic assignment problem using an ant colony algorithm
zbMATH Open document ID: 1105.65329
author: Nihan çetin Demirel
author: M. Duran Toksarı
published in: Applied Mathematics and Computation
publication date: 2007-02-13T00:00:00Z
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 5125234
zbMATH Keywords: ant colony optimization
zbMATH Keywords: simulated annealing
zbMATH Keywords: metaheuristics
zbMATH Keywords: quadratic assignment problem
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: numerical examples
describes a project that uses: QAPLIB
MaRDI profile type: Publication
full work available at URL: j.amc.2006.05.073
OpenAlex ID: W2156668787
cites work: Ant colonies for the quadratic assignment problem
cites work: Q4319398
cites work: Q4495191
cites work: Assignment Problems and the Location of Economic Activities
cites work: P-Complete Approximation Problems
cites work: Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
cites work: Q4934634
cites work: Q5289008
cites work: Convergence of an annealing algorithm
cites work: The Reactive Tabu Search
cites work: Q4321554
cites work: An improved annealing scheme for the QAP
cites work: QAPLIB-A quadratic assignment problem library
cites work: The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies
DOI: 10.1016/J.AMC.2006.05.073
description: scientific article; zbMATH DE number 5125234