Application of the noising method to the travelling salesman problem

DOI10.1016/S0377-2217(99)00457-9zbMATH Open0952.90035OpenAlexW2169275881MaRDI QIDQ1580974FDOQ1580974

Authors 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

simulated annealingcombinatorial optimizationmetaheuristicstravelling salesman problemnoising method

Mathematics Subject Classification ID

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

Recommendations

• The noising methods: A survey
• The noising methods: A generalization of some metaheuristics
• The noising method: A new method for combinatorial optimization
• scientific article; zbMATH DE number 1054957
• Self-tuning of the noising methods

Cites work

• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 1082102 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 795217 (Why is no real title available?)
• scientific article; zbMATH DE number 3193293 (Why is no real title available?)
• Computer Solutions of the Traveling Salesman Problem
• TSPLIB—A Traveling Salesman Problem Library
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• The noising method: A new method for combinatorial optimization
• The noising methods: A generalization of some metaheuristics

Cited in

(9)

• The noising methods: A survey
• Application of the ``descent with mutations metaheuristic to a clique partitioning problem
• A noisy Euclidean traveling salesman problem: a computational analysis
• The noising methods: A generalization of some metaheuristics
• Noising methods for a clique partitioning problem
• The noising method: A new method for combinatorial optimization
• A tabu search approach for the minimum sum-of-squares clustering problem
• Automatic clustering using genetic algorithms
• Self-tuning of the noising methods

Describes a project that uses

Uses Software

• TSPLIB

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1580974)