A discrete gravitational search algorithm for solving combinatorial optimization problems
From MaRDI portal
Recommendations
- Direct Gravitational Search Algorithm for Global Optimisation Problems
- GSA: A gravitational search algorithm
- BGSA: Binary gravitational search algorithm
- Gravitational search algorithm combined with chaos for unconstrained numerical optimization
- Application of imperialist competitive algorithm on solving the traveling salesman problem
Cites work
- scientific article; zbMATH DE number 23663 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1054956 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1082099 (Why is no real title available?)
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- scientific article; zbMATH DE number 2064412 (Why is no real title available?)
- A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem
- A probabilistic heuristic for a computationally difficult set covering problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Chained Lin-Kernighan for large traveling salesman problems
- Computer Solutions of the Traveling Salesman Problem
- Expanding neighborhood GRASP for the traveling salesman problem
- Fast Algorithms for Geometric Traveling Salesman Problems
- GSA: A gravitational search algorithm
- Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
- Metaheuristics in combinatorial optimization
- Metaheuristics. From design to implementation.
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Optimization by simulated annealing
- Outline for a Logical Theory of Adaptive Systems
- Stochastic local search. Foundations and applications.
- TSPLIB—A Traveling Salesman Problem Library
- The \(\text{P}=\text{NP}\) question and Gödel's lost letter
- Variable neighborhood search
Cited in
(7)- Spatial-domain fitness landscape analysis for combinatorial optimization
- Direct Gravitational Search Algorithm for Global Optimisation Problems
- Putting continuous metaheuristics to work in binary search spaces
- Fuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization
- scientific article; zbMATH DE number 6263344 (Why is no real title available?)
- GKRR: a gravitational-based kernel ridge regression for software development effort estimation
- Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem
This page was built for publication: A discrete gravitational search algorithm for solving combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498096)
