The noising methods: A generalization of some metaheuristics

DOI10.1016/S0377-2217(00)00305-2zbMATH Open1063.90042OpenAlexW2012071970MaRDI QIDQ5954829FDOQ5954829

Authors: Irène Charon, Olivier Hudry 

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

Recommendations

• The noising methods: A survey
• Self-tuning of the noising methods
• Application of the noising method to the travelling salesman problem
• The noising method: A new method for combinatorial optimization
• scientific article; zbMATH DE number 1054957

zbMATH Keywords

Combinatorial optimizationSimulated annealingMetaheuristicsThreshold acceptingLocal search methodsNoising methods

Mathematics Subject Classification ID

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

Cites Work

• TSPLIB—A Traveling Salesman Problem Library
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• General local search methods
• A hybrid heuristic to solve a task allocation problem
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Noising methods for a clique partitioning problem
• Computer Solutions of the Traveling Salesman Problem
• Title not available (Why is that?)
• Lamarckian genetic algorithms applied to the aggregation of preferences
• The noising method: A new method for combinatorial optimization
• Self-tuning of the noising methods
• On the convergence of ``threshold accepting
• Title not available (Why is that?)
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Application of the noising method to the travelling salesman problem
• Clustering of XML documents
• Title not available (Why is that?)
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• A modified noising algorithm for the graph partitioning problem
• Title not available (Why is that?)
• A tour construction heuristic for the travelling salesman problem
• Title not available (Why is that?)

Cited In (24)

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

Uses Software

• TSPLIB
• Tabu search

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

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