Multi-directional bat algorithm for solving unconstrained optimization problems

DOI10.1007/s12597-017-0302-0zbMath1391.90642OpenAlexW2587119663MaRDI QIDQ724384

D. Kharzeev

Publication date: 25 July 2018

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-017-0302-0

zbMATH Keywords

global optimizationbat algorithmunconstrained optimization problemsmulti-directional search algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Solving nonlinear systems and unconstrained optimization problems by hybridizing whale optimization algorithm and flower pollination algorithm

Uses Software

• ABC

Cites Work

• Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems
• Particle swarm optimization: Hybridization perspectives and experimental illustrations
• A novel hybrid bat algorithm with harmony search for global numerical optimization
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• Memetic particle swarm optimization
• A New Metaheuristic Bat-Inspired Algorithm
• Firefly Algorithms for Multimodal Optimization
• Direct Search Methods on Parallel Machines
• Direct Gravitational Search Algorithm for Global Optimisation Problems
• Applied Numerical Methods Using MATLAB®

This page was built for publication: Multi-directional bat algorithm for solving unconstrained optimization problems