Self-tuning of the noising methods

DOI10.1080/02331930902944911zbMath1189.90105OpenAlexW2088508248MaRDI QIDQ3646090

Irène Charon, Olivier Hudry

Publication date: 19 November 2009

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930902944911

zbMATH Keywords

automatic tuningcombinatorial optimizationmetaheuristicssimulated annealingnoising methodsthreshold accepting algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (6)

A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ A survey on optimization metaheuristics ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Noising methods for a clique partitioning problem ⋮ The noising methods: A generalization of some metaheuristics ⋮ Application of the “descent with mutations” metaheuristic to a clique partitioning problem

Cites Work

• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• The median procedure in cluster analysis and social choice theory
• General local search methods
• The noising method: A new method for combinatorial optimization
• Lamarckian genetic algorithms applied to the aggregation of preferences
• Clustering of XML documents
• Application of the noising method to the travelling salesman problem
• NP-hardness results for the aggregation of linear orders into median orders
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• Noising methods for a clique partitioning problem
• A survey on the linear ordering problem for weighted or unweighted tournaments
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• TSPLIB—A Traveling Salesman Problem Library
• A modified noising algorithm for the graph partitioning problem
• Metaheuristics for Hard Optimization
• Computer Solutions of the Traveling Salesman Problem
• Handbook of metaheuristics
• The noising methods: A generalization of some metaheuristics

This page was built for publication: Self-tuning of the noising methods