TIME-DEPENDENT VEHICLE ROUTING PROBLEMS UNDER VARIOUS CONDITIONS AND CONSTRAINTS

Abstract

The Vehicle Routing Problem (VRP) is a challenging optimization problem with various practical applications. This thesis focuses on the Time-Dependent VRP (TDVRP), which involves designing efficient routes to serve customers using a fleet of vehicles while considering time-dependent travel times. The TDVRP is a complex problem, and this thesis proposes several meta-heuristic algorithms to address different aspects of the problem, such as incorporating time-dependent aspects in the dial-a-ride problem and considering the energy consumption of electric vehicles. The proposed algorithms aim to minimize the total cost of the routes while satisfying the practical constraints of the problem. By considering the various complexities of the TDVRP, this thesis contributes to the development of efficient and effective routing solutions for real-world logistics and supply chain management problems.