A Bi-objective memetic algorithm proposal for solving the minimum sum coloring problem

被引：3
|
作者：
Harrabi, Olfa [1 ]
Fatnassi, Ezzeddine [1 ]
Bouziri, Hend [2 ]
Chaouachi, Jouhaina [3 ]
机构：
[1] Univ Tunis, Higher Inst Management Tunis, Tunis, Tunisia
[2] Univ Tunis, ESSEC, Tunis, Tunisia
[3] IHEC Carthage Prsidence 2016, Tunis, Tunisia
来源：
PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCO'17 COMPANION) | 2017年
关键词：
sum coloring problem; chromatic sum; bi-objective formulation; memetic algorithms; VEGA algorithm; tabu search;
D O I：
10.1145/3067695.3082035
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The minimum sum coloring problem (MSCP) is an extension of the graph coloring problem (GCP) which is known to be NP-hard. Due to its theoretical and practical relevance, MSCP attracts increasing attention. In this paper, a bi-objective memetic algorithm is proposed. The algorithm combines the use of an effective crossover operator and tabu search as a mutation operator. Experiments are performed on instances extracted from the second DIMACS and COLOR02 challenges. Obtained results of our algorithm improved upper bound values from the literature.
引用
收藏
页码：27 / 28
页数：2
相关论文
共 50 条
  • [1] Vector evaluated genetic algorithm for the BI-objective minimum sum coloring problem
    Bouziri, H.
    Siala, J. Chaouachi
    Harrabi, O.
    [J]. Proceedings - CIE 45: 2015 International Conference on Computers and Industrial Engineering, 2015,
  • [2] A memetic algorithm for the Minimum Sum Coloring Problem
    Jin, Yan
    Hao, Jin-Kao
    Hamiez, Jean-Philippe
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 43 : 318 - 327
  • [3] A Memetic Algorithm for the Bi-Objective Quadratic Assignment Problem
    Cubukcuoglu, Cemre
    Tasgetiren, M. Fatih
    Sariyildiz, I. Sevil
    Gao, Liang
    Kucukvar, Murat
    [J]. 25TH INTERNATIONAL CONFERENCE ON PRODUCTION RESEARCH MANUFACTURING INNOVATION: CYBER PHYSICAL MANUFACTURING, 2019, 39 : 1215 - 1222
  • [4] An Effective Parameter Tuning for a Bi-objective Genetic Algorithm to Solve the Sum Coloring Problem
    Harrabi, Olfa
    Siala, Jouhaina Chaouachi
    [J]. SOFT COMPUTING FOR PROBLEM SOLVING, SOCPROS 2017, VOL 1, 2019, 816 : 107 - 119
  • [5] Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
    Jaszkiewicz, Andrzej
    Zielniewicz, Piotr
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 193 (03) : 885 - 890
  • [6] Memetic Algorithm for Dynamic Bi-objective Optimization Problems
    Isaacs, Amitay
    Ray, Tapabrata
    Smith, Warren
    [J]. 2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, : 1707 - 1713
  • [7] A weighted-sum method for solving the bi-objective traveling thief problem
    Chagas, Jonatas B. C.
    Wagner, Markus
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2022, 138
  • [8] An Efficient Memetic Algorithm for the Minimum Load Coloring Problem
    Zhang, Zhiqiang
    Li, Zhongwen
    Qiao, Xiaobing
    Wang, Weijun
    [J]. MATHEMATICS, 2019, 7 (05)
  • [9] A Michigan memetic algorithm for solving the vertex coloring problem
    Mirsaleh, Mehdi Rezapoor
    Meybodi, Mohammad Reza
    [J]. JOURNAL OF COMPUTATIONAL SCIENCE, 2018, 24 : 389 - 401
  • [10] Solving Bi-Objective Quadratic Assignment Problem with Squirrel Search Algorithm
    Ningtiyas, Sri Wahyuni
    Pratiwi, Asri Bekti
    Damayanti, Auli
    [J]. INTERNATIONAL CONFERENCE ON MATHEMATICS, COMPUTATIONAL SCIENCES AND STATISTICS 2020, 2021, 2329
12345