Adaptive learning search, a new tool to help comprehending metaheuristics

International Journal on Artificial Intelligence Tools

Volumn 16, Issue 3, 2007, Pages 483-505

  Dréo, Johann ^a   Aumasson, Jean Philippe ^b   Tfaili, Walid ^a   Siarry, Patrick ^a  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^b EPFL   (Switzerland)

Author keywords

Ant colony algorithm; Estimation of distribution; Evolutionary algorithm; Hard optimization; Metaheuristics; Optimization framework; Performance assessment; Simulated annealing; Software

Indexed keywords

COMPUTER SOFTWARE; FUNCTION EVALUATION; HEURISTIC ALGORITHMS; OPTIMIZATION;

ANT COLONY ALGORITHM; ESTIMATION OF DISTRIBUTION; HARD OPTIMIZATION; METAHEURISTICS; OPTIMIZATION FRAMEWORK; PERFORMANCE ASSESSMENT;

LEARNING SYSTEMS;

EID: 34250316155     PISSN: 02182130     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218213007003370     Document Type: Article

References (56)

1. E. H. L. Aarts and P. J. M. Van Laarhoven. Statistical cooling : a general approach to combinatorial optimisation problems. Philips Journal of Research, 40:193-226, 1985.
2. S. Baluja. Population-based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning. Technical Report CMU-CS-94-163, Carnegie Mellon University, 1994.
3. S. Baluja. Genetic Algorithms and Explicit Search Statistics. Advances in Neural Information Processing Systems, 9:319-325, 1997.
4. S. Baluja and R. Caruana. Removing the Genetics from the Standard Genetic Algorithm. In A. Prieditis and S. Russel, editors, International Conference on Machine Learning, pages 38-46, Lake Tahoe, California, 1995. Morgan Kaufmann.
5. S. Baluja and S. Davies. Fast probabilistic modeling for combinatorial optimization. In Fifteenth National Conference on Artificial Intelligence, Tenth Conference on Innovative Applications of Artificial Intelligence, Madison, Wisconsin, 1998.
6. P. A. N. Bosman and D. Thierens. An algorithmic framework for density estimation based evolutionary algorithm. Technical Report UU-CS-1999-46, Utrech University, 1999.
7. P.A.N. Bosman and D. Thierens. Continuous iterated density estimation evolutionary algorithms within the IDEA framework. In M. Muehlenbein and A.O. Rodriguez, editors, Proceedings of the Optimization by Building and Using Probabilistic Models OBUPM Workshop at the Genetic and Evolutionary Computation Conference GECCO-SOOO, pages 197-200, San Francisco, California, 2000. Morgan Kauffmann.
8. P.A.N. Bosman and D. Thierens. IDEAs based on the normal kernels probability density function. Technical Report UU-CS-2000-11, Utrecht University, 2000.
9. V. Cerny. Thermodynamical approach to the traveling salesman problem : an efficient simulation algorithm. J. of Optimization Theory and Applications, 45(1):41-51, 1985.
10. A. Colorni, M. Dorigo, and V. Maniezzo. Distributed Optimization by Ant Colonies. In F. Varela. and P. Bourgine, editors, Proceedings of ECAL'91 - First European Conference on Artificial Life, pages 134-142, Paris, France, 1992. Elsevier Publishing.
11. M. Creutz. Microcanonical Monte Carlo simulation. Physical Review Letters, 50(19):1411-1414, May 1983.
12. P. M. C. De Oliveira. Broad Histogram : An Overview, arxiv :cond-mat/00000v1, 2000.
13. K. Deb and P. N. Suganthan. Special Session on Real-Parameter Optimization. In IEEE Congress on Evolutionary Computation, September 2005.
14. R. Dorne and C. Voudouris. Metaheuristics: computer decision-making, chapter HSF: the iOpt's framework to easily design metaheuristic methods, pages 237-256. Kluwer Academic Publishers, Norwell, MA, USA, 2004.
15. J. Dréo, J.-Ph. Aumasson, and W. Tfaili. Open Metaheuristics. http://ometah.berlios.de, 2005.
16. J. Dréo, J.-C. Nunes, and P. Siarry. Robust rigid registration of retinal angiograms through optimization. Computerized Medical Imaging and Graphics, to appear, 2007. DOI: 10.1016/j.compmedimag.2006.07.004.
17. J. Dréo, J.C. Nunes, P. Truchetet, and P. Siarry. Retinal angiogram registration by estimation of distribution algorithm. In 6th IFAC Symposium on Modelling and Control in Biomedical Systems (IFAC 2006), 2006.
18. J. Dréo, A. Pétrowski, P. Siarry, and É. D. Taillard. Metaheuristics for hard optimization. Springer, 2006.
19. J. E. Eiben, A. E. Smith. Introduction to Evolutionary Computing. Springer Verlag, 2003.
20. A. M. Ferrenberg and R. H. Swendsen. Optimized Monte Carlo Data Analysis. Physical Review Letters, 63:1195, 1989.
21. A. Fink and S. Voß. Generic metaheuristics application to industrial engineering problems. Computers and Industrial Engineering, 37(1-2):281-284, 1999.
22. L. J. Fogel, A. J. Owens, and M. J. Walsh. Artifical Intelligence through Simulated Evolution. Wiley, 1966.
23. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley Professional Computing Series. Addison Wesley Professional, 1994.
24. Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides. Design patterns: Abstraction and reuse of object-oriented design. Lecture Notes in Computer Science, 707:406-431, 1993.
25. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine learning. Addison-Wesley, 1989.
26. G. Harik. Linkage learning in via probabilistic modeling in the EcGA. Technical Report 99010, IlliGAL, 1999.
27. G. Harik, F. G. Lobo, and D. E. Goldberg. The compact genetic algorithm. In IEEE Conference on Evolutionary Computation, pages 523-528, 1998.
28. W. K. Hastings. Monte Carlo sampling method using Markov chains and their applications. Biometrika, 57, 1970.
29. J. H. Holland. Outline for logical theory of adaptive systems. J. Assoc. Comput. Mach., 3:297-314, 1962.
30. K. Hukushima and K Nemoto. Exchange Monte Carlo method and application to spin glass simulations. Journal of the Physical Society of Japan, 65:1604-1608, 1996.
31. Y. Iba. Population Annealing: An approach to finite-temperature calculation. In Joint Workshop of Hayashibaru Foundation and SMAPIP. Hayashibara Forum, 2003.
32. M. Jenkinson and S. Smith. A global optimisation method for robust affine registration of brain images. Medical Image Analysis, 5:143-156, 2001.
33. M. Jones. An Object-Oriented Framework for the Implementation of Search Techniques. PhD thesis, University of East Anglia, 2000.
34. Maarten Keijzer, J. J. Merelo, G. Romero, and Marc Schoenauer. Evolving objects: A general purpose evolutionary computation library. In Artificial Evolution, pages 231-244, 2001.
35. J. Kertesz and I. Kondor, editors. Advances in Computer Simulation, chapter Introduction To Monte Carlo Algorithms. Springer-Verlag, 1998.
36. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi. Optimization by simulated annealing. Science, 220(4598):671-680, 1983.
37. P. Larrañaga and J.A. Lozano, editors. Estimation of Distribution Algorithms, A New Tool for Evolutionary Computation. Genetic Algorithms and Evolutionary Computation. Kluwer Academic Publishers, 2002.
38. pModel Sampling and Change Point Theorem. Statistica Sinica, 10, 2000.
39. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21:1087-1092, 1953.
40. N. Monmarché, E. Ramat, G. Dromel, M. Slimane, and G. Venturini. On the similarities between AS, BSC and PBIL: toward the birth of a new meta-heuristics. E3i 215, Université de Tours, 1999.
41. N. Monmarché, N. Ramat, L. Desbarat, and G. Venturini. Probabilistic search with genetic algorithms and ant colonies. In A.S. Wu, editor, Proceedings of the 2000 Genetic and Evolutionary Computation Conference Workshop, pages 209-211, 2000.
42. H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions I. Binary parameters. Lecture Notes in Computer Science 1411: Parallel Problem Solving from Nature, PPSN IV:178-187, 1996.
43. J. A. Nelder and R. Mead. A simplex method for function minimization. Computer Journal, 7:308-313, 1965.
44. M. E. J. Newman and R. G. Palmer. Error estimation in the histogram Monte Carlo method. arxiv:cond-mat/98043006, 1998.
45. Y Okamoto and U. H. E. Hansmann. Thermodynamics of helix-coil transitions studied by multicanonical algorithms. Journal Physical Chemistry, 99:11276-11287, 1995.
46. I. Rechenberg. Cybernetic Solution Path of an Experimental Problem. Royal Aircraft Establishment Library Translation, 1965.
47. M.G.C. Resende. Greedy randomized adaptive search procedures (GRASP). Technical Report TR 98.41.1, AT&T Labs-Research, 2000.
48. N. Ritter, R. Owens, J. Cooper, R. H. Eikelboom, and P. P. V. Saarloos. Registration of stereo and temporal images of the retina. IEEE Trans. On Medical Imaging, 18:404-418, 1999.
49. J. Rumbaugh, I. Jacobson, and G. Booch. The Unified Modeling Language Reference Manual. Addison-Wesley, 1999.
50. G. Syswerda. Simulated Crossover in Genetic Algorithms. In L. D. Whitley, editor, Second workshop on Foundations of Genetic Algorithms, pages 239-255, San Mateo, California, 1993. Morgan Kaufmann.
51. É. D. Taillard. A statistical test for comparing success rates. In Metaheuristic international conference MIC'03, Kyoto, Japan, August 2003.
52. E. D. Taillard, L. M. Gambardella, M. Gendreau, and J.-Y. Potvin. Adaptive Memory Programming: A Unified View of Meta-Heuristics. European Journal of Operational Research, 135(1): 1-16, 1998.
53. E. Triki, Y. Collette, and P. Siarry. A theoretical study on the behavior of simulated annealing leading to a new cooling schedule. European Journal of Operational Research, 166:77-92, 2005.
54. D. Tschumperlé. Cimg library. Available at http://cimg. sourceforge.net/, 2005.
55. S. Voß and D. L. Woodruff. Optimization Software Class Libraries. OR/CS Interfaces Series. Kluwer, Dordrecht, 2002.
56. O. Wendt and W. König. Cooperative Simulated Annealing: How Much Cooperation is Enough ? Technical Report 97-19, Institute of Information Systems, Goethe University, Frankfurt, 1997.