Vectored Route-length Minimization - A Heuristic and An Open Conjecture

TL;DR

This paper introduces VeRMinS, a heuristic method for a Euclidean shortest route problem, aiming to inspire formal proofs and further research in graph theory and route optimization.

Contribution

It presents a novel heuristic approach for a Euclidean shortest route problem, re-casting classical shortest path issues within a new geometric framework.

Findings

Proposed VeRMinS heuristic for Euclidean shortest route problem

Re-casted classical shortest route problem in Euclidean space

Encouraged further mathematical investigation and proof development

Abstract

We propose a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened as Vectored Route-length Minimization Search (VeRMinS). Basically, it constitutes of a re-casting of the classical 'shortest route' problem within a strictly Euclidean space. We have only presented a heuristic solution process with the hope that a formal proof will eventually emerge as the problem receives wider exposure within mathematical circles.