Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
V. Bachelet. Métaheuristiques Parallèles Hybrides: Application au Problème D’affectation Quadratique. PhD thesis, Université des Sciences et Technologies de Lille, December 1999.
P. C. Borges and M. P. Hansen. A basis for future successes in multiobjective combinatorial optimization. Technical Report IMM-REP-1998-8, Institute of Mathematical Modelling, Technical University of Denmark, March 1998.
R. E. Burkard, S. Karisch, and F. Rendl. QAPLIB—A quadratic assignment problem library. European Journal of Operational Research, pages 115–119, 1991.
K. Deb. Multi-Objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems. Evolutionary Computation, 7(3):205–230, Fall 1999.
K. Deb, A. Pratap, and T. Meyarivan. Constrained Test Problems for Multiobjective Evolutionary Optimization. In E. Zitzler et al,. editors, First International Conference on Evolutionary Multi-Criterion Optimization, pages 284–298. Springer-Verlag. LNCS 1993, 2001.
K. Deb, L. Thiele, M. Laumanns, and E. Zitzler. Scalable Test Problems for Evolutionary Multi-Objective Optimization. Technical Report 112, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, 2001.
S. Droste, T. Jansen, K. Tinnefeld, and I. Wegener. A new framework for the valuation of algorithms for black-box optimization. In FOGA 2002, Proceedings of the Seventh Foundations of Genetic Algorithms Workshop, pages 197–214, 2002.
M. Ehrgott and X. Gandibleux. A Survey and Annotated Bibliography of Multiobjective Combinatorial Optimization. OR Spektrum, 22:425–460, 2000.
C. Fleurent and J.A. Ferland. Genetic hybrids for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16:173–188, 1994.
T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In L. J. Eshelman, editor, Proceedings of the 6th International Conference on Genetic Algorithms, pages 184–192. Morgan Kaufmann, 1995.
J. Knowles and D. Corne. Towards Landscape Analyses to Inform the Design of Hybrid Local Search for the Multiobjective Quadratic Assignment Problem. In A. Abraham et al., editors, Soft Computing Systems: Design, Management and Applications, pages 271–279, Amsterdam, 2002. IOS Press.
J. D. Knowles and D. W. Corne. A Comparison of Encodings and Algorithms for Multiobjective Minimum Spanning Tree Problems. In Proceedings of the Congress on Evolutionary Computation 2001 (CEC’ 2001), volume 1, pages 544–551, Piscataway, New Jersey, May 2001. IEEE Service Center.
M. Laumanns and J. Ocenasek. Bayesian Optimization Algorithms for Multiobjective Optimization. In J. J. Merelo Guervós et al., editors, Parallel Problem Solving from Nature—PPSN VII, pages 298–307, 2002. Springer-Verlag. LNCS 2439.
P. Merz and B. Freisleben. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation, 4(4):337–352, 2000.
B. Naudts and L. Kallel. A comparison of predictive measures of problem difficulty in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 4(1):1–15, April 2000.
W. Press, S. Teukolsky, W. Vetterling, and B. Flannery. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, 1992.
S. Sahni and T. Gonzalez. P-complete approximation problems. Journal of the ACM, 23:555–565, 1976.
T. Stützle and M. Dorigo. Available ACO algorithms for the QAP. In D. Corne et al., editors, New Ideas in Optimization, chapter 3, pages 33–50. McGraw Hill, 2000.
E. D. Taillard. A comparison of iterative searches for the quadratic assignment problem. Location Science, 3:87–105, 1995.
T. E. Vollmann and E. S. Buffa. The facilities layout problem in perspactive. Management Science, 12(10):450–468, 1966.
E. Zitzler, K. Deb, and L. Thiele. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation, 8(2):173–195, Summer 2000.
E. Zitzler and L. Thiele. Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation, 3(4):257–271, November 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knowles, J., Corne, D. (2003). Instance Generators and Test Suites for the Multiobjective Quadratic Assignment Problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds) Evolutionary Multi-Criterion Optimization. EMO 2003. Lecture Notes in Computer Science, vol 2632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_21
Download citation
DOI: https://doi.org/10.1007/3-540-36970-8_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-01869-8
Online ISBN: 978-3-540-36970-7
eBook Packages: Springer Book Archive