

Loading in 2 Seconds...
Loading in 2 Seconds...
The Coordination of Parallel Search with Common Components Stephen Chen and Gregory PittYork University
Heuristic Search • Search Operators • Control Strategies IEA-AIE 2005
An Obvious Failing • Point search operators do not have historical information! IEA-AIE 2005
Search Operator Strategies • What can be improved? • What is worth keeping? IEA-AIE 2005
Random Local Minima IEA-AIE 2005
Simulated Annealing IEA-AIE 2005
Summary • Random search space, random search strategy • All the intelligence of simulated annealing is in the control strategy IEA-AIE 2005
Distribution of Local Minima (Boese) Length Average distance from other local minima IEA-AIE 2005
“Big-Valley” – Globally Convex IEA-AIE 2005
“Directed” Simulated Annealing IEA-AIE 2005
Coordination with Common Components IEA-AIE 2005
Restricted Mutations • Parent 1 1 1 1 0 0 1 0 1 1 1 • Parent 2 1 0 1 1 0 1 1 0 1 1 • Common 1 1 0 1 1 1 • Uncommon 1 1 0 0 1 • Uncommon 2 0 1 1 0 IEA-AIE 2005
TSP Results IEA-AIE 2005
Summary • Globally convex search space, “respectful” search operator • Add some intelligence to the search operator IEA-AIE 2005
Conclusion • The preservation of common components can improve the performance of parallel search procedures in globally convex search spaces IEA-AIE 2005