A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming - Archive ouverte HAL Access content directly
Journal Articles Applied Soft Computing Year : 2014

A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming

Abstract

The conventional Unconstrained Binary Quadratic Programming (UBQP) problem is known to be a unified modeling and solution framework for many combinatorial optimization problems. This paper extends the single-objective UBQP to the multiobjective case (mUBQP) where multiple objectives are to be optimized simultaneously. which combines an elitist evolutionary multiobjective optimization algorithm and a state-of-the-art single-objective tabu search procedure by using an achievement scalarizing function. Finally, we define a formal model to generate mUBQP instances and validate the performance of the proposed approach in obtaining competitive results on large-size mUBQP instances with two and three objectives.
Fichier principal
Vignette du fichier
hybrid-mubqp-r2.pdf (1.86 Mo) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00801793 , version 1 (18-03-2013)
hal-00801793 , version 2 (03-06-2013)
hal-00801793 , version 3 (15-11-2013)

Identifiers

Cite

Arnaud Liefooghe, Sébastien Verel, Jin-Kao Hao. A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming. Applied Soft Computing, 2014, 16, pp.10-19. ⟨10.1016/j.asoc.2013.11.008⟩. ⟨hal-00801793v3⟩
674 View
691 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More