Description

The so-called Travelling Salesman Problem (TSP) is based on the idea that every salesman aims at visiting a group of clients travelling the shortest possible distance. The solution proposed by Smart Easy Path (SEP) seeks to answer this problem considering four complexities: 1. Every client has a demand to be met. 2. The capacity of our vehicule fleet is finite. 3. Every client has a particular time window when the service must start. 4. We will know beforehand the service time for each client. This problem, known as Capacitated Vehicle Routing Problem with Time Windows (CVRPTW), is difficult to solve optimally, because of its computational complexity. The application contains a set of traditional heuristics described as construction heuristics. Using them, a series of initial routes is generated, which will be improved afterwards by improvement heuristics. Both sets are combined using metaheuristics with the sole purpose of removing their determinist effect. This product aims at making its use easier and more accessible for traffic leaders from companies using logistics regarding the different existing heuristics and metaheuristics.

Other information