The extended concentric tabu for the quadratic assignment problem

In this paper we propose to extend the concentric tabu search for the quadratic assignment problem to include more permissible moves. Two extensions are suggested and tested. The computational comparisons with existing hybrid genetic algorithms provide comparable solutions to the best available algo...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2005-01, Vol.160 (2), p.416-422
Main Author: Drezner, Zvi
Format: Article
Language:English
Subjects:
Algorithms
Assignment problem
Concentric tabu
Genetic algorithm
Genetic algorithms
Job shops
Operations research
Quadratic assignment
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we propose to extend the concentric tabu search for the quadratic assignment problem to include more permissible moves. Two extensions are suggested and tested. The computational comparisons with existing hybrid genetic algorithms provide comparable solutions to the best available algorithms.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(03)00438-7