• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Efficient computation of the search region in multi-objective optimization

Dächert, Kerstin; Klamroth, Kathrin; Lacour, Renaud; Vanderpooten, Daniel (2017), Efficient computation of the search region in multi-objective optimization, European Journal of Operational Research, 260, 3, p. 841-855. 10.1016/j.ejor.2016.05.029

Type
Article accepté pour publication ou publié
Date
2017
Journal name
European Journal of Operational Research
Volume
260
Number
3
Pages
841-855
Publication identifier
10.1016/j.ejor.2016.05.029
Metadata
Show full item record
Author(s)
Dächert, Kerstin
autre
Klamroth, Kathrin
autre
Lacour, Renaud
autre
Vanderpooten, Daniel
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
Multi-objective optimization procedures usually proceed by iteratively producing new solutions. For this purpose, a key issue is to determine and efficiently update the search region, which corresponds to the part of the objective space where new nondominated points could lie. In this paper we elaborate a specific neighborhood structure among local upper bounds. Thanks to this structure, the update of the search region with respect to a new point can be performed more efficiently compared to existing approaches. Moreover, the neighborhood structure provides new insight into the search region and the location of nondominated points.
Subjects / Keywords
Multi-objective optimization; Nondominated set; Search region; Local upper bounds; Scalarization

Related items

Showing items related by title and author.

  • Thumbnail
    On the representation of the search region in multi-objective optimization 
    Klamroth, Kathrin; Lacour, Renaud; Vanderpooten, Daniel (2015) Article accepté pour publication ou publié
  • Thumbnail
    Approches de résolution exacte et approchée en optimisation combinatoire multi-objectif, application au problème de l'arbre couvrant de poids minimal 
    Lacour, Renaud (2014-07) Thèse
  • Thumbnail
    Approches efficaces avec garantie a priori pour le problème de l’arbre couvrant multi-objectif 
    Lacour, Renaud; Vanderpooten, Daniel (2012) Communication / Conférence
  • Thumbnail
    Discrete representation of the non-dominated set for multi-objective optimization problems using kernels 
    Bazgan, Cristina; Jamain, Florian; Vanderpooten, Daniel (2017) Article accepté pour publication ou publié
  • Thumbnail
    On the computation of all supported efficient solutions in multi-objective integer network flow problems 
    Eusebio, Augusto; Figueira, José (2009) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo