[Zurück]

J. Kubalik, R. Mordinyi, S. Biffl:
"Multiobjective Prototype Optimization with Evolved Improvement Steps";
Vortrag: 8th European Conference, EvoCOP 2008, Naples, Italy; 26.03.2008 - 28.03.2008; in: "Evolutionary Computation in Combinatorial Optimization", LNCS/Springer Berlin, 4972/2008/ Heidelberg (2008), ISSN: 0302-9743; S. 218 - 229.

Recently, a new iterative optimization framework utilizing an evolutionary algorithm called "Prototype Optimization with Evolved iMprovement Steps" (POEMS) was introduced, which showed good performance on hard optimization problems - large instances of TSP and real-valued optimization problems. Especially, on discrete optimization problems such as the TSP the algorithm exhibited much better search capabilities than the standard evolutionary approaches. In many real-world optimization problems a solution is sought for multiple (conflicting) optimization criteria. This paper proposes a multiobjective version of the POEMS algorithm (mPOEMS), which was experimentally evaluated on the multiobjective 0/1 knapsack problem with alternative multiobjective evolutionary algorithms. Major result of the experiments was that the proposed algorithm performed comparable to or better than the alternative algorithms.

multiobjective optimization - evolutionary algorithms - multiobjective 0/1 knapsack problem

http://publik.tuwien.ac.at/files/PubDat_165735.pdf