A Level Set Method for Multiobjective Combinatorial Optimization: Application to the Quadratic Assignment Problem

  • Multiobjective combinatorial optimization problems have received increasing attention in recent years. Nevertheless, many algorithms are still restricted to the bicriteria case. In this paper we propose a new algorithm for computing all Pareto optimal solutions. Our algorithm is based on the notion of level sets and level curves and contains as a subproblem the determination of K best solutions for a single objective combinatorial optimization problem. We apply the method to the Multiobjective Quadratic Assignment Problem (MOQAP). We present two algorithms for ranking QAP solutions and nally give computational results comparing the methods.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Author:Matthias Ehrgott, Thomas Stephan, Dagmar Tenfelde-Podehl
URN (permanent link):urn:nbn:de:hbz:386-kluedo-12366
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (84)
Document Type:Preprint
Language of publication:English
Year of Completion:2002
Year of Publication:2002
Publishing Institute:Technische Universität Kaiserslautern
Tag:Combinatorial optimization ; K-best solution; Level sets ; Multiobjective programming
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik
MSC-Classification (mathematics):90C27 Combinatorial optimization
90C29 Multi-objective and goal programming

$Rev: 12793 $