Skip to content

bivillar/TSP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Travelling Salesman Problem

This is a project for PUC-Rio AI class that has the objective of implementing two different metaheuristics algorithms for solving TSP problem. The chosen algorithms were Genetic and Farthest Insertion.

Getting Started

This project is composed by two parts, the client (ReactJS) and the server (NodeJS) for saving the output files.

Prerequisites

You'll need to have yarn installed. If you don't have it, before continuing please follow to:

Installing

The instalation is pretty simple. Download the Project, open a terminal window at the root of it and execute the start script like this:

./start.sh

If you get a Permission Denied error, run the following commands:

chmod +x starth.sh
./start.sh

The start.sh script installs the dependencies, starts the Node server and runs the React app at http://localhost:3000/.

About

A ReactJS webapp implementing the Genetic and Farthest Insertion metaheuristic and heuristic algorithms to solve the Travelling Salesman Problem.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors