Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 200, Issue 1, Pages 45-53Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2008.12.034
Keywords
Exact method; Multi-objective problem; Combinatorial optimization; Flow-shop problem
Ask authors/readers for more resources
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. (C) 2009 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available