Skip to content
/ tsp Public

Exploring shortest-paths in the Traveling Salesman Problem.

Notifications You must be signed in to change notification settings

lucasdavid/tsp

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

63 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

#TSP#

Introduction

Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. (Wikipedia)

Volunteer scientific initiation student in Graph Theory field, resulting in the paper "Twice-around a Shortest-path Tree Significantly Increases the Solution Cost".

The paper reports the empirical performance comparison between the classical Twice-around algorithm and a modified Twice-around which uses Dijkstra's shortest-path as sub-algorithm. Invariably, the classic Twice-around performed much better than the one with Dijkstra's.

References

About

Exploring shortest-paths in the Traveling Salesman Problem.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published