A parallel multiple reference point approach for multi-objective optimization

DOI10.1016/J.EJOR.2009.12.027zbMath1188.90237OpenAlexW2016102515MaRDI QIDQ976459

José Rui Figueira, El-Ghazali Talbi, Andrzej P. Wierzbicki, Arnaud Liefooghe

Publication date: 11 June 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.12.027

zbMATH Keywords

parallel computingmultiple objective programmingevolutionary computationsbi-objective flow-shop schedulingmultiple reference point approach

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10)

Related Items (13)

Distributed localized bi-objective search ⋮ Trade-off balancing in scheduling for flow shop production and perioperative processes ⋮ A multi-objective approach with soft constraints for water supply and wastewater coverage improvements ⋮ Design of a heuristic algorithm for the generalized multi-objective set covering problem ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ A reference point-based evolutionary algorithm for approximating regions of interest in multiobjective problems ⋮ Non-contour efficient fronts for identifying most preferred portfolios in sustainability investing ⋮ Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling ⋮ Metaheuristics for multiobjective optimisation. Cooperative approaches, uncertainty handling and application in logistics ⋮ Objective space partitioning using conflict information for solving many-objective problems ⋮ A preference-based evolutionary algorithm for multiobjective optimization: the weighting achievement scalarizing function genetic algorithm ⋮ A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem ⋮ An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems

Uses Software

• ParadisEO-MOEO
• PISA
• ParaDisEO
• MOEA/D

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evolutionary multi-criterion optimization. 4th international conference, EMO 2007, Matsushima, Japan, March 5--8, 2007. Proceedings
• g-dominance: Reference point based dominance for multiobjective metaheuristics
• Minimizing total tardiness in permutation flowshops
• Multiple and bicriteria scheduling: A literature survey
• Nonlinear multiobjective optimization
• Benchmarks for basic scheduling problems
• Multicriteria scheduling problems: a survey
• Optimal two- and three-stage production schedules with setup times included
• A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• A classification of the weighting schemes in reference point procedures for multiobjective programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Artificial Evolution

This page was built for publication: A parallel multiple reference point approach for multi-objective optimization