Randomized gravitational emulation search algorithm for symmetric traveling salesman problem

DOI10.1016/J.AMC.2007.03.019zbMath1193.90176OpenAlexW1978580158MaRDI QIDQ990542

S. Raja Balachandar, K. Kannan

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.03.019

zbMATH Keywords

velocityswappinggravitational forceNewton's lawsymmetric traveling salesman problem

Mathematics Subject Classification ID

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

Related Items (1)

An efficient meta-heuristic algorithm for grid computing

Uses Software

• TSPLIB
• VRP

Cites Work

• Unnamed Item
• The vehicle routing problem: An overview of exact and approximate algorithms
• Optimizing tabu list size for the traveling salesman problem
• Genetic algorithms and traveling salesman problems
• Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study
• Tabu search performance on the symmetric travelling salesman problem
• Genetic algorithm crossover operators for ordering applications
• Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
• Genetic algorithms for the traveling salesman problem
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Randomized gravitational emulation search algorithm for symmetric traveling salesman problem