After yet more Internet woes (hub issues this time), back on the airwaves with a quick update of progress.
Currently have been reading and making notes throughout the course of a normal week, and then writing these up at the weekend. However currenlty a lot more notes than actual writing being done, but hope to correct this over the next few days.
Last week looked at the basics of simmulated annealing, which I posted links to. Notes have been made, but need to write up results/commentary about the technique. Also need to find what’s new in the area, plus where it;s been applied, and how it compares to PSO.
This week has been looking at Genetic algorithms — found very good tutorial on the net here.The next stage is to write up findings so far, and also add more academic-level detail to the argument. I sourced a good book from the libary which should be a good starter for 10, and a campus visit next week will no doubt fill up my book bag once more.
The aim is to spend next week on Tabu search, hence spending ~1wk on simulated annealing, GS and Tabu search. That will take me to ~24-Nov, when I’ll spend a few days implementing the above in code, to present my findings of the above. Then a few more days on researching recent work in the above metaheuristic areas, writing that up, and looking at the No Free Lunch argument … hopefully the end is not too far off!!
