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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) S. 289 - 293
Hauptverfasser:	Lei Song, Rong-Qiang Zeng, Yang Wang, Ming-Sheng Shang
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.08.2016
Schlagworte:	Approximation algorithms hypervolume contribution local search multi-objective optimization Pareto optimization path relinking Quadratic programming Search problems Sociology unconstrained binary quadratic programming problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!