Vehicle Routing Problem with Time Windows and Driving/Working Time Restrictions
In this thesis, a new Vehicle Routing Problem with time windows is introduced where driving time and working time restrictions are imposed on the problem. The objective is to minimize the total traveling distance. A mathematical model and also a genetic algorithm-based solution technique are proposed first and later they are compared. The results show that GA can find the optimal solution with a high frequency for small problems. Two new genetic operators (route-sensitive crossover and route-sensitive mutation) are also proposed to solve this particular problem. The results of the experiments also show that the proposed crossover operator and swap mutation outperformed the classical operators.
School Location:USA - Ohio
Source Type:Master's Thesis
Keywords:vechicle routing problems vrp driving working time restrictions genetic algorithm ga route sensitive crossover rsx mathematical model
Date of Publication:01/01/2008