The noising methods: A generalization of some metaheuristics

European Journal of Operational Research

Volumn 135, Issue 1, 2001, Pages 86-101

  Charon, Irène ^a   Hudry, Olivier ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Combinatorial optimization; Local search methods; Metaheuristics; Noising methods; Simulated annealing; Threshold accepting

Indexed keywords

COMBINATORIAL MATHEMATICS; GENETIC ALGORITHMS; GLOBAL OPTIMIZATION; SEARCH ENGINES; THRESHOLD LOGIC;

METAHEURISTICS; NOISING METHODS;

HEURISTIC PROGRAMMING;

EID: 0035900276     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00305-2     Document Type: Article

References (43)

1. Experimental Design for Combinatorial Optimization Problems
2. Hybrid metaheuristic approaches to the multi-resource generalized assignment problem: A case study of tabu search, space smoothing, and noising methods
3. Heuristic algorithms for multiple scheduling with the objective of minimizing total weighted and unweighted tardiness
4. On the convergence of 'threshold accepting'
5. Alternative metaheuristics approaches to the multi-resource generalized assignment problem
6. Optimal codes over an alphabet of four elements
7. The N-city travelling salesman problem: Statistical mechanics and the Metropolis algorithm
8. Étude des méthodes de bruitage appliquées au problème du sac à dos à plusieurs contraintes en variables 0-1
9. Local search with perturbations for the prize-collecting Steiner tree problem
10. The noising method: A new combinatorial optimization method
11. Mixing different components of metaheuristics
12. Lamarckian genetic algorithms applied to the aggregation of preferences
13. Variations on the noising schemes for a clustering problem
14. Application of the noising method to the travelling salesman problem
15. A branch and bound algorithm to solve the linear ordering problem for weighted tournaments
16. A new method for constructing codes
17. Application of the Noising Method to Coding Theory
18. A hybrid heuristic to solve a task allocation problem
19. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
20. Noising method for the 0-1 multidimensional knapsack problem
21. An application of XML and XLink using a graph-partitioning method and a density map for information retrieval and knowledge discovery
22. Clustering of XML documents
23. Comparison of heuristics for the 0-1 multidimensional knapsack problem
24. A tour construction heuristic for the travelling salesman problem
25. New convergence results of generalized hill climbing algorithms
26. Discrete manufacturing process design optimization using computer simulation and generalized hill climbing algorithms
27. Optimization by simulated annealing: An experimental evaluation - Part II (graph coloring and number partitioning)
28. Computer solutions for the travelling salesman problem
29. Heuristic approaches to minimize tardiness problems on single machine with sequence dependent set-up times
30. Metaheuristics: An overview
31. General local search methods
32. TSPLIB - A traveling salesman problem library
33. A modified algorithm for the graph partitioning problem