Refine
Year of publication
- 2002 (2) (remove)
Language
- English (2) (remove)
Has Fulltext
- yes (2)
Keywords
- Combinatorial optimization (1)
- Education (1)
- K-best solution (1)
- Level sets (1)
- Locational Planning (1)
- Mathematikunterricht (1)
- Modellierung (1)
- Multiobjective programming (1)
- Standortplanung (1)
- modelling (1)
Faculty / Organisational entity
Dealing with problems from locational planning in schools can enrich the mathematical education. In this report we describe planar locational problems which can be used in mathematical lessons. The problems production of a semiconductor plate, design of a fire brigade building and the warehouse problem are from real-world. The problems are worked out detailed so that the usage for school lessons is possible.
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.