Path relinking algorithms have proved their efficiency in single objective optimization. Here we propose to adapt this concept to Pareto optimization. We combine this original approach to a genetic algorithm. By applying this hybrid approach to a bi-objective permutation flow-shop problem, we show the interest of this approach. In this paper, we present first an Adaptive Genetic Algorithm dedicated to obtain a first well diversified approximation of the Pareto set. Then, we present an original hybridization with Path Relinking algorithm, in order to intensify the search between solutions obtained by the first approach. Results obtained are promising and show that cooperation between these optimization methods could be efficient for Pareto optimization. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Basseur, M., Seynhaeve, F., & Talbi, E. G. (2005). Path relinking in Pareto multi-objective genetic algorithms. In Lecture Notes in Computer Science (Vol. 3410, pp. 120–134). Springer Verlag. https://doi.org/10.1007/978-3-540-31880-4_9
Mendeley helps you to discover research relevant for your work.