Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

Reference Point-based Near Insertion Approach and Its Improvement for Traveling Salesman Problem

Tong Hanghang Wang Ling He Jingrui(Dept.of Automation,Tsinghua University,Beijing 100084)  
Traveling salesman problem (TSP)is a typical NP-hard problem.By analyzing constructive algorithms represented by the nearest insertion, this paper proposes a kind of reference point-based near insertion approach and its improvement version with 0(n2) and O(n3) polynomial time performances respectively.Moreover,simulation results based on typical benchmarks demonstrate the effectiveness and efficiency of the proposed approaches.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved