河北省污水处理设施运行现状调查表T.pptVIP

Simulated Annealing 10/7/2005 Local Search algorithms Search algorithms like breadth-first, depth-first or A* explore all the search space systematically by keeping one or more paths in memory and by recording which alternatives have been explored. When a goal is found, the path to that goal constitutes a solution. Local search algorithms can be very helpful if we are interested in the solution state but not in the path to that goal. They operate only on the current state and move into neighboring states . Local Search algorithms Local search algorithms have 2 key advantages: They use very li