Applying convex layers, nearest neighbor and triangle inequality to the Traveling Salesman Problem (TSP)

TL;DR

This paper introduces a simple, non-computational approach to the TSP using convex layers, nearest neighbor, and triangle inequality, aimed at practical problem-solvers without advanced technical skills.

Contribution

It presents a novel, easy-to-understand method for approximating the TSP without computer algorithms, making it accessible to non-experts.

Findings

Method provides a practical approximation for TSP.

No computer required, suitable for non-technical users.

Potential insights for researchers in TSP solutions.

Abstract

The author would like to propose a simple but yet effective method, convex layers, nearest neighbor and triangle inequality, to approach the Traveling Salesman Problem (TSP). No computer is needed in this method. This method is designed for plain folks who faced the TSP everyday but do not have the sophisticated knowledge of computer science, programming language or applied mathematics. The author also hopes that it would give some insights to researchers who are interested in the TSP.