Vai al contenuto

Bibliografia

Parte 4 · Algoritmi euristici · Capitolo 32 · Capitolo 32: Metaeuristiche · Dispensa, volume 4 (PDF) · Slide (1/2) · Slide (2/2) · Esercizi: Metaeuristiche · App: TSP: simulated annealing e tabu search

  • V. Černy, Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm, Journal of Optimization Theory and Applications 45 (1985) 41–51.

  • T.A. Feo, M.G.C. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters 8 (1989) 67–71.

  • T.A. Feo, M.G.C. Resende, Greedy randomized adaptive search procedures, Journal of Global Optimization 6 (1995) 109–133.

  • F. Glover, Future paths for integer programming and links to artificial intelligence, Computers & Operations Research 13 (1986) 533–549.

  • F. Glover, M. Laguna, Tabu Search, Kluwer, 1997.

  • D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.

  • B. Hajek, Cooling schedules for optimal annealing, Mathematics of Operations Research 13 (1988) 311–329.

  • J.H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, 1975.

  • S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671–680.

  • M. López-Ibáñez, J. Dubois-Lacoste, L. Pérez Cáceres, M. Birattari, T. Stützle, The irace package: iterated racing for automatic algorithm configuration, Operations Research Perspectives 3 (2016) 43–58.

  • H.R. Lourenço, O.C. Martin, T. Stützle, Iterated local search, in F. Glover, G.A. Kochenberger (a cura di), Handbook of Metaheuristics, Kluwer, 2003, 321–353.

  • O. Martin, S.W. Otto, E.W. Felten, Large-step Markov chains for the traveling salesman problem, Complex Systems 5 (1991) 299–326.

  • N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, E. Teller, Equation of state calculations by fast computing machines, The Journal of Chemical Physics 21 (1953) 1087–1092.

  • N. Mladenovic, P. Hansen, Variable neighborhood search, Computers & Operations Research 24 (1997) 1097–1100.

  • P. Moscato, On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms, Technical Report C3P 826, Caltech, 1989.

  • S.K. Park, K.W. Miller, Random number generators: good ones are hard to find, Communications of the ACM 31 (1988) 1192–1201.

  • S. Ropke, D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transportation Science 40 (2006) 455–472.

  • P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, in Principles and Practice of Constraint Programming – CP98, Lecture Notes in Computer Science 1520, Springer, 1998, 417–431.

  • É. Taillard, Robust taboo search for the quadratic assignment problem, Parallel Computing 17 (1991) 443–455.

Esercizi su questo capitolo: Metaeuristiche