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

来源：

THEORY AND PRACTICE OF NATURAL COMPUTING (TPNC 2018) | 2018年 / 11324卷

基金：

奥地利科学基金会;

关键词：

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 条

[31] On a Box-Constrained Linear Symmetric Cone Optimization Problem
Yi Xu
Xihong Yan
Journal of Optimization Theory and Applications, 2019, 181 : 946 - 971
[32] On a Box-Constrained Linear Symmetric Cone Optimization Problem
Xu, Yi
Yan, Xihong
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2019, 181 (03) : 946 - 971
[33] ANT COLONY OPTIMIZATION ALGORITHMS WITH DIVERSIFIED SEARCH IN THE PROBLEM OF OPTIMIZATION OF AIRTRAVEL ITINERARY
Hulianytskyi, L.
Pavlenko, A.
CYBERNETICS AND SYSTEMS ANALYSIS, 2019, 55 (06) : 978 - 987
[34] Study of simulated annealing based algorithms for multiobjective optimization of a constrained problem
Suman, B
COMPUTERS & CHEMICAL ENGINEERING, 2004, 28 (09) : 1849 - 1871
[35] Ant Colony Optimization Algorithms with Diversified Search in the Problem of Optimization of Airtravel Itinerary
L. Hulianytskyi
A. Pavlenko
Cybernetics and Systems Analysis, 2019, 55 : 978 - 987
[36] Hybridizing Cuckoo Search with Bio-inspired Algorithms for Constrained Optimization Problems
Kanagaraj, G.
Ponnambalam, S. G.
Gandomi, A. H.
SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING (SEMCCO 2015), 2016, 9873 : 260 - 273
[37] An Ensemble of Differential Evolution Algorithms with Variable Neighborhood Search for Constrained Function Optimization
Paldrak, Mert
Tasgetiren, M. Fatih
Suganthan, P. N.
Pan, Quan-Ke
2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 2610 - 2617
[38] A linear relaxation model for shape optimization of constrained contact force problem
Zhang, Weihong
Niu, Cao
COMPUTERS & STRUCTURES, 2018, 200 : 53 - 67
[39] Benchmark testing of simulated annealing, adaptive random search and genetic algorithms for the global optimization of bioprocesses
Oliveira, R
Salcedo, R
Adaptive and Natural Computing Algorithms, 2005, : 292 - 295
[40] New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem
Weyland, Dennis
Bianchi, Leonora
Gambardella, Luca Maria
COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2009, 2009, 5717 : 681 - 688

← 1 2 3 4 5 →