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.

Download full text files

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author:Matthias Ehrgott, Thomas Stephan, Dagmar Tenfelde-Podehl
URN:urn:nbn:de:hbz:386-kluedo-12366
Series (Serial Number):Report in Wirtschaftsmathematik (WIMA Report) (84)
Document Type:Preprint
Language of publication:English
Year of Completion:2002
Year of first Publication:2002
Publishing Institution:Technische Universität Kaiserslautern
Date of the Publication (Server):2002/10/15
Tag:Combinatorial optimization; K-best solution; Level sets; Multiobjective programming
Faculties / Organisational entities:Kaiserslautern - Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
MSC-Classification (mathematics):90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C29 Multi-objective and goal programming
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011