Solving bi-objective unconstrained binary quadratic programming problem with multi-objective path relinking algorithm

This paper investigates a multi-objective path relinking algorithm in order to optimize a bi-objective unconstrained binary quadratic programming problem. In this algorithm, we integrate the path relinking techniques into hypervolume-based multi-objective optimization, where we propose a method to g...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) s. 289 - 293
Hlavní autori: Lei Song, Rong-Qiang Zeng, Yang Wang, Ming-Sheng Shang
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.08.2016
Predmet:
Approximation algorithms
hypervolume contribution
local search
multi-objective optimization
Pareto optimization
path relinking
Quadratic programming
Search problems
Sociology
unconstrained binary quadratic programming problem
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper investigates a multi-objective path relinking algorithm in order to optimize a bi-objective unconstrained binary quadratic programming problem. In this algorithm, we integrate the path relinking techniques into hypervolume-based multi-objective optimization, where we propose a method to generate a path and select a set of non-dominated solutions from the generated path for further improvements. Experimental results show that the proposed algorithm is very effective compared with the original multi-objective optimization algorithms.
DOI:10.1109/FSKD.2016.7603188