A Linear Constrained Optimization Benchmark for Probabilistic Search Algorithms: The Rotated Klee-Minty Problem

被引:1
|
作者
Hellwig, Michael [1 ]
Beyer, Hans-Georg [1 ]
机构
[1] Vorarlberg Univ Appl Sci, Res Ctr PPE, Campus 5,Hoch Str 1, A-6850 Dornbirn, Austria
基金
奥地利科学基金会;
关键词
Probabilistic search algorithms; Benchmarking; Evolutionary algorithms; Linear problems; Constrained optimization; Klee-Minty cube;
D O I
10.1007/978-3-030-04070-3_11
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The development, assessment, and comparison of randomized search algorithms heavily rely on benchmarking. Regarding the domain of constrained optimization, the small number of currently available benchmark environments bears no relation to the vast number of distinct problem features. The present paper advances a proposal of a scalable linear constrained optimization problem that is suitable for benchmarking Evolutionary Algorithms. By comparing two recent Evolutionary Algorithm variants, the linear benchmarking environment is demonstrated.
引用
收藏
页码:139 / 151
页数:13
相关论文
共 50 条
  • [41] Optimization algorithms for solving resource-constrained project scheduling problem: A review
    Liu, Shi-Xin
    Wang, Meng-Guang
    Tang, Jia-Fu
    Kongzhi yu Juece/Control and Decision, 2001, 16 (SUPPL.): : 647 - 651
  • [42] COMPASS: Double-ended saddle point search as a constrained optimization problem
    Sommer-Jorgensen, Martin
    Goedecker, Stefan
    JOURNAL OF CHEMICAL PHYSICS, 2024, 160 (06):
  • [43] Quantum beetle antennae search: a novel technique for the constrained portfolio optimization problem
    Ameer Tamoor Khan
    Xinwei Cao
    Shuai Li
    Bin Hu
    Vasilios N. Katsikis
    Science China Information Sciences, 2021, 64
  • [44] Constrained gravitational search algorithm for large scale reservoir operation optimization problem
    Moeini, R.
    Soltani-nezhad, M.
    Daei, M.
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2017, 62 : 222 - 233
  • [45] An SQP algorithm with nonmonotone line search for general nonlinear constrained optimization problem
    He, GP
    Diao, BQ
    Gao, ZY
    JOURNAL OF COMPUTATIONAL MATHEMATICS, 1997, 15 (02) : 179 - 192
  • [46] A Hybrid Cultural Harmony Search Algorithm for Constrained Optimization Problem of Diesel Blending
    Gao, Min
    Zhu, Yanfei
    Cao, Cuiwen
    Zhu, Yanfeng
    IEEE ACCESS, 2020, 8 : 6673 - 6690
  • [47] Constrained gradient descent and line search for solving optimization problem with elliptic constraints
    Hasan, AA
    Hasan, MA
    2003 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL II, PROCEEDINGS: SPEECH II; INDUSTRY TECHNOLOGY TRACKS; DESIGN & IMPLEMENTATION OF SIGNAL PROCESSING SYSTEMS; NEURAL NETWORKS FOR SIGNAL PROCESSING, 2003, : 793 - 796
  • [48] Quantum beetle antennae search: a novel technique for the constrained portfolio optimization problem
    Ameer Tamoor KHAN
    Xinwei CAO
    Shuai LI
    Bin HU
    Vasilios N.KATSIKIS
    Science China(Information Sciences), 2021, 64 (05) : 121 - 134
  • [49] Quantum beetle antennae search: a novel technique for the constrained portfolio optimization problem
    Khan, Ameer Tamoor
    Cao, Xinwei
    Li, Shuai
    Hu, Bin
    Katsikis, Vasilios N.
    SCIENCE CHINA-INFORMATION SCIENCES, 2021, 64 (05)
  • [50] Digital Pattern Search and Its Hybridization with Genetic Algorithms for Bound Constrained Global Optimization
    Kim, Nam-Geun
    Park, Youngsu
    Kim, Jong-Wook
    Kim, Eunsu
    Kim, Sang Woo
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2009, E92A (02) : 481 - 492