K-PPM: A new exact method to solve multi-objective combinatorial optimization problems

In this paper we propose an exact method able to solve multi-objective combinatorial optimization problems. This method is an extension, for any number of objectives, of the 2-Parallel Partitioning Method (2-PPM) we previously proposed. Like 2-PPM, this method is based on splitting of the search spa...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 200; H. 1; S. 45 - 53
Hauptverfasser: Dhaenens, C., Lemesre, J., Talbi, E.G.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 2010
Elsevier
Elsevier Sequoia S.A
Schriftenreihe:European Journal of Operational Research
Schlagworte:
Applied sciences
Combinatorial optimization
Computer Science
Decision theory. Utility theory
Exact method
Exact method Multi-objective problem Combinatorial optimization Flow-shop problem
Exact sciences and technology
Flow-shop problem
Flows in networks. Combinatorial problems
Job shops
Multi-objective problem
Operational research and scientific management
Operational research. Management science
Operations Research
Optimization algorithms
Studies
Combinatorial optimization
Flow-shop problem
Multi-objective problem
Exact method
Partitioning
Multiobjective programming
Flow shop
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we propose an exact method able to solve multi-objective combinatorial optimization problems. This method is an extension, for any number of objectives, of the 2-Parallel Partitioning Method (2-PPM) we previously proposed. Like 2-PPM, this method is based on splitting of the search space into several areas, leading to elementary searches. The efficiency of the proposed method is evaluated using a multi-objective flow-shop problem.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2008.12.034