The noising methods: A generalization of some metaheuristics

DOI10.1016/S0377-2217(00)00305-2zbMath1063.90042OpenAlexW2012071970MaRDI QIDQ5954829

Olivier Hudry, Irène Charon

Publication date: 2001

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00305-2

zbMATH Keywords

Combinatorial optimizationSimulated annealingMetaheuristicsLocal search methodsNoising methodsThreshold accepting

Mathematics Subject Classification ID

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

Related Items (20)

A three-phased local search approach for the clique partitioning problem ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ An efficient local search with noising strategy for Google machine reassignment problem ⋮ Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ Initialization of metaheuristics: comprehensive review, critical analysis, and research directions ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem ⋮ A survey on optimization metaheuristics ⋮ Solving the multi-objective nurse scheduling problem with a weighted cost function ⋮ Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics ⋮ New identifying codes in the binary Hamming space ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Enhanced savings calculation and its applications for solving capacitated vehicle routing problem ⋮ Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations ⋮ Solving probabilistic multi-facility Weber problem by vector quantization ⋮ Self-tuning of the noising methods ⋮ A tabu search approach for the minimum sum-of-squares clustering problem ⋮ Variable Neighborhood Search for Google Machine Reassignment problem ⋮ Application of the noising method to the travelling salesman problem

Uses Software

• TSPLIB
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• On the convergence of ``threshold accepting
• 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
• A hybrid heuristic to solve a task allocation problem
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• Noising methods for a clique partitioning problem
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• A tour construction heuristic for the travelling salesman problem
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Self-tuning of the noising methods
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• TSPLIB—A Traveling Salesman Problem Library
• A modified noising algorithm for the graph partitioning problem
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: The noising methods: A generalization of some metaheuristics