A discrete gravitational search algorithm for solving combinatorial optimization problems

DOI10.1016/j.ins.2013.09.034zbMath1321.90157OpenAlexW2015395371MaRDI QIDQ498096

Mohammad Bagher Dowlatshahi, Mashaallah Mashinchi, Hossein Nezam Abadi 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

zbMATH Keywords

combinatorial optimizationmetaheuristicstraveling salesman problemgravitational search algorithmpath re-linking

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Fuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization, Spatial-domain fitness landscape analysis for combinatorial optimization, Unnamed Item, Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem, Putting continuous metaheuristics to work in binary search spaces

Uses Software

• TSPLIB
• LKH
• Concorde
• DIMACS
• Tabu search
• GSA

Cites Work

• Optimization by Simulated Annealing
• A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem
• Metaheuristics in combinatorial optimization
• A probabilistic heuristic for a computationally difficult set covering problem
• Variable neighborhood search
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• GSA: A gravitational search algorithm
• Expanding neighborhood GRASP for the traveling salesman problem
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• The P=NP Question and Gödel’s Lost Letter
• TSPLIB—A Traveling Salesman Problem Library
• Fast Algorithms for Geometric Traveling Salesman Problems
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• Outline for a Logical Theory of Adaptive Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item