Travelling Salesman
Finding the best route to deliver multiple packages in different cities
The travelling salesmans is a famous NP-hard problem, which consisit of finding to most effiicent route to deliver multiple packages is multiple cities.
This project solves multiple variants of the travelling salesman problem:
- A Unique vehicle scenario, with weight constraints.
- A 5 vehicles scenario (reprensenting a compagny with a fleet of vehicle)
- A free market scenario, where the compagny is competing with another concurent compagny for delivery, therefore trying to find the best pricing.
This project was written in Java and a monte carlo optimizer was manually written for it.
The project was successfully done in close collaboration with Marcel Dubach, for the EPFL master class CS-430 Intelligent agents