کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
395046 | 665926 | 2012 | 12 صفحه PDF | دانلود رایگان |
An adaptive parallel ant colony optimisation (PACO) algorithm on massively parallel processors (MPPs) is presented. In the algorithm, we propose a strategy for information exchange between processors that makes each processor choose a partner to communicate with and update their pheromone adaptively. We also propose a method of adaptively adjusting the time interval for the exchange of information according to the diversity of the solutions, to increase the quality of the optimisation results and to avoid early convergence. The analysis and proof of the convergence of the PACO algorithm is presented. Experimental results of the TSP confirm our theoretical conclusions and show that our PACO algorithm has a high convergence speed, high speedup and high efficiency.
Journal: Information Sciences - Volume 199, 15 September 2012, Pages 31–42