Low discrepancy initialized particle swarm optimization for solving constrained optimization problems

DOI10.3233/FI-2009-162MaRDI QIDQ3400564zbMATH OpenFDO

Authors Millie Pant, Radha Thangaraj, Ajith Abraham

Publication date 5 February 2010

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

Particle Swarm OptimizationVander Corput sequenceConstrained Optimization ProblemsQuasi Random

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• AI 2005: Advances in Artificial Intelligence
• Constrained optimization with an improved particle swarm optimization algorithm
• An improved particle swarm optimization algorithm for solving constrained optimization problems
• An improved particle swarm optimization to settle a nonlinear constrained optimality problem
• scientific article; zbMATH DE number 5667506

Cited in

(3)

• A highly accurate differential evolution–particle swarm optimization algorithm for the construction of initial value problem solvers
• Methods for improving the efficiency of swarm optimization algorithms. A survey
• Studying the effect of using low-discrepancy sequences to initialize population-based optimization algorithms

This page was built for publication: Low discrepancy initialized particle swarm optimization for solving constrained optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400564)