A Sketch-First Approach for Finding TSP

Huang, Weihuang; Yu, Jeffrey Xu; Shang, Zechao

doi:10.1007/978-3-319-46922-5_10

Cited by 2 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A hybrid of Convex Hull and Nearest Neighbour heuristic (CH-NN) is proposed in this study. This was motivated by studies by conducted by authors [14,15,20] suggesting that node-based techniques which are based on the use of polygons as their initial tour produce superior tour. The Nearest Neighbour Heuristic is a node-based technique which builds circuits on a node-by-node basis.…”

Section: The Proposed Techniquesmentioning

confidence: 99%

See 1 more Smart Citation

A Computation Investigation of the Impact of Convex Hull subtour on the Nearest Neighbour Heuristic

Asani

Okeyinka

Adebiyi

2023

2023 International Conference on Science, Engineering and Business for Sustainable Development Goals (SEB-SDG)

View full text Add to dashboard Cite

This study investigated the computational effect of a Convex Hull subtour on the Nearest Neighbour Heuristic. Convex hull subtour has been shown to theoretically degrade the worstcase performances of some insertion heuristics from twice optimal to thrice optimal, although other empirical studies have shown that the introduction of the convex hull as a subtour is expected to minimize the occurrences of outliers, thereby potentially improving the solution quality. This study was therefore conceived to investigate the empirical effect of a convex-hull-based initial tour on the Nearest Neighbour Heuristic vis-a-vis the traditional use of a single node as the initial tour. The resulting hybrid Convex Hull-Nearest Neighbour Heuristic (CH-NN) was used to solve the Travelling Salesman Problem. The technique was experimented using publicly available testbeds from TSPLIB. The performance of CH-NN vis-à-vis that of the traditional Nearest Neighbour solution showed empirically that Convex Hull can potentially improve the solution quality of tour construction techniques.

show abstract

Section: The Proposed Techniquesmentioning

confidence: 99%

“…Heuristics have also been classified based on their solution paradigms into space-partitioning-based, edge-based, and node-based heuristics [14,15]. Node-based heuristics build their tour by expanding the nodes one at a time till all the nodes have been inserted.…”

Section: Introductionmentioning

confidence: 99%