P-Complete Approximation Problems
Journal of the ACM (JACM)
ACO algorithms for the quadratic assignment problem
New ideas in optimization
Numerical Recipes in C: The Art of Scientific Computing
Numerical Recipes in C: The Art of Scientific Computing
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Bayesian Optimization Algorithms for Multi-objective Optimization
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Evolutionary Computation
Multi-objective genetic algorithms: Problem difficulties and construction of test problems
Evolutionary Computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A comparison of predictive measures of problem difficulty inevolutionary algorithms
IEEE Transactions on Evolutionary Computation
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
IEEE Transactions on Evolutionary Computation
Rotated test problems for assessing the performance of multi-objective optimization algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Multiobjective Landscape Analysis and the Generalized Assignment Problem
Learning and Intelligent Optimization
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
Plateau connection structure and multiobjective metaheuristic performance
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Path-guided mutation for stochastic pareto local search algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Generalized adaptive pursuit algorithm for genetic pareto local search algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Multiobjective memetic algorithms for time and space assembly line balancing
Engineering Applications of Artificial Intelligence
Analyzing the effect of objective correlation on the efficient set of MNK-Landscapes
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Clustering of local optima in combinatorial fitness landscapes
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Local optima networks, landscape autocorrelation and heuristic search performance
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Proceedings of the 15th annual conference on Genetic and evolutionary computation
A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming
Applied Soft Computing
| Hi-index | 0.00 |
We describe, and make publicly available, two problem instance generators for a multiobjective version of the well-known quadratic assignment problem (QAP). The generators allow a number of instance parameters to be set, including those controlling epistasis and inter-objective correlations. Based on these generators, several initial test suites are provided and described. For each test instance we measure some global properties and, for the smallest ones, make some initial observations of the Pareto optimal sets/fronts. Our purpose in providing these tools is to facilitate the ongoing study of problem structure in multiobjective (combinatorial) optimization, and its effects on search landscape and algorithm performance.