Vehicle Routing Problem with Time Windows and Driving Time Restrictions

摘要

In this paper, a new Vehicle Routing Problem is introduced where driving time and working time restrictions are imposed on the problem. First, a mathematical model and a genetic algorithm-based solution technique are proposed and later they are compared. Two new operators (route-sensitive crossover and route-sensitive mutation) are also proposed to solve this particular problem. The results show that GA can find the optimal solution with a high frequency for small problems. As the problem size grows, it becomes difficult to solve the math model since the number of decision variables and the constraints grow fast. In those situations, GA continues to be a good choice since it can provide feasible solutions (and hopefully at least some optimal) relatively fast.