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] A simheuristic for bi-objective stochastic permutation flow shop scheduling problem
    Maria Gonzalez-Neira, Eliana
    Rafael Montoya-Torres, Jairo
    JOURNAL OF PROJECT MANAGEMENT, 2019, 4 (02) : 57 - 80
  • [22] A Path Relinking-Based Approach for the Bi-Objective Double Floor Corridor Allocation Problem
    Uribe, Nicolas R.
    Herran, Alberto
    Manuel Colmenar, J.
    ADVANCES IN ARTIFICIAL INTELLIGENCE, CAEPIA 2024, 2024, : 111 - 120
  • [23] An exact algorithm for the bi-objective timing problem
    Jacquin, Sophie
    Dufosse, Fanny
    Jourdan, Laetitia
    OPTIMIZATION LETTERS, 2018, 12 (04) : 903 - 914
  • [24] Neighborhood Combination Strategies for Solving the Bi-objective Max-Bisection Problem
    Zeng, Rong-Qiang
    Basseur, Matthieu
    INTELLIGENT COMPUTING THEORIES AND APPLICATION (ICIC 2022), PT I, 2022, 13393 : 123 - 131
  • [25] A novel multi-objective discrete water wave optimization for solving multi-objective blocking flow-shop scheduling problem
    Shao, Zhongshi
    Pi, Dechang
    Shao, Weishi
    KNOWLEDGE-BASED SYSTEMS, 2019, 165 : 110 - 131
  • [26] Solving the Path Planning Problem in Mobile Robotics with the Multi-Objective Evolutionary Algorithm
    Xue, Yang
    Sun, Jian-Qiao
    APPLIED SCIENCES-BASEL, 2018, 8 (09):
  • [27] Fast Multi-objective Hybrid Evolutionary Algorithm for Flow Shop Scheduling Problem
    Zhang, Wenqiang
    Lu, Jiaming
    Zhang, Hongmei
    Wang, Chunxiao
    Gen, Mitsuo
    PROCEEDINGS OF THE TENTH INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2017, 502 : 383 - 392
  • [28] Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm
    Cho, Hang-Min
    Bae, Suk-Joo
    Kim, Jungwuk
    Jeong, In-Jae
    COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (03) : 529 - 541
  • [29] Heuristics for the bi-objective path dissimilarity problem
    Marti, Rafael
    Gonzalez Velarde, Jose Luis
    Duarte, Abraham
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (11) : 2905 - 2912
  • [30] Solving Bi-criteria Maximum Diversity Problem with Multi-objective Multi-level Algorithm
    Xue, Li-Yuan
    Zeng, Rong-Qiang
    Xu, Hai-Yun
    Wen, Yi
    INTELLIGENT COMPUTING METHODOLOGIES, ICIC 2018, PT III, 2018, 10956 : 54 - 62
12345