Logiciel de calcul de tournées de bus scolaire

Abstract

Vehicle Routing Problems are concerned with determining how a set of vehicles can visit a set of customers while minimizing some objective. It is a complex and difficult problem. Exact methods of resolution are limited to problems with relatively small size. This is why many approximate methods were adapted to the resolution of this problem. Among this adaptations, we find algorithms based meta-heuristics. This master thesis presents a computation software of school bus tours. It explains the problem of Traveling Salesman Problem and vehicle Routing Problem and by using Concorde TSP solver, gives heuristics algorithms which we have used in this project to solve it.