Fitness landscape analysis and memetic algorithms for the quadratic assignment problem

Authors:
P. Merz;B. Freisleben
Affiliations:
Dept. of Electr. Eng. & Comput. Sci., Siegen Univ., Germany;-
Venue:
IEEE Transactions on Evolutionary Computation
Year:
2000

Citing 0
Cited 66

A Memetic Algorithm Guided by Quicksort for the Error-Correcting Graph Isomorphism Problem

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Clustering Gene Expression Profiles with Memetic Algorithms

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

Journal of Heuristics
Sequential and multi-population memetic algorithms for assigning cells to switches in mobile networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Advanced fitness landscape analysis and the performance of memetic algorithms

Evolutionary Computation - Special issue on magnetic algorithms
Solving large scale combinatorial optimization using PMA-SLS

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
New topologies for genetic search space

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A hybrid search algorithm with heuristics for resource allocation problem

Information Sciences—Informatics and Computer Science: An International Journal
Evolving Evolutionary Algorithms Using Linear Genetic Programming

Evolutionary Computation
A Hybrid Metaheuristic for the Quadratic Assignment Problem

Computational Optimization and Applications
Adaptation for parallel memetic algorithm based on population entropy

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Properties of symmetric fitness functions

Proceedings of the 8th annual conference on Genetic and evolutionary computation
A fast hybrid genetic algorithm for the quadratic assignment problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Extraction of landscape information based on a quality control approach and its applications to mutation in GAExtraction of landscape information based on a quality control approach and its applications to mutation in GA

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Simulated annealing applied to test generation: landscape characterization and stopping criteria

Empirical Software Engineering
A review of metrics on permutations for search landscape analysis

Computers and Operations Research
Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment

Applied Soft Computing
Energy-aware topology control for wireless sensor networks using memetic algorithms

Computer Communications
Immunity based genetic algorithm for solving quadratic assignment problem (QAP)

ICECS'03 Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing
A novel hybrid learning algorithm for parametric fuzzy CMAC networks and its classification applications

Expert Systems with Applications: An International Journal
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem

Informatica
A memetic algorithm for the flexible flow line scheduling problem with processor blocking

Computers and Operations Research
A new iterated fast local search heuristic for solving QAP formulation in facility layout design

Robotics and Computer-Integrated Manufacturing
RGA-based on-line tuning of BMF fuzzy-neural networks for adaptive control of uncertain nonlinear systems

Neurocomputing
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A hybrid search algorithm with heuristics for resource allocation problem

Information Sciences: an International Journal
2010 Special Issue: Meta-learning approach to neural network optimization

Neural Networks
Instance generators and test suites for the multiobjective quadratic assignment problem

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Normalization in genetic algorithms

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Problem-independent schema synthesis for genetic algorithms

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
A memetic algorithm for binary image reconstruction

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Interaction of culture-based learning and cooperative co-evolution and its application to automatic behavior-based system design

IEEE Transactions on Evolutionary Computation
Approximate backbone based multilevel algorithm for next release problem

Proceedings of the 12th annual conference on Genetic and evolutionary computation
Solving bus terminal location problems using evolutionary algorithms

Applied Soft Computing
Efficient decision makings for dynamic weapon-target assignment by virtual permutation and tabu search heuristics

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
An efficient memetic algorithm for solving the job shop scheduling problem

Computers and Industrial Engineering
Self-organized combinatorial optimization

Expert Systems with Applications: An International Journal
The k-coloring fitness landscape

Journal of Combinatorial Optimization
Off-line and on-line tuning: a study on operator selection for a memetic algorithm applied to the QAP

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Review: Measuring instance difficulty for combinatorial optimization problems

Computers and Operations Research
A theoretical model and convergence analysis of memetic evolutionary algorithms

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Evolutionary local search for designing peer-to-peer overlay topologies based on minimum routing cost spanning trees

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Optimum design of surface acoustic wave filters based on the taguchi's quality engineering with a memetic algorithm

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Exploration and exploitation bias of crossover and path relinking for permutation problems

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Multiobjective quadratic assignment problem solved by an explicit building block search algorithm – MOMGA-IIa

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Local optima properties and iterated local search algorithm for optimum multiuser detection problem

ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Landscape properties and hybrid evolutionary algorithm for optimum multiuser detection problem

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Fitness landscape analysis for the no-wait flow-shop scheduling problem

Journal of Heuristics
Fitness distance correlation and search space analysis for permutation based problems

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Instance-Based parameter tuning via search trajectory similarity clustering

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
A memetic algorithm for the biobjective minimum spanning tree problem

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Evolutionary approach to optimize the assignment of cells to switches in personal communication networks

Computer Communications
Generic hardness estimation using fitness and parameter landscapes applied to robust taboo search and the quadratic assignment problem

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
An implementation of the iterated tabu search algorithm for the quadratic assignment problem

OR Spectrum
Motif difficulty (md): A predictive measure of problem difficulty for evolutionary algorithms using network motifs

Evolutionary Computation
A genetic algorithm for weapon target assignment problem

SCSC '09 Proceedings of the 2009 Summer Computer Simulation Conference
Stochastic Pareto local search: Pareto neighbourhood exploration and perturbation strategies

Journal of Heuristics
A centralised cooperative strategy for continuous optimisation: The influence of cooperation in performance and behaviour

Information Sciences: an International Journal
Enhancing the performance of hybrid genetic algorithms by differential improvement

Computers and Operations Research
GBF Trained Neuro-fuzzy Equalizer for Time Varying Channels

International Journal of Applied Evolutionary Computation
Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem

International Journal of Swarm Intelligence Research
Automatic algorithm selection for the quadratic assignment problem using fitness landscape analysis

EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Predicting genetic algorithm performance on the vehicle routing problem using information theoretic landscape measures

EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Exploration and exploitation in evolutionary algorithms: A survey

ACM Computing Surveys (CSUR)
A survey of techniques for characterising fitness landscapes and some possible ways forward

Information Sciences: an International Journal
An effective Parallel Multistart Tabu Search for Quadratic Assignment Problem on CUDA platform

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a fitness landscape analysis for several instances of the quadratic assignment problem (QAP) is performed, and the results are used to classify problem instances according to their hardness for local search heuristics and meta-heuristics based on local search. The local properties of the fitness landscape are studied by performing an autocorrelation analysis, while the global structure is investigated by employing a fitness distance correlation analysis. It is shown that epistasis, as expressed by the dominance of the flow and distance matrices of a QAP instance, the landscape ruggedness in terms of the correlation length of a landscape, and the correlation between fitness and distance of local optima in the landscape together are useful for predicting the performance of memetic algorithms-evolutionary algorithms incorporating local search (to a certain extent). Thus, based on these properties, a favorable choice of recombination and/or mutation operators can be found. Experiments comparing three different evolutionary operators for a memetic algorithm are presented.