Parameter meta-optimization of metaheuristics of solving specific NP-hard facility location problem

被引：12
|
作者：
Skakov, E. S. [1 ]
Malysh, V. N. [2 ]
机构：
[1] Novolipetsk Steel, Metallurgov Sq 2, Lipetsk 398040, Russia
[2] Russian Presidential Acad Natl Econ & Publ Adm, Lipetsk Branch, Dept Humanities & Nat Sci, Int Str 3, Lipetsk 398050, Russia
来源：
INTERNATIONAL CONFERENCE APPLIED MATHEMATICS, COMPUTATIONAL SCIENCE AND MECHANICS: CURRENT PROBLEMS | 2018年 / 973卷
关键词：
ANT COLONY OPTIMIZATION; FEATURE-SELECTION;
D O I：
10.1088/1742-6596/973/1/012063
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The aim of the work is to create an evolutionary method for optimizing the values of the control parameters of metaheuristics of solving the NP-hard facility location problem. A system analysis of the tuning process of optimization algorithms parameters is carried out. The problem of finding the parameters of a metaheuristic algorithm is formulated as a meta-optimization problem. Evolutionary metaheuristic has been chosen to perform the task of meta-optimization. Thus, the approach proposed in this work can be called "meta-metaheuristic". Computational experiment proving the effectiveness of the procedure of tuning the control parameters of metaheuristics has been performed.
引用
收藏
页数：12
相关论文
共 22 条
  • [1] Comparing Problem Solving Strategies for NP-hard Optimization Problems
    Hidalgo-Herrero, Mercedes
    Rabanal, Pablo
    Rodriguez, Ismael
    Rubio, Fernando
    FUNDAMENTA INFORMATICAE, 2013, 124 (1-2) : 1 - 25
  • [2] A Survey on Ant Colony Optimization for Solving Some of the Selected NP-Hard Problem
    Mandal, Akshaya Kumar
    Dehuri, Satchidananda
    BIOLOGICALLY INSPIRED TECHNIQUES IN MANY-CRITERIA DECISION MAKING, 2020, 10 : 85 - 100
  • [3] SOLVING NP-HARD PROBLEMS ON GRAPHS THAT ARE ALMOST TREES AND AN APPLICATION TO FACILITY LOCATION-PROBLEMS
    GUREVICH, Y
    STOCKMEYER, L
    VISHKIN, U
    JOURNAL OF THE ACM, 1984, 31 (03) : 459 - 473
  • [4] A Meta-Optimization Approach for Covering Problems in Facility Location
    Crawford, Broderick
    Soto, Ricardo
    Monfroy, Eric
    Astorga, Gino
    Garcia, Jose
    Cortes, Enrique
    APPLIED COMPUTER SCIENCES IN ENGINEERING, 2017, 742 : 565 - 578
  • [5] Simulation of an analogue circuit solving NP-hard optimization problems
    Babicz, Dora
    Tihanyi, Attila
    Koller, Miklos
    Rekeczky, Csaba
    Horvath, Andras
    2019 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2019,
  • [6] Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine
    Lazarev, A. A.
    Kvaratskheliya, A. G.
    Gafarov, E. R.
    DOKLADY MATHEMATICS, 2007, 75 (01) : 130 - 133
  • [7] Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine
    A. A. Lazarev
    A. G. Kvaratskheliya
    E. R. Gafarov
    Doklady Mathematics, 2007, 75 : 130 - 133
  • [8] A General Scheme for Solving an NP-hard Problem in the Strong Sense of the Scheduling Theory
    O. N. Shul'gina
    Automation and Remote Control, 2004, 65 : 456 - 463
  • [9] A general scheme for solving an NP-hard problem in the strong sense of the scheduling theory
    Shul'gina, ON
    AUTOMATION AND REMOTE CONTROL, 2004, 65 (03) : 456 - 463
  • [10] Adaptive multi-strategy particle swarm optimization for solving NP-hard optimization problems
    Abadlia, Houda
    Belhassen, Imhamed R.
    Smairi, Nadia
    INTERNATIONAL JOURNAL OF KNOWLEDGE-BASED AND INTELLIGENT ENGINEERING SYSTEMS, 2024, 28 (01) : 195 - 209
123