A novel optimization booster algorithm

被引:13
作者
Pakzad-Moghaddam, S. H. [1 ]
Mina, Hassan [1 ]
Mostafazadeh, Parisa [1 ]
机构
[1] Univ Tehran, Coll Engn, Sch Ind Engn, Tehran, Iran
关键词
Artificial intelligence; Computer science; Evolutionary computation; Mathematical optimization; Exchange market; PARTICLE SWARM OPTIMIZATION; DIFFERENTIAL EVOLUTION; SEARCH ALGORITHM; OPTIMAL-DESIGN; FLOW TIME; INTEGER;
D O I
10.1016/j.cie.2019.07.046
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, a novel meta-heuristic method called the Optimization Booster Algorithm (OBA) is presented. It incorporates existing optimization methods with human-inspired intelligence, which applies particularly while conducting business in exchange markets. A key objective in exchange markets is to increase wealth over time, which is typically the same objective when performing optimizations. Moreover, optimization is about finding a way to increase the fitness value of a system, by spending adequate computation time. The OBA is founded on the core idea that a key reason behind the rapid evolution of human societies compared to the tortoise-like natural evolution is the forward-looking approach. In exchange markets, analysts have learned to make decisions based on forecasted prices, rather than the current prices; and this is an illustrative example of the application of such forward-looking approaches, which form the essence of the OBA. Following extensive numerical experiments, and applications of fourteen well-known heuristic and meta-heuristic methods to solve seventy-one nonlinear unconstrained and constrained, single-objective and multi-objective benchmarks, before and after receiving a boost, the OBA performance is investigated. It has proven - in both theory and practice - to quite significantly improve existing optimization methods. In most cases, boosting resulted in much better quality of outputs, while requiring less computation time.
引用
收藏
页码:591 / 613
页数:23
相关论文
共 81 条
[1]  
[Anonymous], 1997, J. Glob. Optim., DOI DOI 10.1023/A:1008202821328
[2]  
[Anonymous], 1987, PRACTICAL METHODS OP
[3]  
[Anonymous], 2003, B AM METEOROL SOC, DOI [DOI 10.1175/BAMS-84-9-1205, DOI 10.1007/978-3-642-68874-4_12]
[4]  
[Anonymous], 1991, POSITIVE FEEDBACK SE
[5]  
[Anonymous], 2006, Engineering Optimization Methods and Applications
[6]  
Atashpaz-Gargari E, 2007, IEEE C EVOL COMPUTAT, P4661, DOI 10.1109/cec.2007.4425083
[7]   An iterated local search heuristic for cell formation [J].
Brusco, Michael J. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 90 :292-304
[8]   A trust region method based on interior point techniques for nonlinear programming [J].
Byrd, RH ;
Gilbert, JC ;
Nocedal, J .
MATHEMATICAL PROGRAMMING, 2000, 89 (01) :149-185
[9]   An interior point algorithm for large-scale nonlinear programming [J].
Byrd, RH ;
Hribar, ME ;
Nocedal, J .
SIAM JOURNAL ON OPTIMIZATION, 1999, 9 (04) :877-900
[10]   Solving discrete lot-sizing and scheduling by simulated annealing and mixed integer programming [J].
Ceschia, Sara ;
Di Gaspero, Luca ;
Schaerf, Andrea .
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 114 :235-243