A grid-based parallel approach of the multi-objective branch and bound

被引:7
|
作者
Mezmaz, M. [1 ]
Melab, N. [1 ]
Talbi, E-G. [1 ]
机构
[1] Lab Informat Fondamentale Lille, CNRS, UMR 8022, INRIA Futurs DOLPHIN Project, Cite Sci, F-59655 Villeneuve Dascq, France
来源
15TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS | 2007年
关键词
branch and bound; Grid computing; multi-objective optimization;
D O I
10.1109/PDP.2007.7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The Branch and Bound (B&B) algorithm is one of the most used methods to solve in an exact way combinatorial optimization problems. This article focuses on the multi-objective version of this algorithm, and proposes a new parallel approach adapted to grid computing systems. This approach addresses several issues related to the characteristics of the algorithm itself and the properties of grid computing systems. Validation is Performed by experimenting the approach on a bi-objective flow-shop problem instance that has never been solved exactly. Solving this instance, after several days of computation on a grid of more than 1000 processors, belonging to 7 distinct clusters, and the obtained results prove the efficiency of the proposed approach.
引用
收藏
页码:23 / +
页数:2
相关论文
共 50 条
  • [21] Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm
    Soto, Carlos
    Dorronsoro, Bernabe
    Fraire, Hector
    Cruz-Reyes, Laura
    Gomez-Santillan, Claudia
    Rangel, Nelson
    SWARM AND EVOLUTIONARY COMPUTATION, 2020, 53 (53)
  • [22] Multi-Objective Design and Optimization of Hardware-Friendly Grid-Based Sparse MIMO Arrays
    Tanyer, Suleyman Gokhun
    Dent, Paul
    Ali, Murtaza
    Davis, Curtis
    Rajagopal, Senthilkumar
    Driessen, Peter F.
    SENSORS, 2024, 24 (21)
  • [23] Multi-Agent Multi-Objective Ergodic Search using Branch and Bound
    Srinivasan, Akshaya Kesarimangalam
    Gutow, Geordan
    Ren, Zhongqiang
    Abraham, Ian
    Vundurthy, Bhaskar
    Choset, Howie
    2023 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, IROS, 2023, : 844 - 849
  • [24] A parallel evolutionary approach to multi-objective optimization
    Feng, Xiang
    Lau, Francis C. M.
    2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 1199 - 1206
  • [25] Multi-Objective Embarrassingly Parallel Search with Upper Bound Constraints
    Miyamoto, T.
    Yasuhara, M.
    Mori, K.
    Kitamura, S.
    Izui, Y.
    2016 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2016, : 1334 - 1339
  • [26] A grid-based parallel maple
    Petcu, D
    Dubu, D
    Paprzycki, M
    RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE, PROCEEDINGS, 2004, 3241 : 215 - 223
  • [27] On the Design and Anytime Performance of Indicator-based Branch and Bound for Multi-objective Combinatorial Optimization
    Jesus, Alexandre D.
    Paquete, Luis
    Derbel, Bilel
    Liefooghe, Arnaud
    PROCEEDINGS OF THE 2021 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'21), 2021, : 234 - 242
  • [28] Optimal expansion planning of distribution system using grid-based multi-objective harmony search algorithm
    Agajie, Takele Ferede
    Khan, Baseem
    Alhelou, Hassan Haes
    Mahela, Om Prakash
    COMPUTERS & ELECTRICAL ENGINEERING, 2020, 87
  • [29] A grid-based parallel maple
    Petcu, Dana
    Dubu, Diana
    Paprzycki, Marcin
    Lect. Notes Comput. Sci., 1600, (215-223):
  • [30] Planning of autonomous microgrid with energy storage using grid-based multi-objective harmony search algorithm
    Kayalvizhi S.
    Vinod Kumar D.M.
    1600, Acta Press, Building B6, Suite 101, 2509 Dieppe Avenue S.W., Calgary, AB, T3E 7J9, Canada (37): : 10 - 18