Brain Journal-An Efficient Combined Meta-Heuristic Algorithm For Solving The Traveling Salesman Problem-Figure 7. Execution Plot, For Instance Eil51 (Left Figure) And Krob100 (Right Figure)

The evolution of the best solution found by the proposed algorithm is plotted in Figure 7 during a typical execution when solving instance Eil51 and KroB100. In this figure, the horizontal and vertical axes show the number of iterations and gained values of the proposed algorithm respectively. Besides, there is a fast convergence toward the BKS at the beginning of the execution while in the rest of the search the evolution of the BKS is not that fast.

https://www.edusoft.ro/brain/index.php/brain/article/view/631/696

Related Organizations

Islamic Azad University Central Tehran Branch
Iran (Islamic Republic of)
Bu-Ali Sina University
Iran (Islamic Republic of)

Keywords

Imperialist Competitive Algorithm, Traveling Salesman Problem, NP-hard Problems

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average