The noising method: A new method for combinatorial optimization

DOI10.1016/0167-6377(93)90023-AzbMath0798.90118OpenAlexW2088490660MaRDI QIDQ1319680

Olivier Hudry, Irène Charon

Publication date: 1 November 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90023-a

zbMATH Keywords

heuristicssimulated annealingNP-hardclique partitioningnoising method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (33)

ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms ⋮ A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem ⋮ Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 ⋮ Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem ⋮ A RNN-based hyper-heuristic for combinatorial problems ⋮ Metaheuristics: A bibliography ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ From fitness landscapes evolution to automatic local search algorithm generation ⋮ Heuristics for a project management problem with incompatibility and assignment costs ⋮ 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 ⋮ Automatic clustering using genetic algorithms ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ A survey on optimization metaheuristics ⋮ Solving the one-dimensional bin packing problem with a weight annealing heuristic ⋮ Solving the multi-objective nurse scheduling problem with a weighted cost function ⋮ Local search with perturbations for the prize-collecting Steiner tree problem in graphs ⋮ Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics ⋮ Consistent neighborhood search for combinatorial optimization ⋮ An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem ⋮ Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ Noising methods for a clique partitioning problem ⋮ The noising methods: A generalization of some metaheuristics ⋮ Models and algorithms for optimising two-dimensional LEGO constructions ⋮ 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 ⋮ Application of the noising method to the travelling salesman problem ⋮ On the convergence of generalized hill climbing algorithms ⋮ Perturbation heuristics for the pickup and delivery traveling salesman problem ⋮ Global and local search algorithms for concave cost transshipment problems ⋮ An efficient tabu search approach for the 0-1 multidimensional knapsack problem

Cites Work

• NP-hard problems in hierarchical-tree clustering
• The median procedure in cluster analysis and social choice theory
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The noising method: A new method for combinatorial optimization