An Efficient Algorithm for Unconstrained Optimization

الملخص EN

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.