本文是研究圓環投影法來解較大型旅行銷售員問題。其主要的原則是利用投影法來找尋一個完整,且相互不交叉的途程。而後,再進行鉅齒狀途程部份的修飾工作,使得鉅齒部份途程變得更為平坦,達到縮短途程,且簡單迅速的目的。
This paper is to propose a new heuristic method for solving Traveling Salesman Problems. First, the proposed projection procedure for finding a never cross-itself complete initial tour is introduced. The procedure is so simple and time saving, that is presents the most attractive advantage of this heuristic. Then, the subsequent tour improvement procedures are introduced, which would smooth the unnecessary saw tooth-like segment of the tour. Finally, comparisons are made with the currently favorable Farthest Insertion method to identify its advantages as swell as disadvantages.