An orthogonal-array-based particle swarm optimizer with nonlinear time-varying evolution

DOI10.1016/j.amc.2007.02.096zbMath1193.90221OpenAlexW2077145785MaRDI QIDQ990430

Chia-Ju Wu, Ying-Pin Chang, Chia-Nan Ko

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.02.096

zbMATH Keywords

orthogonal arrayparticle swarm optimizationmulti-dimensional spacenonlinear time-varying evolution

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem ⋮ Multiple strategies based orthogonal design particle swarm optimizer for numerical optimization ⋮ A rank based particle swarm optimization algorithm with dynamic adaptation ⋮ Modified quantum-behaved particle swarm optimization for parameters estimation of generalized nonlinear multi-regressions model based on Choquet integral with outliers ⋮ Reinforcement radial basis function neural networks with an adaptive annealing learning algorithm ⋮ Power minimization of gas transmission network in fully transient state using metaheuristic methods

Cites Work

• Unnamed Item
• Unnamed Item
• An application of swarm optimization to nonlinear programming
• Particle swarm optimization for function optimization in noisy environment
• A particle swarm optimization approach to the nonlinear resource allocation problem
• A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
• Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization

This page was built for publication: An orthogonal-array-based particle swarm optimizer with nonlinear time-varying evolution