An Efficient Algorithm for Unconstrained Optimization

Sergio Gerardo de-los-Cobos-Silva, Miguel Ángel Gutiérrez-Andrade, Roman Anselmo Mora-Gutiérrez, Pedro Lara-Velázquez, Eric Alfredo Rincón-García and Antonin Ponsich

Mathematical Problems in Engineering, 2015, vol. 2015, 1-17

Abstract:

This paper presents an original and efficient PSO algorithm, which is divided into three phases: (1) stabilization, (2) breadth-first search, and (3) depth-first search. The proposed algorithm, called PSO-3P, was tested with 47 benchmark continuous unconstrained optimization problems, on a total of 82 instances. The numerical results show that the proposed algorithm is able to reach the global optimum. This work mainly focuses on unconstrained optimization problems from 2 to 1,000 variables.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/178545.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/178545.xml (text/xml)

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:hin:jnlmpe:178545

DOI: 10.1155/2015/178545

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().