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

被引：36
|
作者：
Dhaenens, C. [1 ]
Lemesre, J. [1 ]
Talbi, E. G. [1 ]
机构：
[1] LIFL, USTL, INRIA, Polytech Lille, F-59650 Villeneuve Dascq, France
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2010年 / 200卷 / 01期
关键词：
Exact method; Multi-objective problem; Combinatorial optimization; Flow-shop problem;
D O I：
10.1016/j.ejor.2008.12.034
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
收藏
页码：45 / 53
页数：9
相关论文
共 50 条
  • [1] A new optimization algorithm to solve multi-objective problems
    Sharifi, Mohammad Reza
    Akbarifard, Saeid
    Qaderi, Kourosh
    Madadi, Mohamad Reza
    SCIENTIFIC REPORTS, 2021, 11 (01)
  • [2] A new optimization algorithm to solve multi-objective problems
    Mohammad Reza Sharifi
    Saeid Akbarifard
    Kourosh Qaderi
    Mohamad Reza Madadi
    Scientific Reports, 11
  • [3] Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
    Lemesre, J.
    Dhaenens, C.
    Talbi, E. G.
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (08) : 2450 - 2462
  • [4] A New Method to Solve Multi-Objective Linear Fractional Problems
    Borza, Mojtaba
    Rambely, Azmin Sham
    FUZZY INFORMATION AND ENGINEERING, 2021, 13 (03) : 323 - 334
  • [5] Efficiency coefficient method to solve interval multi-objective linear optimization problems
    Wang, C. (2002wangc@sohu.com), 1600, Beijing University of Aeronautics and Astronautics (BUAA), 37 Xueyuan Rd., Haidian District, Beijing, 100083, China (39):
  • [6] Alternative Techniques to Solve Hard Multi-Objective Optimization Problems
    Landa Becerra, Ricardo
    Coello Coello, Carlos A.
    Hernandez-Diaz, Alfredo G.
    Caballero, Rafael
    Molina, Julian
    GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 757 - +
  • [7] An interactive heuristic method for multi-objective combinatorial optimization
    Teghem, J
    Tuyttens, D
    Ulungu, EL
    COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (7-8) : 621 - 634
  • [8] Plane Separation: A method to solve dynamic multi-objective optimization problems with incorporated preferences
    Macias-Escobar, Teodoro
    Cruz-Reyes, Laura
    Fraire, Hector
    Dorronsoro, Bernabe
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 110 (110): : 864 - 875
  • [9] New Optimization Method Considering Combinatorial and Multi-Objective Optimization Problem for Distribution Systems
    Shigenobu, Ryuto
    Furukakoi, Masahiro
    Yona, Atsushi
    Senjyu, Tomonobu
    PROCEEDINGS OF THE 2016 IEEE REGION 10 CONFERENCE (TENCON), 2016, : 2656 - 2661
  • [10] Instance Space Analysis of Combinatorial Multi-objective Optimization Problems
    Yap, Estefania
    Munoz, Mario A.
    Smith-Miles, Kate
    Liefooghe, Arnaud
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
12345