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 条
  • [41] A novel cost-palatability bi-objective approach to the menu planning problem with an innovative similarity metric using a path relinking algorithm
    Martos-Barrachina, F.
    Delgado-Antequera, L.
    Hernandez, M.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2025, 76 (01) : 73 - 85
  • [42] A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
    Jesús Sánchez-Oro
    Ana D. López-Sánchez
    J. Manuel Colmenar
    Optimization Letters, 2022, 16 : 301 - 331
  • [43] A novel multi-objective evolutionary algorithm solving portfolio problem
    Zhou, Yuan
    Liu, Hai-Lin
    Chen, Wenqin
    Li, Jingqian
    1600, Academy Publisher (09): : 222 - 229
  • [44] A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
    Sanchez-Oro, Jesus
    Lopez-Sanchez, Ana D.
    Colmenar, J. Manuel
    OPTIMIZATION LETTERS, 2022, 16 (01) : 301 - 331
  • [45] Solving a new bi-objective mathematical model for a hybrid flow shop scheduling problem with robots and fuzzy maintenance time
    Ghodratnama, Ali
    Amiri-Aref, Mehdi
    Tavakkoli-Moghaddam, Reza
    COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 182
  • [46] A Memetic Algorithm for the Multi-Objective Flexible Job Shop Scheduling Problem
    Yuan, Yuan
    Xu, Hua
    GECCO'13: PROCEEDINGS OF THE 2013 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2013, : 559 - 566
  • [47] Multi-objective chicken swarm optimization: A novel algorithm for solving multi-objective optimization problems
    Zouache, Djaafar
    Arby, Yahya Quid
    Nouioua, Farid
    Ben Abdelaziz, Fouad
    COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 129 : 377 - 391
  • [48] A Multi-objective Memetic Algorithm for the Job-Shop Scheduling Problem
    Frutos, Mariano
    Tohme, Fernando
    OPERATIONAL RESEARCH, 2013, 13 (02) : 233 - 250
  • [49] A Painless Gradient-assisted Multi-objective Memetic Mechanism for Solving Continuous Bi-objective Optimization Problems
    Lara Lopez, Adriana
    Coello Coello, Carlos A.
    Schuetze, Oliver
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [50] A Multi-objective Memetic Algorithm for the Job-Shop Scheduling Problem
    Mariano Frutos
    Fernando Tohmé
    Operational Research, 2013, 13 : 233 - 250
12345