Vector evaluated genetic algorithm for the BI-objective minimum sum coloring problem

被引：0
|
作者：
Bouziri, H. [1 ]
Siala, J. Chaouachi [2 ]
Harrabi, O. [2 ]
机构：
[1] Department Computing Management, LARODEC, High Institute of Commercial Studies IHEC, Carthage, Tunisia
[2] Department Computing Management, ECSTRA, High Institute of Commercial Studies IHEC, Carthage, Tunisia
来源：
Proceedings - CIE 45: 2015 International Conference on Computers and Industrial Engineering | 2015年
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Problem solving - Genetic algorithms - Graph theory - Coloring
引用
收藏
相关论文
共 50 条
  • [41] Genetic Algorithm and Local Search Comparison for Solving Bi-objective p-Median Problem
    Tangpattanakul, Panwadee
    2015 4TH INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION ICIEV 15, 2015,
  • [42] Modified savings heuristics and genetic algorithm for bi-objective vehicle routing problem with forced backhauls
    Anbuudayasankar, S. P.
    Ganesh, K.
    Koh, S. C. Lenny
    Ducq, Yves
    EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (03) : 2296 - 2305
  • [43] A multi-objective electromagnetism algorithm for a bi-objective flowshop scheduling problem
    Khalili, Majid
    Tavakkoli-Moghaddam, Reza
    JOURNAL OF MANUFACTURING SYSTEMS, 2012, 31 (02) : 232 - 239
  • [44] A weighted-sum method for solving the bi-objective traveling thief problem
    Chagas, Jonatas B. C.
    Wagner, Markus
    COMPUTERS & OPERATIONS RESEARCH, 2022, 138
  • [45] Algorithms for the minimum sum coloring problem: a review
    Yan Jin
    Jean-Philippe Hamiez
    Jin-Kao Hao
    Artificial Intelligence Review, 2017, 47 : 367 - 394
  • [46] Algorithms for the minimum sum coloring problem: a review
    Jin, Yan
    Hamiez, Jean-Philippe
    Hao, Jin-Kao
    ARTIFICIAL INTELLIGENCE REVIEW, 2017, 47 (03) : 367 - 394
  • [47] A fast local search algorithm for minimum sum coloring problem on massive graphs
    Li, Yan
    Zhao, Mengyu
    Zhang, Xindi
    Wang, Yiyuan
    COMPUTERS & OPERATIONS RESEARCH, 2024, 172
  • [48] Two-phase strategies for the bi-objective minimum spanning tree problem
    Amorosi, Lavinia
    Puerto, Justo
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (06) : 3435 - 3463
  • [49] The Bi-objective Minimum Latency Problem with Profit Collection and Uncertain Travel Times
    Elena Bruni, Maria
    Khodaparasti, Sara
    Nucamendi-Guillen, Samuel
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES), 2020, : 109 - 118
  • [50] A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem
    Prakash, V. Prem
    Patvardhan, C.
    Srivastav, Anand
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2020, 87
12345