Skip to content

🗺️ Proposed solution for the Multi-Depot Vehicle Routing Problem with time constraints

Notifications You must be signed in to change notification settings

diogolhc/feup-mieic-cal-proj

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

CAL - Vaccine Router

Description

The purpose of this project is to distribute vaccines from a set of storage centers to a set of application centres minimizing the number of vehicles used without exceeding the vaccines conservation time.

The main concepts used for the development of this project are the Travelling Salesman Problem, Vehicle Routing Problem and the Multi-Depot Vehicle Routing Problem.

This project was developed by Diogo Luís Henriques Costa (up201906731@edu.fe.up.pt), Francisco José Barbosa Marques Colino (up201905405@edu.fe.up.pt) and Rui Filipe Teixeira Alves (up201905853@edu.fe.up.pt) for CAL 2020-21.

Products

The project final report can be found at report/2nd/CAL_relatorio_2MIEIC08_G2_entrega2.pdf and the source code at source.

Compiling the source code is straight forward using the CLion IDE starting by reloading the CMake Project.

Library Dependency

GraphViewerCpp at source/lib/GraphViewerCpp

Screenshots

Further details on the screenshots can be found at the "Funcionalidades e cenários implementados" section of the report.

Load Map of Porto

report/2nd/imgs/funcs/load.png

Strongly Connected Components

report/2nd/imgs/funcs/scc.png

A* Shortest Path

report/2nd/imgs/funcs/astar.png

Dijkstra Shortest Path

report/2nd/imgs/funcs/dijkstra.png

Vaccine Distribution

report/2nd/imgs/funcs/distribute.png

About

🗺️ Proposed solution for the Multi-Depot Vehicle Routing Problem with time constraints

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published