Abstract
A search process implies an exploration of new, unvisited states. This quest to find something new tends to emphasize the processes of change. However, heuristic search is different from random search because features of previous solutions are preserved — even if the preservation of these features is a passive decision. A new parallel simulated annealing procedure is developed that makes some active decisions on which solution features should be preserved. The improved performance of this modified procedure helps demonstrate the beneficial role of common components in heuristic search.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Beyer, H.-G., Schwefel, H.-P.: Evolution Strategies: A comprehensive introduction. In Natural Computing, Vol. 1 (2002) 3–52
Boese, K.D.: Models for Iterative Global Optimization. Ph.D. diss., Computer Science Department, University of California at Los Angeles (1996)
Chen, S., Pitt, G.: The Coordination of Parallel Search with Common Components. In LNCS, Vol. 3533: Proceedings of the 18th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems. (2005)
Chen, S., Smith, S.F.: Introducing a New Advantage of Crossover: Commonality-Based Selection. In GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference. Morgan Kaufmann (1999)
Chen, S., Smith, S.F.: Putting the “Genetics” back into Genetic Algorithms (Reconsidering the Role of Crossover in Hybrid Operators). In Banzhaf, W., Reeves, C. (eds.): Foundations of Genetic Algorithms 5. Morgan Kaufmann (1999) 103–116
Glover, F.: Tabu search Part I. In Operations Research Society of America (ORSA) Journal on Computing, Vol. 1 (1989) 109–206
Holland, J.: Adaptation in Natural and Artificial Systems. The U. of Michigan Press (1975)
Hoos, H.H., Stützle, T.: Local Search Algorithms for SAT: An Empirical Evaluation. In Journal of Automated Reasoning, Vol. 24 (2000) 421–481
Johnson, D.S., McGeoch, L.A.: The Traveling Salesman Problem: A Case Study in Local Optimization. In Aarts, E.H.L., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. John Wiley and Sons (1997) 215–310
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by Simulated Annealing. In Science, Vol. 220 (1983) 671–680
Mühlenbein, H.: Evolution in Time and Space — The Parallel Genetic Algorithm. In: Rawlins, G. (ed.): Foundations of Genetic Algorithms. Morgan Kaufmann (1991)
Radcliffe, N.J.: Forma Analysis and Random Respectful Recombination. In Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann (1991)
Radcliffe, N.J., Surry, P.D. Formal memetic algorithms. In: Fogarty, T.C. (ed.): Evolutionary Computing: AISB Workshop. Springer-Verlag (1994)
Syswerda, G: Uniform Crossover in Genetic Algorithms. In Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann (1989)
Talukdar, S.N., de Souza, P.: Scale Efficient Organizations. In Proceedings of 1992 IEEE International Conference on Systems, Man and Cybernetics (1992)
Wendt, O., König, W.: Cooperative Simulated Annealing: How much cooperation is enough? Technical Report, No. 1997-3, School of Information Systems and Information Economics at Frankfurt University (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Chen, S. (2006). A Little Respect (for the Role of Common Components in Heuristic Search). In: Debenham, J. (eds) Professional Practice in Artificial Intelligence. IFIP WCC TC12 2006. IFIP International Federation for Information Processing, vol 218. Springer, Boston, MA . https://doi.org/10.1007/978-0-387-34749-3_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-34749-3_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34655-7
Online ISBN: 978-0-387-34749-3
eBook Packages: Computer ScienceComputer Science (R0)