A Modified Gravitational Search Algorithm for Discrete Optimization Problem
Explore this paper's citation graph
Summary
The experimental result shows that the FDGSA able to find better solutions and converges faster compared to the Binary Gravitational Search Algorithm.
- Type
- article
- Published
- 2020-02-28
- Cited by
- 4
- References
- 4
- OpenAlex
- https://openalex.org/W97553067
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:15615311
Keywords
Gravitational search algorithm, Gravitation, Algorithm, Computer science, Discrete optimization
References
Cited by
- Scheduling Algorithms in Cloud Computing
- Inverse calculation of demolition robot based on gravitational search algorithm and differential evolution neural network
- Automatic fabric defect detection using optimal Gabor filter based on hybrid beetle antennae search–gravitational search algorithm
- Fast Convergent Gravitational Search Algorithm
Related papers
- Research on Discrete Multi-objective Optimization Problem
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- Multi-objective Optimization Approach to Malfatti's Problem
- Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective
- Hybrid Surrogate-Based Constrained Optimization With a New Constraint-Handling Method
- Approaches Used In Adapting Metaheuristic Optimization Algorithms Developed For Continuous Problems to Discrete Problems
- Multiple-objective optimization for environment development systems
- Scope of stationary multi-objective evolutionary optimization: a case study on a hydro-thermal power dispatch problem
- Necessary Optimality Conditions and a New Approach to Multiobjective Bilevel Optimization Problems