Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6901982 | Procedia Computer Science | 2017 | 8 Pages |
Abstract
Exchange market algorithm (EMA) is one of the most recent population-based optimization algorithm. EMA inspired by the method of selling and purchasing of shares by elite stockbrokers, tries to solve the optimization problems. This algorithm has two searcher operators as well as two absorbent operators for individuals to be absorbed to the elite person, which leads to create and organize the random numbers in best way. The standard EMA algorithm is proposed only for continuous optimization problems. This paper proposes a binary version of EMA for discrete optimization problems. To investigate the performance of proposed binary exchange market algorithm on the discrete optimization, the algorithm has been successfully implemented on 7 Binary benchmark functions in large dimension variables. The obtained results indicate the high ability of the proposed algorithm in comparison with the other algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Naser Ghorbani, Ebrahim Babaei, Fahreddin Sadikoglu,