Solving the shortest path tour problem
We address the shortest path tour problem (SPTP). Two innovative solution methods for the SPTP are defined and implemented. An extensive computational phase is performed on a large class of instances. A comparison with the state-of-art algorithm to solve the SPTP is also carried out. The proposed approaches outperform remarkably the existing solving method.
shortest path network flows structure path constraints labeling method