Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects - Université de Lorraine Access content directly
Journal Articles 4OR: A Quarterly Journal of Operations Research Year : 2021

Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects

Abstract

The search region in multiobjective optimization problems is a part of the objective space where nondominated points could lie. It plays an important role in the generation of the nondominated set of multiobjective combinatorial optimization (MOCO) problems. In this paper, we establish the representation of the search region by half-open polyblocks (a variant concept of “polyblock” in monotonic optimization) and propose a new procedure for updating the search region. We also study the impact of stack policies to the new procedure and the existing methods that update the search region. Stack policies are then analyzed, pointing out their performance effectiveness by means of the results of rich computational experiments on finding the whole set of nondominated points of MOCO problems.
No file

Dates and versions

hal-03063809 , version 1 (14-12-2020)

Identifiers

Cite

Thi Hoai Pham, Hoai An Le Thi, Canh Nam Nguyen. Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects. 4OR: A Quarterly Journal of Operations Research, 2021, 19 (1), pp.41-70. ⟨10.1007/s10288-020-00430-5⟩. ⟨hal-03063809⟩
45 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More