TSP-CVRP

                              ┌────────────────────────────────────────┐
                              │                TSP-CVRP                │
                              ├────────────────────────────────────────┤
                              │                                        │
                              │   Heuristics for Routing/Semestre 8    │
                              │              ENSEIRB-MATMECA           │
                              │          ~mbounakhla, ~mrihani         │
                              │                                        │
                              └────────────────────────────────────────┘

Description

This project is written in Java. It implements heuristics for problems traveling salesman (TSP) and vehicle routing with capacity constraints. (CVRP).

Motivation

This project is part of the fourth year of computer science engineering program at Bordeaux Graduate School of Engineering, also known as ENSEIRB-MATMECA. It is a mini project as part of the flood and combinatorial option (Flot et combinatoire IF230).

Use

See README in TSP/ and CVRP/ to use the heuristics implemented.

Useful links

• Repport : http://mrihani.vvv.enseirb-matmeca.fr/donnee/TSP_CVRP_Rapport.pdf

Contributors

• Mehdi BOUNAKHLA - Mehdi.Bounakhla@enseirb-matmeca.fr
• Mohammed RIHANI - Mohammed.Rihani@enseirb-matmeca.fr