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...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2010, Vol.200 (1), p.45-53
Main Authors: Dhaenens, C., Lemesre, J., Talbi, E.G.
Format: Article
Language:English
Subjects:
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
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2008.12.034