Abstract
The aim of this paper is to summarize the principles and the applications of the noising methods, a recent family of combinatorial optimization metaheuristics. We describe their commons features and their variants and we give the list of their applications to different combinatorial optimization problems. We also show how the simulated annealing algorithm and the threshold accepting algorithm can be considered as noising methods when the components of the noising methods are properly chosen.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E.H.L. Aarts and J.K. Lenstra (editors). Local Search in Combinatorial Optimization. Wiley, 1997.
B. Alidaee. Experimental Design for Combinatorial Optimization Problems. Presented at INFORMS New Orleans 1995, New Orleans, 1995.
B. Alidaee, M. Amini, and G.A. Kochenberger. Hybrid Metaheuristic Approaches to the Multi-Resource Generalized Assignment Problem: a Case Study of Tabu Search, Space Smoothing, and Noising Methods. 2nd Meta-heuristics International Conference (MIC-97), page 131, Sophia-Antipolis, 1997.
B. Alidaee, J.T. Naidu, and E.L. Gillenwater. Heuristic Algorithms for Multiple Machine Scheduling with the Objective of Minimizing Total Weighted and Unweighted Tardiness. Presented at INFORMS Dallas 1997, Dallas, 1997.
I. Althöfer and K.-U. Koschnick. On the Convergence of “Threshold Accepting”. Applied Mathematics and Optimization, 24:183–195, 1991.
M.M. Amini, B. Alidaee, and M.J. Racer. Alternative Metaheuristics Approaches to the Multi-Resource Generalized Assignement Problem. Presented at INFORMS Dallas 1997, Dallas, 1997.
G. Bogdanova. Optimal Codes Over an Alphabet of 4 Elements. Proceedings of the Fifth International Workshop on Algebraic and Combinatorial Coding Theory, pages 46–53, Sozopol, 1996.
P. Boucher and G. Plateau. Étude des méthodes de bruit age appliquées au problème du sac à dos à plusieurs contraintes en variables 0–1. Actes des 5es Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC’99), pages 151–162, Lyon, 1999.
S.A. Canuto, C.C. Ribeiro, and M.G.C. Resende. Local Search with Perturbations for the Prize-Collecting Steiner Tree Problem. To appear in: Networks.
I. Charon and O. Hudry. The Noising Method: A New Combinatorial Optimization Method. Operations Research Letters, 14:133–137, 1993.
I. Charon and O. Hudry. An Application of the Noising Method to MCDA. Abstracts of the 14th European Conference of Operations Research, page 15, Jerusalem, 1995.
I. Charon and O. Hudry. Mixing Different Components of Metaheuristics. In: Metaheuristics: Theory and Applications, I.H. Osman and J.P. Kelly, editors, pages 589–603, Kluwer, 1996.
I. Charon and O. Hudry. Lamarckian Genetic Algorithms Applied to the Aggregation of Preferences. Annals of Operations Research, 80:281–297, 1998.
I. Charon and O. Hudry. Variations on the Noising Schemes for a Clustering Problem. Extended Abstracts of the Third Metaheuristics International Conference, pages 147–150, Angra dos Reis, 1999.
I. Charon and O. Hudry. Noising Methods for a Clique Partitioning Problem. Submitted for publication.
I. Charon and O. Hudry. Application of the Noising Method to the Travelling Salesman Problem. European Journal of Operational Research, 125:266–277, 2000.
I. Charon and O. Hudry. A Branch and Bound Algorithm to Solve the Linear Ordering Problem for Weighted Tournaments. To appear in: Discrete Applied Mathematics.
I. Charon and O. Hudry. Automatic Tuning of the Noising Methods. Submitted for publication.
I. Charon and O. Hudry. Descent with Mutations for the Aggregation of Relations. Submitted for publication.
I. Charon, O. Hudry, and A. Lobstein. A New Method for Constructing Codes. Proceedings of the 4th International Workshop on Algebraic and Combinatorial Coding Theory, pages 62–65, Novgorod, 1994.
I. Charon, O. Hudry, and A. Lobstein. Application of the Noising Methods to Coding Theory. Abstracts of the 14th Triennial Conference of the International Federation of Operational Research Societies, page 174, Vancouver, 1996.
W.-H. Chen and C.-S. Lin. A Hybrid Heuristic to Solve a Task Allocation Problem. Computers and Operations Research, 27:287–303, 2000.
K.A. Dowsland. Simulated Annealing. In: Modern Heuristic Techniques for Combinatorial Problems, C. Reeves, editor, pages 20–69, McGraw-Hill, 1995.
G. Dueck and T. Scheurer. Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing. Journal of Computational Physics, 90:161–175, 1990.
G. Dueck and J. Wirsching. Threshold Accepting Algorithms for Multi-Constraint 0–1 Knapsack Problems. Technical Paper TR 89 10 016, IBM Heidelberg Scientific Center, 1989.
A. Fréville, S. Hanafi, and A. El Abdellaoui. Noising Method for the 0–1 Multidimensional Knapsack Problem. Premierès rencontres francophones de recherche opérationelle, page 53, Mons, 1995.
D. Guillaume and F. Murtagh. An Application of XML and XLink using a Graph-Partitioning Method and a Density Map for Information Retrieval and Knowledge Discovery. In: Astronomical Data Analysis Software and Systems VIII, D.M. Mehringer, R.L. Plante, and D.A. Roberts, editors, pages 278–282, 1999.
D. Guillaume and F. Murtagh. Clustering of XML Documents. To appear in: Computer Physics Communications.
S. Hanafi, A. Fréville, and A. El Abdellaoui. Comparison of Heuristics for the 0–1 Multidimensional Knapsack Problem. In: Metaheuristics: Theory and Applications, I.H. Osman and J.P. Kelly, editors, pages 449–465, Kluwer, 1996.
C.-P. Hwang. Global and Local Search Heuristics for the Symmetric Travelling Salesman Problems. PhD Thesis, University of Mississippi, 1996.
C.-P. Hwang, B. Alidaee, and J.D. Johnson. A Tour Construction Heuristic for the Travelling Salesman Problem. Journal of the Operational Research Society, 50:797–809, 1999.
S.H. Jacobson, K.A. Sullivan, and A.W. Johnson. Discrete Manufacturing Process Design Optimization using Computer Simulation and Generalized Hill Climbing Algorithms. Engineering Optimization, 31:247–260, 1998.
A.W. Johnson and S.H. Jacobson. On the Convergence of Generalized Hill Climbing Algorithms. Submitted for publication.
R.B. Kethley. Single and Multiple Machine Scheduling to Minimize Total Weighted Late Work: An Empirical Comparison of Scheduling Rules, Algorithms and Meta-Heuristics using Taguchi Loss Functions. PhD Thesis, University of Mississippi, 1997.
J. Naidu, B. Alidaee, and E. Gillenwater. Heuristic Approaches to Minimize Tardiness Problems on Single Machine with Sequence Dependent Set-Up Times. Presented at INFORMS Dallas 1997, Dallas, 1997.
I.H. Osman and J.P. Kelly (editors). Metaheuristics: Theory and Applications. Kluwer, 1996.
C. Reeves (editor). Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill, 1995.
V. Sudhakar and C. Siva Ram Murthy. A Modified Algorithm for the Graph Partitioning Problem. Integration, the VLSI Journal, 22:101–113, 1997.
S. Voss, S. Martello, I.H. Osman, and C. Roucairol (editors). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, 1998.
F. Yvon. Prononcer par analogic motivation, formalisation et évaluation. Ph.D. Thesis, ENST, Paris, 1996.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Charon, I., Hudry, O. (2002). The Noising Methods: A Survey. In: Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1507-4_12
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1507-4_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5588-5
Online ISBN: 978-1-4615-1507-4
eBook Packages: Springer Book Archive