A discrete gravitational search algorithm for solving combinatorial optimization problems
DOI10.1016/J.INS.2013.09.034zbMATH Open1321.90157OpenAlexW2015395371MaRDI QIDQ498096FDOQ498096
Authors: Mohammad Bagher Dowlatshahi, Mashaallah Mashinchi, Hossein Nezamabadi-Pour 
Publication date: 25 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.09.034
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
combinatorial optimizationmetaheuristicsgravitational search algorithmtraveling salesman problempath re-linking
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- TSPLIB—A Traveling Salesman Problem Library
- Title not available (Why is that?)
- Optimization by simulated annealing
- Title not available (Why is that?)
- Title not available (Why is that?)
- GSA: A gravitational search algorithm
- Expanding neighborhood GRASP for the traveling salesman problem
- Metaheuristics. From design to implementation.
- Variable neighborhood search
- Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
- Title not available (Why is that?)
- Stochastic local search. Foundations and applications.
- A probabilistic heuristic for a computationally difficult set covering problem
- Title not available (Why is that?)
- Chained Lin-Kernighan for large traveling salesman problems
- Title not available (Why is that?)
- Computer Solutions of the Traveling Salesman Problem
- Outline for a Logical Theory of Adaptive Systems
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem
- Fast Algorithms for Geometric Traveling Salesman Problems
- Title not available (Why is that?)
- Metaheuristics in combinatorial optimization
- The \(\text{P}=\text{NP}\) question and Gödel's lost letter
- Title not available (Why is that?)
Cited In (7)
- Fuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization
- Direct Gravitational Search Algorithm for Global Optimisation Problems
- Putting continuous metaheuristics to work in binary search spaces
- GKRR: a gravitational-based kernel ridge regression for software development effort estimation
- Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem
- Title not available (Why is that?)
- Spatial-domain fitness landscape analysis for combinatorial optimization
Uses Software
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)
