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

来源：

2023 20TH ACS/IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, AICCSA | 2023年

基金：

爱尔兰科学基金会;

关键词：

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

共 47 条

[1] Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems [J].

Alfaro-Fernandez, Pedro ;

Ruiz, Ruben ;

Pagnozzi, Federico ;

Stutzle, Thomas .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (03) :835-845

[2] A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems [J].

Alicastro, Mirko ;

Ferone, Daniele ;

Festa, Paola ;

Fugaro, Serena ;

Pastore, Tommaso .

COMPUTERS & OPERATIONS RESEARCH, 2021, 131

[3]

[Anonymous], Iterated greedy systematic review results

[4] A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem [J].

Avci, Mustafa ;

Topaloglu, Seyda .

COMPUTERS & OPERATIONS RESEARCH, 2017, 83 :54-65

[5] SIMULATED ANNEALING [J].

BERTSIMAS, D ;

TSITSIKLIS, J .

STATISTICAL SCIENCE, 1993, 8 (01) :10-15

[6]

Chebbi O., 2015, Electronic Notes in Discrete Mathematics, V47, P165

[7] An iterated greedy algorithm for the planning of yarn-dyeing boilers [J].

Demir, Yunus .

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2024, 31 (01) :115-139

[8] A hybrid TP plus PLS algorithm for bi-objective flow-shop scheduling problems [J].

Dubois-Lacoste, Jeremie ;

Lopez-Ibanez, Manuel ;

Stutzle, Thomas .

COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (08) :1219-1236

[9] Iterated greedy local search methods for unrelated parallel machine scheduling [J].

Fanjul-Peyro, Luis ;

Ruiz, Ruben .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 207 (01) :55-69

[10]

Fink A., 2019, Conducting research literature reviews: From the internet to paper, DOI DOI 10.3316/QRJ0702103

← 1 2 3 4 5 →