Task:
Section A (Less programming)
Answer ALL Parts
1. What is simulated annealing? How does it help search overcome the problem of local optima? Express In Your Own Words – A Maximum of 250 Words. Give the word count. (20%)
2. Describe tabu search. What are the different forms of tabu search and how do they help search avoid the problem of local optima. Express in your own words – A maximum of 500 words. Give the word count. (30%)
3. Implement a hill climber and simulated annealing and conduct experiments to compare the performance of them, using multiple random starting points for the hill climber. Conduct your experiment by implementing (at least) 2 of the De Jong Function set (F1-F5). Bear in mind the time overhead of simulated annealing and also the fact that simulated annealing is a stochastic process. (50%)
Get It Done! Today
Every Assignment. Every Solution. Instantly.
Deadline Ahead? Grab Your Sample Now.