Les m ethodes de r esolution sur Le probl eme de cheminement multi-crit ere

Abstract

The work presented in this thesis aims to propose methods for calculating the shortest path not only for the shortest path problem but also multi-criteria such as distance, insecurity, effort, etc. and with best compromise solutions. In the first chapter, we discussed the fundamental basic notions of graph theory. In the second chapter, we discussed the different algorithms Dijkstra, Bellman-Ford, Floyed Warshall, Kruskal to solve the classic problem of the shortest path (mono-criterion). The third chapter consists in presenting the multi-objective optimization, defining its basic notions of a multi-criteria optimization problem, the approaches of resolution. then, we specified the bi-criteria case then we studied the algorithms to solve it. The fourth chapter consists in finding new methods and algorithms to solve the shortest path with more than two criteria with best compromise solutions..