Paper Title: Incremental Local Search in Ant Colony Optimization: Why it Fails for the Quadratic Assignment Problem
Autors: Prasanna Balaprakash, Mauro Birattari, Thomas Stuetzle, and Marco Dorigo
Affliation: IRIDIA, CoDE, ULB, Brussels, Belgium.
Note: This webpage contains some additional results for the paper submitted to ANTS-2006

Experimental results of rbMMAS-QAP on several QAP instances. Each plot represents the average distance between ants' solution before, after the local search and the restart-best solution obtained by rbMMAS-QAP(1) and rbMMAS-QAP(i). The stopping criterion is set to 500 iterations.