Optimization of the quadratic assignment problem using an ant colony algorithm

DOI10.1016/j.amc.2006.05.073zbMath1105.65329OpenAlexW2156668787MaRDI QIDQ864790

Nihan çetin Demirel, M. Duran Toksarı

Publication date: 13 February 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.073

zbMATH Keywords

numerical examplescombinatorial optimizationmetaheuristicssimulated annealingquadratic assignment problemant colony optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (6)

Global optimality conditions and optimization methods for quadratic assignment problems ⋮ An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal ⋮ A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems ⋮ A new solution method of ant colony-based logistic center area layout problem ⋮ A pseudo parallel ant algorithm with an adaptive migration controller ⋮ A new solution algorithm for improving performance of ant colony optimization

Uses Software

• QAPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved annealing scheme for the QAP
• QAPLIB-A quadratic assignment problem library
• Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
• Ant colonies for the quadratic assignment problem
• Assignment Problems and the Location of Economic Activities
• Convergence of an annealing algorithm
• The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies
• P-Complete Approximation Problems
• The Reactive Tabu Search

This page was built for publication: Optimization of the quadratic assignment problem using an ant colony algorithm