We propose an evolutionary metaheuristic for approximating the preference-nondominated solutions of a decision maker in multiobjective combinatorial problems. The method starts out with some partial preference information provided by the decision maker, and utilizes an individualized fitness function to converge towards a representative set of solutions favored by the information at hand. The breadth of the set depends on the precision of the partial information available on the decision maker’s preferences. The algorithm simultaneously evolves the population of solutions out towards the efficient frontier, focuses the population on those segments of the efficient frontier that will appeal to the decision maker, and disperses it over these segments to have an adequate representation. Simulation runs carried out on randomly generated instances of the Multiobjective Knapsack Problem and the Multiobjective Spanning Tree Problem have found the algorithm to yield highly satisfactory results.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.