HEURISTIC SEARCH

Contents

• · Introduction.
• · Systematic search.
• - Blind/informed search.
• - The A* algorithm, admissible heuristics.
• - Bounded-memory algorithms.
• - Iterative deepening and iterative broadening.
• - Parallel and interleaved search. Games.
• - Applications.
• · Local search.
• - Simulated annealing.
• - Genetic algorithms.
• - Tabu search.

Advisors

• LARROSA BONDIA, FRANCISCO JAVIER
• MESEGUER GONZALEZ, PEDRO
• VILA GRABULOSA, LLUIS

Bibliography

• Aarts y Lenstra 97, Local search in combinatorial optimization, Wiley-Interscience
• Ginsberg, 93, Essentials of artificial intelligence, Morgan Kauffmann
• Kanal & Kumar 88, Search in artificial intelligence, Springer-Verlag
• Pearl 84, Heuristics, Addison-Wesley
• Reeves 95, Modern heuristics techniques for combinatorial problems, McGrawHill
• Russell and Norvig 95, Artificial intelligence, a modern approach, Prentice Hall