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 条
  • [1] Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
    V. A. Kostenko
    Journal of Computer and Systems Sciences International, 2017, 56 : 218 - 226
  • [2] Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
    Kostenko, V. A.
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2017, 56 (02) : 218 - 226
  • [3] Systematic Literature Review of Optimization Algorithms for P||Cmax Problem
    Ostojic, Dragutin
    Ramljak, Dusan
    Urosevic, Andrija
    Jolovic, Marija
    Draskovic, Radovan
    Kakka, Jainil
    Kruger, Tatjana Jaksic
    Davidovic, Tatjana
    SYMMETRY-BASEL, 2025, 17 (02):
  • [4] Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms
    Shao, Weishi
    Pi, Dechang
    Shao, Zhongshi
    KNOWLEDGE-BASED SYSTEMS, 2017, 137 : 163 - 181
  • [5] Optimization algorithms for construction site layout planning: a systematic literature review
    Xu, Maozeng
    Mei, Zhongya
    Luo, Siyu
    Tan, Yi
    ENGINEERING CONSTRUCTION AND ARCHITECTURAL MANAGEMENT, 2020, 27 (08) : 1913 - 1938
  • [6] Iterated greedy algorithms for customer order scheduling with dedicated machines
    Hoffmann, Julius
    Neufeld, Janis S.
    Buscher, Udo
    IFAC PAPERSONLINE, 2022, 55 (10): : 1594 - 1599
  • [7] Iterated greedy algorithms for a complex parallel machine scheduling problem
    Mecler, Davi
    Abu-Marrul, Victor
    Martinelli, Rafael
    Hoff, Arild
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 300 (02) : 545 - 560
  • [8] Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems
    Stefan Boettcher
    Nature Machine Intelligence, 2023, 5 : 24 - 25
  • [9] Representation of the Greedy Algorithms Applicability for Solving the Combinatorial Optimization Problems Based on the Hypergraph Mathematical Structure
    Potebnia, Artem
    2017 14TH INTERNATIONAL CONFERENCE: THE EXPERIENCE OF DESIGNING AND APPLICATION OF CAD SYSTEMS IN MICROELECTRONICS (CADSM), 2017, : 328 - 332
  • [10] Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems
    Boettcher, Stefan
    NATURE MACHINE INTELLIGENCE, 2023, 5 (01) : 24 - 25