Solving Bi-Objective Flow Shop Problem with Multi-Objective Path Relinking Algorithm

被引：0
|
作者：
Zeng, Rang-Qiang [1 ]
Shang, Ming-Sheng [2 ]
机构：
[1] Southwest Jiaotong Univ, Sch Math, Chengdu 610031, Sichuan, Peoples R China
[2] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu 610054, Sichuan, Peoples R China
来源：
2014 10TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC) | 2014年
关键词：
multi-objective optimization; hypervolume contribution; path relinking; local search; flow shop problem; SEARCH; TARDINESS;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper presents a multi-objective path relinking algorithm for solving bi-objective flow shop problem, where we aim to minimize the total completion time and total tardiness. In this algorithm, we integrate path relinking techniques into hypervolume-based multi-objective optimization. We propose a method to construct a path and select a set of non-dominated solutions from the path for further improvements. Experimental results show the proposed algorithm is very effective in comparison with the original multi-objective local search algorithms.
引用
收藏
页码：343 / 348
页数：6
相关论文
共 50 条
  • [21] Path relinking strategies for the bi-objective double floor corridor allocation problem
    Uribe, Nicolas R.
    Herran, Alberto
    Colmenar, J. Manuel
    KNOWLEDGE-BASED SYSTEMS, 2024, 305
  • [22] Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem
    Jia, Shuai
    Hu, Zhi-Hua
    COMPUTERS & OPERATIONS RESEARCH, 2014, 47 : 11 - 26
  • [23] An Immune-PSO Algorithm for Bi-objective Flow Shop Scheduling Problem
    Chang Junlin
    Liang Junyan
    Wei Wei
    2011 30TH CHINESE CONTROL CONFERENCE (CCC), 2011, : 2115 - 2118
  • [24] Artificial bee colony algorithm for solving a bi-objective job shop scheduling problem
    Zhang R.
    Advances in Information Sciences and Service Sciences, 2011, 3 (08): : 319 - 326
  • [25] Solving and optimizing a bi-objective open shop scheduling problem by a modified genetic algorithm
    Ali Azadeh
    SeyedMorteza Goldansaz
    AmirHossein Zahedi-Anaraki
    The International Journal of Advanced Manufacturing Technology, 2016, 85 : 1603 - 1613
  • [26] Solving and optimizing a bi-objective open shop scheduling problem by a modified genetic algorithm
    Azadeh, Ali (aazadeh@ut.ac.ir), 1603, Springer London (85): : 5 - 8
  • [27] An improved multi-objective evolutionary algorithm based on decomposition for bi-objective fuzzy flexible job-shop scheduling problem
    Li R.
    Gong W.-Y.
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2022, 39 (01): : 31 - 40
  • [28] Solving and optimizing a bi-objective open shop scheduling problem by a modified genetic algorithm
    Azadeh, Ali
    Goldansaz, SeyedMorteza
    Zahedi-Anaraki, AmirHossein
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2016, 85 (5-8): : 1603 - 1613
  • [29] Hypervolume-Based Multi-Objective Path Relinking Algorithm
    Zeng, Rong-Qiang
    Basseur, Matthieu
    Hao, Jin-Kao
    EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, EMO 2013, 2013, 7811 : 185 - 199
  • [30] A novel multi-objective evolutionary algorithm based on subpopulations for the bi-objective traveling salesman problem
    Moraes, Deyvid Heric
    Sanches, Danilo Sipoli
    Rocha, Josimar da Silva
    Caldonazzo Garbelini, Jader Maikol
    Castoldi, Marcelo Favoretto
    SOFT COMPUTING, 2019, 23 (15) : 6157 - 6168
12345