Abstract
This project aims to develop efficient algorithms for vehicle routing problem in a road network. When a vehicle receives a set of delivery points, it must use an optimized route, minimizing the distance traveled or total time. This is the classic Traveling Salesman Problem (TSP). However, when there is more than one vehicle, the problem has two phases: (I) to partition the delivery points…