Cartesian product of scalarization functions for many-objective QAP instances with correlated flow matrices

M.M. Drugan

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)
1 Downloads (Pure)

Abstract

In order to simplify optimization in many-objective search spaces, we propose the Cartesian product of scalarization functions to reduce the number of objectives of the search space. To achieve this, we design a stochastic Pareto local search algorithm and we demonstrate their use on examples of product functions. We test this algorithm on generated many-objective quadratic assignment instances with correlated flow matrices. The experimental tests show a superior performance for the local search algorithms using product functions instead of the standard scalarization functions. For instances with strong correlation between the flow matrices, product based algorithms have similar performance with the standard Pareto local search.
Original languageEnglish
Title of host publicationGECCO '13, Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, 6-10 July 2013, Amsterdam, The Netherlands
Place of PublicationNew York
PublisherAssociation for Computing Machinery, Inc
Pages527-534
ISBN (Print)978-1-4503-1963-8
DOIs
Publication statusPublished - 2013
Externally publishedYes

Keywords

  • Stochastic Pareto local search
  • Scalarization functions
  • Multi-objective quadratic assignment problems
  • Instance generator

Fingerprint

Dive into the research topics of 'Cartesian product of scalarization functions for many-objective QAP instances with correlated flow matrices'. Together they form a unique fingerprint.

Cite this