Iterated Greedy Algorithms for Combinatorial Optimization: A Systematic Literature Review

被引:0
|
作者
Missaoui, Ahmed [1 ]
Ozturk, Cemalettin [2 ]
O'Sullivan, Barry [1 ]
机构
[1] Univ Coll Cork, Sch Comp Sci & IT, Insight Ctr Data Analyt, Cork, Ireland
[2] Munster Technol Univ, Proc Energy Transport Engn, Cork, Ireland
基金
爱尔兰科学基金会;
关键词
Iterated Greedy; Destruction-reconstruction; Optimization; Meta-heuristics; Systematic Literature; TARDINESS MINIMIZATION; MINIMIZING MAKESPAN; SCHEDULING PROBLEM; SEARCH ALGORITHM; FLOWSHOP; MACHINE; FLOWTIME;
D O I
10.1109/AICCSA59173.2023.10479246
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Metaheuristics are essential tools for efficiently solving combinatorial optimization problems in arising from many fields. As incomplete methods, metaheuristics can provide good-quality results in a very short time. Among these approaches, the Iterated Greedy algorithm (IG) has appeared as a powerful and flexible method for finding near-optimal solutions to combinatorial problems. In this paper, we conducted a comprehensive systematic literature review on the variants of IG approach, and its applications covering the period from its inception in 2007 up to 2022. To the best of our knowledge, this is the first work in which all operators and aspects of IG are discussed to provide a detailed idea about this approach.
引用
收藏
页数:7
相关论文
共 50 条
  • [41] Memetic algorithms and memetic computing optimization: A literature review
    Neri, Ferrante
    Cotta, Carlos
    SWARM AND EVOLUTIONARY COMPUTATION, 2012, 2 : 1 - 14
  • [42] A taxonomy of evolutionary algorithms in combinatorial optimization
    Calégari, P
    Coray, G
    Hertz, A
    Kobler, D
    Kuonen, P
    JOURNAL OF HEURISTICS, 1999, 5 (02) : 145 - 158
  • [43] Metaheuristic algorithms for combinatorial optimization problems
    Iori M.
    4OR, 2005, 3 (2) : 163 - 166
  • [44] A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization
    Patrice Calégari
    Giovanni Coray
    Alain Hertz
    Daniel Kobler
    Pierre Kuonen
    Journal of Heuristics, 1999, 5 : 145 - 158
  • [45] RANDOMIZED ALGORITHMS IN COMBINATORIAL OPTIMIZATION - A SURVEY
    MAFFIOLI, F
    DISCRETE APPLIED MATHEMATICS, 1986, 14 (02) : 157 - 170
  • [46] Collaborative Evolutionary Algorithms for Combinatorial Optimization
    Gog, Anca
    Dumitrescu, D.
    Hirsbrunner, Beat
    GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 1511 - 1511
  • [47] Effective Neural Algorithms for Combinatorial Optimization
    ZENG Anjun SHA Jichang National University of Defence and Technology
    JournalofSystemsScienceandSystemsEngineering, 1993, (04) : 326 - 333
  • [48] Twisted hybrid algorithms for combinatorial optimization
    Caha, Libor
    Kliesch, Alexander
    Koenig, Robert
    QUANTUM SCIENCE AND TECHNOLOGY, 2022, 7 (04)
  • [49] Randomized approximation algorithms in combinatorial optimization
    Raghavan, P
    FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 1994, 880 : 300 - 317
  • [50] COMBINATORIAL OPTIMIZATION ALGORITHMS FOR A CAD WORKSTATION
    PRICE, WL
    WOODHAMS, FW
    DISCRETE APPLIED MATHEMATICS, 1990, 26 (2-3) : 219 - 233