Self-tuning of the noising methods

Optimization

Volumn 58, Issue 7, 2009, Pages 823-843

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

^a INSTITUT TELECOM   (France)

Author keywords

Automatic tuning; Combinatorial optimization; Metaheuristics; Noising methods; Simulated annealing; Threshold accepting algorithms

Indexed keywords

EID: 76849090836     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331930902944911     Document Type: Article

References (47)

1. E.H.L. Aarts and J.K. Lenstra, Local Search in Combinatorial Optimization, Wiley, New York, 1997.
2. J.-P. Barthélemy and B. Leclerc, The median procedure for partitions, DIMACS Series in Discrete Math. Theor. Comput. Sci. 19 (1995), pp. 3-34.
3. J.-P. Barthelemy and B. Monjardet, The median procedure in cluster analysis and social choice theory, Math. Soc. Sci. 1 (1981), pp. 235-267.
4. E. Bonomi and J.-L. Lutton, The N-city travelling salesman problem: Statistical mechanics and the Metropolis algorithm, SIAM Rev. 26 (1984), pp. 551-568.
5. I. Charon and O. Hudry, The noising method: A new combinatorial optimization method, Oper. Res. Lett. 14 (1993), pp. 133-137.
6. I. Charon and O. Hudry, Mixing different components of metaheuristics, in Metaheuristics: Theory and Applications, I.H. Osman and J.P. Kelly, eds., Kluwer Academic Publishers, Boston, 1996, pp. 589-603.
7. I. Charon and O. Hudry, Lamarckian genetic algorithms applied to the aggregation of preferences, Ann. Oper. Res. 80 (1998), pp. 281-297.
8. I. Charon and O. Hudry, Application of the noising method to the Travelling Salesman Problem, Eur. J. Oper. Res. 125/2 (2000), pp. 266-277.
9. I. Charon and O. Hudry, The noising methods: A generalization of some metaheuristics, Eur. J. Oper. Res. 135(1) (2001), pp. 86-101.
10. I. Charon and O. Hudry, The noising methods: A survey, in Essays and Surveys in Metaheuristics, P. Hansen and C.C. Ribeiro, eds., Kluwer Academic Publishers, Boston, 2002, pp. 245-261.
11. I. Charon and O. Hudry, Noising methods for a clique partitioning problem, Discrete Appl. Math. 154(5) (2006), pp. 754-769.
12. I. Charon and O. Hudry, A branch and bound algorithm to solve the linear ordering problem for weighted tournaments, Discrete Appl. Math. 154 (2006), pp. 2097-2116.
13. I. Charon and O. Hudry, A survey on the linear ordering problem for weighted or unweighted tournaments, 4OR 5(1) (2007), pp. 5-60.
14. I. Charon and O. Hudry, Proceedings of 2007 IEEE International Conference on Research, Innovation and Vision for the Future, Proceedings of the Institute of Electrical and Electronics Engineers, Application of the 'Descent with Mutations' metaheuristic to a clique partitioning problem, 2007, Vietnam, pp. 29-35.
15. K.A. Dowsland, Simulated annealing, in Modern Heuristic Techniques for Combinatorial Problems, C. Reeves, ed., McGraw-Hill, London, 1995, pp. 20-69.
16. J. Dréo, A. Pétrowski, É. Taillard, and P. Siarry, Metaheuristics for Hard Optimization, Methods and Case Studies, Springer, Berlin, 2006.
17. G. Dueck and T. Scheurer, Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, J. Comput. Phys. 90 (1990), pp. 161-175.
18. G. Dueck and J. Wirsching, Threshold accepting algorithms for multi-constraint 0-1 knapsack problems, Tech. paper, TR 89 10 016, IBM Heidelberg Scientific Center, Germany, 1989.
19. F.W. Glover and G.A. Kochenberger, Handbook of Metaheuristics, in International Series in Operations Research and Management Science, Kluwer Academic Publishers, Boston, 2003.
20. 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, ASP Conference Ser. 172, ASP, D.M. Mehringer, R.L. Plante, and D.A. Roberts, eds., San Francisco, 1999, pp. 278-282.
21. D. Guillaume and F. Murtagh, Clustering of XML documents, Computer Physics Communications 127 (2000), pp. 215-227.
22. G. Gutin and A.P. Punnen, Traveling Salesman Problem and its Variations, Kluwer, Dordrecht, 2002.
23. P. Hansen and B. Jaumard, Cluster analysis and mathematical programming, Math. Prog. 79 (1997), pp. 191-215.
24. P. Hansen and C.C. Ribeiro, Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, Boston, 2002.
25. H.H. Hoos and T. Stutzle, Stochasti c local search, Foundations and Applications, Morgan Kaufmann/Elsevier, 2004.
26. O. Hudry, NP-hardness results on the aggregation of linear orders into median orders, Annals of Operations Research 163(1) (2008), pp. 63-68.
27. C.-P. Hwang, Global and local search heuristics for the symmetric travelling salesman problems, PhD thesis, University of Mississippi, 1996.
28. C.-P. Hwang, B. Alidaee, and J.D. Johnson, A tour construction heuristic for the travelling salesman problem, J. Oper. Res. Soc. 50 (1999), pp. 797-809.
29. T. Ibaraki, K. Nonobe, and M. Yagiura, Metaheuristics: Progress as real problem solvers, in Operations Research/Computer Science Interfaces, Vol. 32, Springer, Berlin, Heidelberg, New York, 2005.
30. M. Jünger, Polyhedral Combinatorics and the Acyclic Subdigraph Problem, Heldermann Verlag, Berlin, 1985.
31. M. Jünger, G. Reinelt, and G. Rinaldi, The traveling salesman problem, in, in Handbooks in Operations Research and Management Science, Vol. 7: Network Models, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser, eds., Elsevier Science, Amsterdam, 1995, pp. 225-330.
32. G. Laporte and I.H. Osman, Metaheuristics: A bibliography, Ann. Oper. Res. 63 (1996).
33. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Schmoys, The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, John Wiley and Sons, Chichester, 1985.
34. S. Lin, Computer solutions for the travelling salesman problem, Bell Syst. Tech. J. 44 (1965), pp. 2245-2269.
35. I.H. Osman and J.P. Kelly, Meta-heuristics: Theory and applications, Kluwer Academic Publishers, Boston, 1996.
36. D.T. Pham and D. Karaboga, Intelligent optimisation techniques. Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks, Springer, Berlin, 2000.
37. M. Pirlot, General local search methods, Euro. J. Oper. Res. 92(3) (1996), pp. 493-511.
38. C. Reeves, Modern Heuristic Techniques for Combinatorial Problems, McGraw-Hill, London, 1995.
39. S. Régnier, Sur quelques aspects mathématiques des problèmes de classification automatique, in I.C.C. Bulletin, Vol. 4, Rome, 1965.
40. G. Reinelt, The linear ordering problem: Algorithms and applications, in Research and Exposition in Mathematics, Vol. 8, Heldermann Verlag, Berlin, 1985.
41. G. Reinelt, TSPLIB - A traveling salesman problem library, ORSA J. Comput. 3(4) (1991), pp. 376-384 Available at http://www.iwr.uni-heidelberg.de/groups/comopt/soft-ware/TSPLIB95/.
42. M.G.C. Resende and J. Pinho de Sousa, Metaheuristics: Computer Decision-Making, Vol. 86, Kluwer Academic Publishers, Boston, USA, 2003.
43. S. Sait and H. Youssef, Iterative computer algorithms with applications in engineering, IEEE Computer Society Press, 1996.
44. P. Slater, Inconsistencies in a schedule of paired comparisons, Biometrika 48 (1961), pp. 303-312.
45. V. Sudhakar and C. Siva Ram Murthy, A modified algorithm for the graph partitioning problem, Integration, the VLSI J. 22 (1997), pp. 101-113.
46. S. Voss, S. Martello, I.H. Osman, and C. Roucairol, Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, 1998.
47. Y. Wakabayashi, Aggregation of Binary Relations: Algorithmic and Polyhedral Investigations, PhD Thesis, Augsbourg, 1986.