Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems

Mohamed A. Tawhid () and Ahmed F. Ali ()
Additional contact information
Mohamed A. Tawhid: Thompson Rivers University
Ahmed F. Ali: Thompson Rivers University

OPSEARCH, 2016, vol. 53, issue 4, No 3, 705-740

Abstract: Abstract In this paper, we propose a new hybrid algorithm by combining the particle swarm optimization with a genetic arithmetical crossover operator after applying a modification on it in order to avoid the problem of stagnation and premature convergence of the population. In the final stage of the algorithm, we applied the Nelder-Mead method as a local search method in order to accelerate the convergence and avoid running the algorithm without any improvements in the results. We call the new proposed algorithm by simplex particle swarm optimization with a modified arithmetical crossover (SPSOAC). We test SPSOAC on 7 integer programming optimization benchmark functions, 10 minimax problems and 10 CEC05 functions. We present the general performance of the proposed algorithm by comparing SPSOAC against 13 benchmark algorithms. The Experiments results show the proposed algorithm is a promising algorithm and has a powerful performance.

Keywords: Particle swarm optimization; Genetic algorithm; Arithmetical crossover; Nelder-Mead method; Integer programming problems; Minimax problems (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s12597-016-0256-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:53:y:2016:i:4:d:10.1007_s12597-016-0256-7

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-016-0256-7

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().