Combinatorial optimization algorithms combining greedy strategies with a limited search procedure

被引：7
|
作者：
Kostenko, V. A. [1 ]
机构：
[1] Moscow MV Lomonosov State Univ, Moscow, Russia
来源：
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL | 2017年 / 56卷 / 02期
基金：
俄罗斯基础研究基金会;
关键词：
RESOURCE-ALLOCATION; DATA CENTERS; SYSTEMS;
D O I：
10.1134/S1064230717020137
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The proposed algorithms basically follow a greedy strategy, and a limited search procedure is invoked only at the steps at which the greedy choice cannot lead to the optimal solution. The principle of these algorithms design are illustrated using the problem of finding the maximum number of compatible jobs as an example. The results of applying the proposed algorithms for scheduling computations in distributed systems are described.
引用
收藏
页码：218 / 226
页数：9
相关论文
共 50 条
  • [1] Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
    V. A. Kostenko
    [J]. Journal of Computer and Systems Sciences International, 2017, 56 : 218 - 226
  • [2] Iterated Greedy Algorithms for Combinatorial Optimization: A Systematic Literature Review
    Missaoui, Ahmed
    Ozturk, Cemalettin
    O'Sullivan, Barry
    [J]. 2023 20TH ACS/IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, AICCSA, 2023,
  • [3] Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization
    Benabbou, Nawal
    Leroy, Cassandre
    Lust, Thibaut
    Perny, Patrice
    [J]. THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 12233 - 12240
  • [4] Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification
    Puchinger, J
    Raidl, GR
    [J]. ARTIFICIAL INTELLIGENCE AND KNOWLEDGE ENGINEERING APPLICATIONS: A BIOINSPIRED APPROACH, PT 2, PROCEEDINGS, 2005, 3562 : 41 - 53
  • [5] A Random Search and Greedy Selection based Genetic Quantum Algorithm for Combinatorial Optimization
    Pavithr, R. S.
    Gursaran
    [J]. 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 2422 - 2427
  • [6] Absorption in Model-based Search Algorithms for Combinatorial Optimization
    Wu, Zijun
    Kolonko, Michael
    [J]. 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 1744 - 1751
  • [7] PARALLEL BIASED SEARCH FOR COMBINATORIAL OPTIMIZATION - GENETIC ALGORITHMS AND TABU
    BATTITI, R
    TECCHIOLLI, G
    [J]. MICROPROCESSORS AND MICROSYSTEMS, 1992, 16 (07) : 351 - 367
  • [8] Combining Local Search and Elicitation for Multi-Objective Combinatorial Optimization
    Benabbou, Nawal
    Leroy, Cassandre
    Lust, Thibaut
    Perny, Patrice
    [J]. ALGORITHMIC DECISION THEORY (ADT 2019), 2019, 11834 : 1 - 16
  • [9] Case Study of Production Planning Optimization with Use of the Greedy and Tabu Search Algorithms
    Lampika, Lukasz
    Musial, Kamil
    Burduk, Anna
    [J]. INTELLIGENT SYSTEMS IN PRODUCTION ENGINEERING AND MAINTENANCE, 2019, 835 : 66 - 75
  • [10] Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems
    Stefan Boettcher
    [J]. Nature Machine Intelligence, 2023, 5 : 24 - 25
12345