Application of the noising method to the travelling salesman problem

DOI10.1016/S0377-2217(99)00457-9zbMath0952.90035OpenAlexW2169275881MaRDI QIDQ1580974

Irène Charon, Olivier Hudry

Publication date: 14 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00457-9

zbMATH Keywords

combinatorial optimizationmetaheuristicssimulated annealingtravelling salesman problemnoising method

Mathematics Subject Classification ID

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

Related Items (6)

Automatic clustering using genetic algorithms ⋮ Noising methods for a clique partitioning problem ⋮ The noising methods: A generalization of some metaheuristics ⋮ Self-tuning of the noising methods ⋮ A tabu search approach for the minimum sum-of-squares clustering problem ⋮ Application of the “descent with mutations” metaheuristic to a clique partitioning problem

Uses Software

• TSPLIB

Cites Work

• The noising method: A new method for combinatorial optimization
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• TSPLIB—A Traveling Salesman Problem Library
• Computer Solutions of the Traveling Salesman Problem
• The noising methods: A generalization of some metaheuristics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Application of the noising method to the travelling salesman problem