Résolution du problème de tournées de véhicules avec contrainte du temps par l’algorithme Big Bang-Big Crunch

Abstract

The objective of this thesis is the resolution of VRP vehicle touring problems using metaheuristics. We are interested in a variant of the VRP, namely the problem VRPTW (Vehicle Routing Problem with Time Windows). This problem was treated using a metaheuristics called the Big Bung-Big Crunch algorithm a new optimization method that is based on one of the theories of the evolution of the universe namely the Big Bang and Big Crunch theory. This algorithm has been improved by the use of two heuristic improvement methods or operators, namely the 2-opt method and the 1-1 exchange method. Keywords: Vehicle routing problem, Time Windows, Big Bung-Big Crunch algorithm, Local Search, Heuristic improvement operator, 2-opt method, 1-1 exchange method.