Combining Particle Swarm Optimizer with SQP Local Search for Constrained Optimization Problems
The combining of a General-Purpose Particle Swarm Optimizer (GP-PSO) with Sequential Quadratic Programming (SQP) algorithm for constrained optimization problems has been shown to be highly beneficial to the refinement, and in some cases, the success of finding a global optimum solution. It is shown that the likely difference between leading algorithms are in their local search ability. A comparison with other leading optimizers on the tested benchmark suite, indicate the hybrid GP-PSO with implemented local search to compete along side other leading PSO algorithms.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Swarm Variant for the Schrödinger Solver
This paper introduces application of the Exponentially Averaged Momentum Particle Swarm Optimization (EM-PSO) as a derivative-free optimizer for Neural Networks. It adopts PSO's major advantages such as search space expl…
Mathematical ProofsRobust Particle Swarm Optimizer based on Chemomimicry
A particle swarm optimizer (PSO) loosely based on the phenomena of crystallization and a chaos factor which follows the complimentary error function is described. The method features three phases: diffusion, directed mot…
Hamiltonian Monte Carlo Particle Swarm Optimizer
We introduce the Hamiltonian Monte Carlo Particle Swarm Optimizer (HMC-PSO), an optimization algorithm that reaps the benefits of both Exponentially Averaged Momentum PSO and HMC sampling. The coupling of the position an…
PositionA Particle Swarm Optimization hyper-heuristic for the Dynamic Vehicle Routing Problem
This paper presents a method for choosing a Particle Swarm Optimization based optimizer for the Dynamic Vehicle Routing Problem on the basis of the initially available data of a given problem instance. The optimization a…
A Discrete Particle Swarm Optimizer for the Design of Cryptographic Boolean Functions
A Particle Swarm Optimizer for the search of balanced Boolean functions with good cryptographic properties is proposed in this paper. The algorithm is a modified version of the permutation PSO by Hu, Eberhart and Shi whi…