 |
||||||||
| Volume 2, Number 3, September 2006, pp.521-544 | ||||||||
| Matthias Ehrgott, Dagmar Tenfelde-Podehl and Thomas Stephan | ||||||||
| Key words: | ||||||||
| multiobjective programming, combinatorial optimization, level sets, K-best solution, quadratic assignment problem. | ||||||||
| Mathematices Subject Classification: 90C29, 90C27 | ||||||||
|
||||||||||||||||||||||||||||||||||||||||
| Abstract: | |||
| 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 finally give computational results comparing the methods. | |||
| A level set method for multiobjective combinatorial optimization: application to the quadratic assignment problem | ||