A GA-based multiple simulated annealing

2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

Volumn , Issue , 2010, Pages

  Rodríguez Díaz, Francisco Javier ^a   García Martínez, Carlos ^b   Lozano, Manuel ^a  

^a UNIVERSITY OF GRANADA   (Spain)

^b UNIVERSITY OF CÓRDOBA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL STUDIES; HYBRID ALGORITHMS; HYBRID METAHEURISTICS; NEW MODEL; PARALLEL SIMULATED ANNEALING; SEARCH PROCESS;

ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS;

SIMULATED ANNEALING;

EID: 79959418791     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2010.5586472     Document Type: Conference Paper

References (45)

1. S. Kirkpatrick, C. Gelatt Jr, and M. Vecchi, "Optimization by simulated annealing," Sci., vol. 220, no. 4598, pp. 671-680, 1983.
2. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines. John Wiley & Sons, 1989.
3. D. Henderson, S. H. Jacobson, and A. W. Jacobson, "The theory and practice of simulated annealing," in Handbook of Metaheuristics. Kluwer Academic Publishers Group, 2003, pp. 287-319.
4. P. Salamon, P. Sibani, and R. Frost, Facts, Conjectures and Improvements for Simulated Annealing, ser. Monographs on Mathematical Modeling and Computation. SIAM, 2002.
5. T. Bäck, D. Fogel, and Z. Michalewicz, Handbook of Evolutionary Computation. Institute of Physics Publishers, 1997.
6. A. Eiben and J. Smith, Introduction to Evolutionary Computing. Springer-Verlag, 2003.
7. C. García-Martínez and M. Lozano, "Local search based on genetic algorithms," in Advances in Metaheuristics for Hard Optimization, ser. Natural Computing, P. Siarry and Z. Michalewicz, Eds. Springer, 2008, pp. 199-221.
8. M. Lozano, F. Herrera, N. Krasnogor, and D. Molina, "Real-coded memetic algorithms with crossover hill-climbing," Evol. Comput., vol. 12, no. 3, pp. 273-302, 2004.
9. N. Noman and H. Iba, "Accelerating differential evolution using an adaptive local search," IEEE Trans. Evol. Comput., vol. 12, no. 1, pp. 107-125, 2008.
10. C. García-Martínez and M. Lozano, "Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics," Soft Comput., vol. In press, 2009.
11. S. Mahfoud and D. Goldberg, "Parallel recombinative simulated annealing: A genetic algorithm," Parallel Comput., vol. 21, no. 1, pp. 1-28, 1995.
12. B. Li and W. Jiang, "A novel stochastic optimization algorithm," IEEE Trans. Syst., Man, Cybern. B, pp. 193-198, 2000.
13. F.-T. Lin, C.-Y. Kao, and C.-C. Hsu, "Applying the genetic approach to simulated annealing in solving some np-hard problems," IEEE Trans. Syst., Man, Cybern., vol. 23, no. 6, pp. 1752-1767, 1993.
14. D. Thompson and G. Bilbro, "Sample-sort simulated annealing," IEEE Trans. Syst., Man, Cybern. B, vol. 35, no. 3, pp. 625-632, 2005.
15. C. García-Martínez and M. Lozano, "Simulated annealing based on local genetic search," in Proc. of the IEEE Int. Conf. Evolutionary Computation, 2009, pp. 2569-2576.
16. G. Sywerda, "Uniform crossover in genetic algorithms," in Proc. of the Int. Conf. on Genetic Algorithms, J. Schaffer, Ed. Morgan Kaufmann, 1989, pp. 2-9.
17. D. Whitley, "The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best," in Proc. of the Int. Conf. on Genetic Algorithms, J. Schaffer, Ed. Morgan Kaufmann, 1989, pp. 116-121.
18. D. J. Ram, T. Sreenivas, and K. G. Subramaniam, "Parallel simulated annealing algorithms," Journal of Parallel and Distributed Computing, vol. 37, pp. 207-212, 1996.
19. K. Kurbel, B. Schneider, and K. Singh, "Solving optimization problems by parallel recombinative simulatedannealing on a parallel computer-an application to standard cellplacement in vlsi design," Systems, Man and Cybernetics, Part B, IEEE Transactions on, vol. 28, no. 3, pp. 454-461, 1998.
20. T. Jones, "Crossover, macromutation, and population-based search," in Proc. of the Sixth Int. Conf. on Genetic Algorithms, L. Eshelman, Ed. Morgan Kaufmann, 1995, pp. 73-80.
21. U. O'Reilly and F. Oppacher, "Hybridized crossover-based search techniques for program discovery," in Proc. of the World Conf. on Evolutionary Computation, no. 2, 1995, pp. 573-578.
22. G. Harik, "Finding multimodal solutions using restricted tournament selection," in Proc. of the Int. Conf. on Genetic Algorithms, L. Eshelman, Ed. Morgan Kaufmann, 1995, pp. 24-31.
23. L. Eshelman and J. Schaffer, "Preventing premature convergence in genetic algorithms by preventing incest," in Int. Conf. on Genetic Algorithms, R. Belew and L. Booker, Eds. Morgan Kaufmann, 1991, pp. 115-122.
24. D. Whitley, S. Rana, J. Dzubera, and E. Mathias, "Evaluating evolutionary algorithms," Artif. Intell., vol. 85, pp. 245-276, 1996.
25. M. Platel, S. Schliebs, and N. Kasabov, "Quantum-inspired evolutionary algorithm: A multimodel eda," IEEE Trans. Evol. Comput., vol. 13, no. 6, pp. 1218-1232, dec. 2009.
26. S. Forrest and M. Mitchell, "Relative building block fitness and the building block hypothesis," in Foundations of Genetic Algorithms 2, L. Whitley, Ed. Morgan Kaufmann, 1993, pp. 109-126.
27. D. Thierens, "Population-based iterated local search: restricting neighborhood search by crossover," in Proc. of the Genetic and Evolutionary Computation Conf., ser. LNCS, K. Deb, R. Poli, W. Banzhaf, H.-G. Beyer, E. Burk, P. Darwen, D. Dasgupta, D. Floreano, J. Foster, M. Harman, O. Holland, P. Lanzi, L. Spector, A. Tettamanzi, D. Thierens, and A. Tyrrel, Eds., vol. 3103. Springer, 2004, pp. 234-245.
28. D. Goldberg, B. Korb, and K. Deb, "Messy genetic algorithms: motivation, analysis, and first results," Complex Syst., vol. 3, pp. 493-530, 1989.
29. M. Pelikan, D. Goldberg, and E. Cantú-Paz, "Linkage problem, distribution estimation, and bayesian networks," Evol. Comput., vol. 8, no. 3, pp. 311-340, 2000.
30. K. Smith, H. Hoos, and T. Stützle, "Iterated robust tabu search for MAX-SAT," in Proc. of the Canadian Society for Computational Studies of Intelligence Conf., ser. LNCS, J. Carbonell and J. Siekmann, Eds., vol. 2671. Springer, 2003, pp. 129-144.
31. S. Kauffman, "Adaptation on rugged fitness landscapes," Lec. Sci. Complex., vol. 1, pp. 527-618, 1989.
32. R. Watson and J. Pollack, "Hierarchically consistent test problems for genetic algorithms," in Proc. of the Congress on Evolutionary Computation, vol. 2, 1999, p. 1413.
33. W. Spears, Evolutionary Algorithms: The Role of Mutation and Recombination. Springer, 2000.
34. J. Beasley, "Heuristic algorithms for the unconstrained binary quadratic programming problem," The Management School, Imperial College, Tech. Rep., 1998.
35. R. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R. Miller and J. Thatcher, Eds. Plenum Press, 1972, pp. 85-103.
36. D. Thierens, "Adaptive mutation rate control schemes in genetic algorithms," in Proc. of the Congress on Evolutionary Computation, 2002, pp. 980-985.
37. D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, 1997.
38. C. Schumacher, M. D. Vose, and L. D. Whitley, "The no free lunch and problem description length," in Genetic Evolutionary Computation Conf (GECCO). Morgan Kaufmann, 2001, pp. 565-570.
39. C. Igel and M. Toussaint, "On classes of functions for which no free lunch results hold," Inf. Process. Lett., vol. 86, no. 6, pp. 317-321, 2003.
40. E. Alba and B. Dorronsoro, "The exploration/exploitation tradeoff in dynamic cellular genetic algorithms," IEEE Trans. Evol. Comput., vol. 9, no. 2, pp. 126-142, 2005.
41. D. Molina, M. Lozano, C. García-Martínez, and F. Herrera, "Memetic algorithms for continuous optimization based on local search chains," Evol. Comput., vol. In press, 2010.
42. P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y. P. Chen, A. Auger, and S. Tiwari, "Problem definitions and evaluation criteria for the CEC 2005 special session on real parameter optimization," Nanyang Technological University, Tech. Rep., 2005.
43. G. Chen, C. P. Low, and Z. Yang, "Preserving and exploiting genetic diversity in evolutionary programming algorithms," IEEE Trans. Evol. Comput., vol. 13, no. 3, pp. 661-673, 2009.
44. F. Wilcoxon, "Individual comparisons by ranking methods," Biometrics, vol. 1, pp. 80-83, 1945.
45. J. Zar, Biostatistical Analysis. Prentice Hall, 1999.