This paper presents a hypervolume-based multi-objective path relinking algorithm for approximating the Pareto optimal set of multi-objective combinatorial optimization problems. We focus on integrating path relinking techniques within a multi-objective local search as an initialization function. Then, we carry out a range of experiments on bi-objective flow shop problem and bi-objective quadratic assignment problem. Experimental results and a statistical comparison are reported in the paper. In comparison with the other algorithms, one version of our proposed algorithm is very competitive. Some directions for future research are highlighted. © 2013 Springer-Verlag.
CITATION STYLE
Zeng, R. Q., Basseur, M., & Hao, J. K. (2013). Hypervolume-based multi-objective path relinking algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7811 LNCS, pp. 185–199). https://doi.org/10.1007/978-3-642-37140-0_17
Mendeley helps you to discover research relevant for your work.