Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems

DOI10.1007/s12597-016-0256-7zbMath1360.90310OpenAlexW2312556230MaRDI QIDQ522420

Yong-Cai Geng, Sumit K. Garg

Publication date: 28 April 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-016-0256-7

zbMATH Keywords

minimax problemsgenetic algorithmparticle swarm optimizationNelder-Mead methodarithmetical crossoverinteger programming problems

Mathematics Subject Classification ID

Integer programming (90C10) Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Multi-directional bat algorithm for solving unconstrained optimization problems

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms with adaptive smoothing for finite minimax problems
• PID control for chaotic synchronization using particle swarm optimization
• Minimax and applications
• Memetic particle swarm optimization
• Nonlinear programming using minimax techniques
• Solving minimax problems by interval methods
• A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
• Branch-and-Bound Methods: A Survey
• A Simplex Method for Function Minimization
• Smoothing method for minimax problems

This page was built for publication: Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems