Exchange market algorithm

被引:212
作者
Ghorbani, Naser [1 ]
Babaei, Ebrahim [1 ]
机构
[1] Univ Tabriz, Fac Elect & Comp Engn, Tabriz, Iran
关键词
Optimization; Evolutionary algorithm; Exchange market algorithm; Stock market; ANT COLONY OPTIMIZATION; IMPERIALIST COMPETITIVE ALGORITHM; PARTICLE SWARM OPTIMIZATION; ARTIFICIAL BEE COLONY; GENETIC ALGORITHM;
D O I
10.1016/j.asoc.2014.02.006
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
This paper proposes a new evolutionary algorithm for continuous non-linear optimization problems. This optimization algorithm is inspired by the procedure of trading the shares on stock market and it is called exchange market algorithm (EMA). Evaluation of how the stocks are traded on the stock market by elites has formed this evolutionary as an optimization algorithm. In the proposed method there are two different modes in EMA. In the first mode, there is no oscillation in the market whereas in the second mode, the market has oscillation. It is noticeable that at the end of each mode, the individuals' finesses are evaluated. For the first mode, the algorithm's duty is to recruit people toward successful individuals, while in the second case the algorithm seeks optimal points. In this algorithm, the generation and organization of random numbers are performed in the best way due to the existence of two absorbent operators and two searching operators leading to high capability in global optimum point extraction. To evaluate the performance of the proposed algorithm, this algorithm has been implemented on 12 different benchmark functions with 10, 20, 30 and 50 dimension variables. The results obtained by 30 dimension variables are compared with the results obtained by the eight new and efficient algorithms. The results indicate the ability of the proposed algorithm in finding the global optimum point of the functions for each run of the program. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:177 / 187
页数:11
相关论文
共 36 条
[1]
Evolving artificial neural network and imperialist competitive algorithm for prediction oil flow rate of the reservoir [J].
Ahmadi, Mohammad Ali ;
Ebadi, Mohammad ;
Shokrollahi, Amin ;
Majidi, Seyed Mohammad Javad .
APPLIED SOFT COMPUTING, 2013, 13 (02) :1085-1098
[2]
Hybridizing ant colony optimization via genetic algorithm for mixed-model assembly line balancing problem with sequence dependent setup times between tasks [J].
Akpinar, Sener ;
Bayhan, G. Mirac ;
Baykasoglu, Adil .
APPLIED SOFT COMPUTING, 2013, 13 (01) :574-589
[3]
[Anonymous], 2004, ANT COLONY OPTIMIZAT
[4]
[Anonymous], 2004, Wiley InterScience electronic collection.
[5]
Atashpaz-Gargari E, 2007, IEEE C EVOL COMPUTAT, P4661, DOI 10.1109/cec.2007.4425083
[6]
Solution to non-convex economic dispatch problem with valve point effects by incremental artificial bee colony with local search [J].
Aydin, Dogan ;
Ozyon, Serdar .
APPLIED SOFT COMPUTING, 2013, 13 (05) :2456-2466
[7]
A hybrid meta-heuristic algorithm for optimization of crew scheduling [J].
Azadeh, A. ;
Farahani, M. Hosseinabadi ;
Eivazy, H. ;
Nazari-Shirkouhi, S. ;
Asadipour, G. .
APPLIED SOFT COMPUTING, 2013, 13 (01) :158-164
[8]
New paradoxes of risky decision making [J].
Birnbaum, Michael H. .
PSYCHOLOGICAL REVIEW, 2008, 115 (02) :463-501
[9]
A particle swarm optimization algorithm for optimal car-call allocation in elevator group control systems [J].
Bolat, Berna ;
Altun, Oguz ;
Cortes, Pablo .
APPLIED SOFT COMPUTING, 2013, 13 (05) :2633-2642
[10]
CUEVAS E, 2012, DISCRETE DYN NAT SOC, V2012, P1