Proposed new heuristic algorithm for travelling salesman problem based from minimum link

摘要

Travelling salesman problem is a problem that has always sought the best solution every time, because the problem salesman problem yet finalized, there are two important variable that must be met to achieve a settlement of traveling salesman problem, namely the problem optimum level of distance and the optimal time, any algorithm that serves to solve this problem mostly encountered problems at an optimum level of distance, while the best algorithms for the optimal distances have optimal levels of bad time when it reaches the number of points that a lot. This paper will discuss a proposed new algorithm to solve traveling salesman problem, the target of this paper is where can produce an algorithm that has the optimal distance and time are valued above algorithm Ant Cololony and has a deviation rate maximum of 5% for the distance to be compared with bruteforce algorithm as the algorithm has the absolute optimum dabanding all existing algorithms.