• 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 - No thumbnail

A parallel multiple reference point approach for multi-objective optimization

Wierzbicki, Andrzej P.; Talbi, El-Ghazali; Liefooghe, Arnaud; Figueira, José (2010), A parallel multiple reference point approach for multi-objective optimization, European Journal of Operational Research, 205, 2, p. 390-400. http://dx.doi.org/10.1016/j.ejor.2009.12.027

Type
Article accepté pour publication ou publié
External document link
http://hal.archives-ouvertes.fr/hal-00522619/en/
Date
2010
Journal name
European Journal of Operational Research
Volume
205
Number
2
Publisher
Elsevier
Pages
390-400
Publication identifier
http://dx.doi.org/10.1016/j.ejor.2009.12.027
Metadata
Show full item record
Author(s)
Wierzbicki, Andrzej P.
Talbi, El-Ghazali cc
Liefooghe, Arnaud
Figueira, José
Abstract (EN)
This paper presents a multiple reference point approach for multi-objective optimization problems of discrete and combinatorial nature. When approximating the Pareto Frontier, multiple reference points can be used instead of traditional techniques. These multiple reference points can easily be implemented in a parallel algorithmic framework. The reference points can be uniformly distributed within a region that covers the Pareto Frontier. An evolutionary algorithm is based on an achievement scalarizing function that does not impose any restrictions with respect to the location of the reference points in the objective space. Computational experiments are performed on a bi-objective flow-shop scheduling problem. Results, quality measures as well as a statistical analysis are reported in the paper.
Subjects / Keywords
ultiple objective programming; Parallel computing; Multiple reference point approach; Evolutionary computations; Bi-objective flow-shop scheduling

Related items

Showing items related by title and author.

  • Thumbnail
    Représentations discrètes de l'ensemble des points non dominés pour des problèmes d'optimisation multi-objectifs 
    Jamain, Florian (2014-06) Thèse
  • 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
    Local Search, data structures and Monte Carlo Search for Multi-Objective Combinatorial Optimization Problems 
    Cornu, Marek (2017-12-18) Thèse
  • 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é
  • 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é
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