A hybrid simplex search and particle swarm optimization for unconstrained optimization
From MaRDI portal
Publication:877028
DOI10.1016/j.ejor.2006.06.034zbMath1121.90116OpenAlexW1978740922MaRDI QIDQ877028
Publication date: 19 April 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.034
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A novel evolutionary optimization algorithm inspired in the intelligent behaviour of the hunter spider ⋮ Asynchronous parallel hybrid optimization combining DIRECT and GSS ⋮ An effective multi-objective particle swarm optimization for the multi-item capacitated lot-sizing problem with set-up times and backlogging ⋮ A continuous bi-level model for the expansion of highway networks ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ Global optimization algorithm for sum of generalized polynomial ratios problem ⋮ Hyperparameter autotuning of programs with HybridTuner ⋮ Particle swarm optimization: Hybridization perspectives and experimental illustrations ⋮ The block diagram method for designing the particle swarm optimization algorithm ⋮ Parameter sensitivity study of the Nelder-Mead simplex method ⋮ A poly-hybrid PSO optimization method with intelligent parameter adjustment ⋮ Cellular particle swarm optimization ⋮ A hybrid biogeography‐based optimization with simplex method and its application ⋮ A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem -- a case study on supply chain model ⋮ A general model for meta-heuristic algorithms using the concept of fields of forces ⋮ Niching particle swarm optimization with equilibrium factor for multi-modal optimization ⋮ Wolf pack algorithm for unconstrained global optimization ⋮ Solving unconstrained global optimization problems via hybrid swarm intelligence approaches ⋮ Hybridizing local search algorithms for global optimization ⋮ Solving bi-level linear programming problem through hybrid of immune genetic algorithm and particle swarm optimization algorithm ⋮ \(\theta\)-PSO: a new strategy of particle swarm optimization ⋮ Directed particle swarm optimization with Gaussian-process-based function forecasting ⋮ Parallel two-phase methods for global optimization on GPU ⋮ A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem ⋮ A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization ⋮ Tuning BARON using derivative-free optimization algorithms ⋮ Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach ⋮ A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization ⋮ An improved central force optimization algorithm for multimodal optimization
Uses Software
Cites Work
- Unnamed Item
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
- `` Direct Search Solution of Numerical and Statistical Problems
- Testing Unconstrained Optimization Software
- The Nelder-Mead Simplex Procedure for Function Minimization
- Nelder-Mead Simplex Modifications for Simulation Optimization
- A Simplex Method for Function Minimization
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
