Skip to content

MATH 490 Final Project: Approximating solutions to the decision variant of the TSP with Graph Neural Networks

Notifications You must be signed in to change notification settings

shobrook/gnn-dtsp

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

50 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

MATH 490 Group 7: Philip Dohm, Roger Qiu, Jonathan Shobrook

  • ./final.ipynb - Implements GNN to solve the Traveling Salesman Problem
  • ./data/figures/train_stats.png - Visualization of training/generalization statistics
  • ./data/data/pickles/ - Model training checkpoints and training/testing statisitics

To run: just run the final.ipynb file.

Description:

Tensorflow and graphs_nets implementation of solving the Traveling Salesman Problem using a Graph Neural Network.

Dependencies:

  • random
  • tensorflow
  • networkx
  • numpy
  • pandas
  • time
  • pickle
  • tsp_solver
  • graphs_nets

About

MATH 490 Final Project: Approximating solutions to the decision variant of the TSP with Graph Neural Networks

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 3

  •  
  •  
  •