On the landscape ruggedness of the quadratic assignment problem

DOI10.1016/S0304-3975(00)00239-5zbMath0973.68085MaRDI QIDQ5941510

Eric Angel, Vassilios Zissimopoulos

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

local search; quadratic assignment problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

90C27: Combinatorial optimization

Related Items

Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time, Autocorrelation measures for the quadratic assignment problem, Elementary landscape decomposition of the frequency assignment problem, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods, A survey for the quadratic assignment problem, On the number of local minima for the multidimensional assignment problem, Random assignment problems, On the classification of NP-complete problems in terms of their correlation coefficient, A hybrid metaheuristic for the quadratic assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved annealing scheme for the QAP
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Autocorrelation coefficient for the graph bipartitioning problem
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• Generating quadratic assignment test problems with known optimal permutations
• On the quality of local search for the quadratic assignment problem
• Assignment Problems and the Location of Economic Activities
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• P-Complete Approximation Problems
• Comparison of iterative searches for the quadratic assignment problem