Identifying preferred solutions in multiobjective combinatorial optimization problems

Abstract

We develop an evolutionary algorithm for multiobjective combinatorial optimization problems. The algorithmaims at converging the preferred solutions of a decision-maker. We test the performance of the algorithm on themultiobjective knapsack and multiobjective spanning tree problems. We generate the true nondominated solutions usingan exact algorithm and compare the results with those of the evolutionary algorithm. We observe that the evolutionaryalgorithm works well in approximating the solutions in the preferred regions.