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.
7.5 Bibliographical Notes
Aarts, E.H.L., and J. Korst [1989], Simulated Annealing and Boltzmann Machines, Wiley.
Aarts, E.H.L., and J.K. Lenstra (eds.) [1997], Local Search in Combinatorial Optimization, Wiley.
Cerny, V. [1985], Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, Journal of Optimization Theory and Applications 45, 41–51.
Corne, D., M. Dorigo, and F. Glover (eds.) [1999], New Ideas in Optimization, McGraw-Hill.
Dueck, G., and T. Scheuer [1990], Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing, Journal of Computational physics 90, 161–175.
Feo, T.A., and M.G.C. Resende [1989], A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters 8, 67–71.
Festa, P., and M.G.C. Resende [2002], GRASP: An annotated bibliography, in: C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys on Metaheuristics, Kluwer Academic Publishers, 325–367.
Glover, F. [1986], Future paths for integer programming and links to artificial intelligence, Computers and Operations Research 13, 533–549.
Glover, F., and M. Laguna [1997], Tabu Search, Kluwer Academic Publishers.
Glover, F., and G. Kochenberger (eds.) [2003], Handbook of Metaheuristics, Kluwer Academic Publishers.
Goldberg, D.E. [1989], Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley.
Hansen, P. [1986], Presented at the Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy.
Holland, J.H. [1975], Adaptation in Natural and Artificial Systems, University of Michigan Press.
Johnson, D.S. [1990], Local optimization and the traveling salesman problem, Proceedings of the 17th Colloquium on Automata, Languages, and Programming, Warwick University, England, 446–461.
Kirkpatrick, S., C.D. Gelatt, Jr., and M.P. Vecchi [1983], Optimization by simulated annealing, Science 220, 671–680.
Lin, S., and B.W. Kernighan [1973], An efficient heuristic algorithm for the travelingsalesman problem, Operations Research 21, 498–516.
Lorenco, H.R., O. Martin, and T. Stützle [2003], Iterated local search, in: F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics, Kluwer Academic Publishers, 321–353.
Metropolis, M., A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller [1953], Equation of state calculations by fast computing machines, Journal of Chemical Physics 21, 1087–1092.
Michalewicz, Z. [1992], Genetic Algorithms + Data Structures = Evolution Programs, Springer.
Michalewicz, Z., and D.B. Fogel [2000], How to Solve It: Modern Heuristics, Springer.
Mühlenbein, H., M. Gorges-Schleuter, and O. Kämer [1988], Evolution algorithms in combinatorial optimization, Parallel Coputing 7, 65–85.
Osman, I.H., and G. Laporte [1996], Metaheuristics: A bibliography, Annals of Operations Research 63, 513–623.
Pitsoulis, L.S., and M.G.C. Resende [2002], Greedy randomized adaptive search procedures, in: P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization, Oxford University Press, 168–183.
Ribeiro, C.C., and P. Hansen (eds.) [2002], Essays and Surveys on Metaheuristics, Kluwer Academic Publishers.
Salamon, P., P. Sibani, and R. Frost [2002], Facts, Conjectures, and Improvements for Simulated Annealing, SIAM Monographs on Mathematical Modeling and Computation.
Schilham, R.M.F. [2001], Commonalities in Local Search, Ph.D. thesis, Eindhoven University of Technology, The Netherlands.
Ulder, N.L.J., E.H.L. Aarts, H.J. Bandelt, P.J.M. van Laarhoven, and E. Pesch [1991], Genetic local search algorithms for the traveling salesman problem, Proceedings of the 1st Workshop on Parallel Problem Solving from Nature, Dortmund, Germany, 109–116.
Winker, P. [2001], Optimization Heuristics in Econometrics: Applications of Threshold Accepting, Wiley.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Metaheuristics. In: Theoretical Aspects of Local Search. Monographs in Theoretical Computer Science, An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-35854-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-35854-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35853-4
Online ISBN: 978-3-540-35854-1
eBook Packages: Computer ScienceComputer Science (R0)