Direct Gravitational Search Algorithm for Global Optimisation Problems

DOI10.4208/eajam.030915.210416azbMath1447.90021OpenAlexW2499749362MaRDI QIDQ5372051

No author found.

Publication date: 23 October 2017

Published in: East Asian Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/eajam.030915.210416a

zbMATH Keywords

direct search methodsminimax problemsgravitational search algorithmNelder-Mead methodinteger programming problems

Mathematics Subject Classification ID

Integer programming (90C10) Nonnumerical algorithms (68W05)

Related Items (1)

Multi-directional bat algorithm for solving unconstrained optimization problems

Uses Software

• ABC
• SDMINMAX
• GSA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms with adaptive smoothing for finite minimax problems
• An improved branch and bound algorithm for mixed integer nonlinear programs
• Minimax and applications
• GSA: A gravitational search algorithm
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• Memetic particle swarm optimization
• Nonlinear programming using minimax techniques
• Solving minimax problems by interval methods
• A New Metaheuristic Bat-Inspired Algorithm
• 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: Direct Gravitational Search Algorithm for Global Optimisation Problems