Vehicle Routing Problem With Time Windows

Abstract

In the last few years, transportation systems used for the collection and distribution of goods or services have been the subject of numerous studies in the scientific community. Nowadays, most transport systems must be able to work within strict time constraints and adapt to the uncertainties of the problem. The customers or partners of a company always require a guaranteed quality of service (deadlines to be respected for example). In addition, the environment in which a company must evolve is often uncertain so its reactivity is also an important factor. This has led to the definition of so-called dynamic transport system control models in which part of the data is considered to be time dependent. The domain in which our work is focused, is the classical problem of the elaboration of vehicle routing problem (VRP). This one consists in building minimal cost routes in order to visit once and only once a set of geographically distributed customers. The work presented in this thesis deals more precisely with the resolution of the Vehicle Routing Problem with Time Windows and some of its extensions. The objective of this work was double. On the one hand, it was to show the different approach to solve the VRP problem and its variants,and on the other hand, implement the Genetic Algorithm on Vehicle Routing Problem with Time Windows.