https://github.com/joaomhmpereira/parallel-and-distributed-computing
Travelling Salesman Problem (Serial, OpenMP and MPI) implementation using Branch and Bound algorithm.
https://github.com/joaomhmpereira/parallel-and-distributed-computing
branch-and-bound mpi openmp parallel-computing travelling-salesman-problem
Last synced: 26 days ago
JSON representation
Travelling Salesman Problem (Serial, OpenMP and MPI) implementation using Branch and Bound algorithm.
- Host: GitHub
- URL: https://github.com/joaomhmpereira/parallel-and-distributed-computing
- Owner: joaomhmpereira
- Created: 2023-04-23T14:56:22.000Z (over 2 years ago)
- Default Branch: master
- Last Pushed: 2023-05-19T17:32:40.000Z (over 2 years ago)
- Last Synced: 2025-04-12T03:35:23.691Z (6 months ago)
- Topics: branch-and-bound, mpi, openmp, parallel-computing, travelling-salesman-problem
- Language: C++
- Homepage:
- Size: 450 KB
- Stars: 2
- Watchers: 1
- Forks: 3
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# `Parallel and Distributed Computing` #
This repository contains work developed in the [Parallel and Distributed Computing](https://fenix.tecnico.ulisboa.pt/disciplinas/CPD2/2022-2023/2-semestre/pagina-inicial) masters course at IST.
More specifically, it contains three (one sequential and two parallel) implementations of the [Travelling Salesman Problem](https://en.wikipedia.org/wiki/Travelling_salesman_problem) using the [Branch and Bound](https://en.wikipedia.org/wiki/Branch_and_bound) algorithm.
Regarding the parallel implementations, one was done using [OpenMP](https://en.wikipedia.org/wiki/OpenMP) and the other using [MPI (Message Passing Interface)](https://en.wikipedia.org/wiki/Message_Passing_Interface).
Grade: 18/20.
Author | Github
-------|-------
Leonor Barreiros | https://github.com/leonormbarreiros
Catarina Bento | https://github.com/catarinab
João Pereira | https://github.com/joaomhmpereira
### `Instructions to run each implementation` ###
All implementations have their own directory and each already include a Makefile to compile the program.
Directories `pub-instances` and `output` contain the available tests (input files) and expected outputs respectively.
After compiling, use the following commands to run the programs:
- Serial
- `./tsp `
- OpenMP
- `./tsp-omp `
- MPI
- `mpirun -n tsp-mpi `