Biogeography-based optimization for constrained optimization problems
From MaRDI portal
Publication:339689
DOI10.1016/j.cor.2012.04.012zbMath1349.90847OpenAlexW2072601275MaRDI QIDQ339689
Amitava Chatterjee, Patrick Siarry, Ilhem Boussaïd, Mohamed Ahmed-Nacer
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.012
Nonlinear programming (90C30) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Enhancing the performance of biogeography-based optimization using polyphyletic migration operator and orthogonal learning ⋮ Emergency railway wagon scheduling by hybrid biogeography-based optimization ⋮ Ecogeography-based optimization: enhancing biogeography-based optimization with ecogeographic barriers and differentiations ⋮ Water wave optimization: a new nature-inspired metaheuristic ⋮ Introduction of biogeography-based programming as a new algorithm for solving problems ⋮ Enhancing the performance of biogeography-based optimization using multitopology and quantitative orthogonal learning ⋮ Novel biogeography-based optimization algorithm with hybrid migration and global-best Gaussian mutation ⋮ A memetic differential evolution algorithm based on dynamic preference for constrained optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Two-stage update biogeography-based optimization using differential evolution algorithm (DBBO)
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- A real-coded biogeography-based optimization with mutation
- Test examples for nonlinear programming codes
- A collection of test problems for constrained global optimization algorithms
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- An efficient constraint handling method for genetic algorithms
- The development of a changing range genetic algorithm