Multi-start and path relinking methods to deal with multiobjective knapsack problems |
| |
Authors: | Ricardo P Beausoleil Gulnara Baldoquin Rodolfo A Montejo |
| |
Institution: | (1) Departmento de Matemática Interdisciplinaria, Instituto de Cibernética Matemática y Física, Ciudad Habana, Cuba;(2) Fac. Ing. Industrial, Instituto Superior Politécnico José Antonio Echeverría, Ciudad Habana, Cuba |
| |
Abstract: | This paper deals with a multiobjective combinatorial optimization problem called Extended Knapsack Problem. By applying multi-start
search and path relinking we rapidly guide the search toward the most balanced zone of the Pareto-optimal front. The Pareto
relation is applied in order to designate a subset of the best generated solutions to be the current efficient set of solutions.
The max-min criterion with the Hamming distance is used as a measure of dissimilarity in order to find diverse solutions to
be combined. The performance of our approach is compared with several state-of-the-art MOEAs for a suite test problems taken
from the literature. |
| |
Keywords: | Multiple objective metaheuristics Multi-start methods Path relinking Knapsack problems |
本文献已被 SpringerLink 等数据库收录! |