Introduction
This chapter continues with the presentation of other informed search strategies (which are heuristics). They appear to be very useful for certain kind of problems even tough for certain categories of problems the quality of solution(s) provided may be unsatisfactory.
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.
References
Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the Traveling-Salesman Problem. Operations Research 21(2), 498–516 (1973)
Lin, S.: Computer Solutions of the Traveling Salesman Problem. Bell System Tech. J. 44, 2245–2269 (1965)
Laporte, G.: The traveling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59(2), 231–247 (1992)
Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of State Calculations by Fast Computing Machines. Journal of Chemistry and Physics 21, 1087–1092 (1953)
Luke, B.T.: Simulated annealing, Technical Report, http://members.aol.com/btluke/simann1.htm
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., Optimization, M.P.: by Simulated Annealing. Science 220(4598), 671–680 (1983)
Ingber, L.: Simulated annealing: practice versus theory. Mathl. Comput. Modelling 18(11), 29–57 (1993)
Ingber, L., Wehner, M.F., Jabbour, G.M., Barnhill, T.M.: Application of statistical mechanics methodology to term-structure bond-pricing models. Mathl. Comput. Modelling 15(11), 77–98 (1991)
Ingber, L.: Very fast simulated re-annealing. Mathl. Comput. Modelling 12(8), 967–973 (1989)
Moore, A., Climbing, H.: Simulated Annealing and Genetic Algorithms, Auton Lab Tutorials, Carnegie Mellon University, http://www.autonlab.org/tutorials/hillclimb02.pdf
Ingber, L., Rosen, B.: Genetic algorithms and very fast simulated reannealing: A comparison, Mathl. Comput. Modelling 16(11), 87–100 (1992)
Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical recipes in C: the art of scientific computing. Cambridge University Press, Cambridge (1992)
Kendall, G.: Simulated Annealing: course notes, AI Methods course, University of Nottingham, http://www.cs.nott.ac.uk/~gxk/
Cěrny, V.: A Thermodynamical Approach to the Travelling Salesman Problem; An Efficient Simulation Algorithm. J. of Optimization Theory and Applic. 45, 41–55 (1985)
Connolly, D.T.: An Improved Annealing Scheme for the QAP. European Journal of Operations Research 46, 93–100 (1990)
Dowsland, K.A.: Simulated Annealing. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill, New York (1995)
Hajek, B.: Cooling Schedules for Optimal Annealing. Mathematics of Operations Research 13(2), 311–329 (1988)
Johnson, D.S., Aragon, C.R., McGeoch, L.A.M., Schevon, C.: Optimization by Simulated Annealing: An Experimental Evaluation; Part II. Graph Coloring and Number Partitioning. Operations Research 39, 378–406 (1991)
Lundy, M., Mees, A.: Convergence of an Annealing Algorithm. Math. Prog. 34, 111–124 (1986)
Mitra, D., Romeo, F., Sangiovanni-Vincentelli, A.: Convergence and Finite Time Behavior of Simulated Annealing. Advances in Applied Probability 8, 747–771 (1986)
Rayward-Smith, V.J., Osman, I.H., Reeves, C.R., Smith, G.D.: Modern Heuristic Search Methods. John Wiley & Sons, Chichester (1996)
Hertz, A., Taillard, É.D., de Werra, D.: Tabu Search. In: Aarts, E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 121–136. J. Wiley & Sons Ltd., Chichester (1997)
Laguna, M., Glover, F.: What is Tabu Search? Colorado Business Review LXI(5) (1996)
Glover, F.: Heuristics for integer programming using surrogate constraints. Decision Sciences 8(1), 156–166 (1977)
Glover, F.: Future paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research 5, 533–549 (1986)
Glover, F.: Tabu Search Methods in Artificial Intelligence and Operations Research. ORSA Artificial Intelligence 1(2), 6 (1987)
Glover, F.: Tabu Search - Part I. ORSA Journal on Computing 1(3), 190–206 (1989)
Glover, F.: Tabu Search - Part II. ORSA Journal on Computing 2(1), 4–32 (1990)
Glover, F.: Tabu Search: A Tutorial. Interfaces 20(4), 74–94 (1990)
Glover, F.: Tabu Search: New Options for Optimization. ORSA Computer Science TS Letters 15(2), 13–20 (1994)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 13–54. Springer, Heidelberg (1998)
Glover, F.: Scatter Search and Path Relinking. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Methods in Optimisation, McGraw-Hill, New York (1999)
Glover, F., Laguna, M.: Tabu Search. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 194–208. Oxford University Press, Oxford (2002)
Glover, F., Laguna, M., MartÃ, R.: In: Ghosh, A., Tsutsui, S. (eds.) Advances in Evolutionary Computation: Theory and Applications, pp. 519–537. Springer, New York (2003)
Simon, H.A., Newell, A.: Heuristic problem solving: The next advance in operations research. Operations Research 6, 1–10 (1958)
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Grosan, C., Abraham, A. (2011). Iterative Search. In: Intelligent Systems. Intelligent Systems Reference Library, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21004-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-21004-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21003-7
Online ISBN: 978-3-642-21004-4
eBook Packages: EngineeringEngineering (R0)