Finding a solution for a complex street routing problem using the mixed transportation mode

The Street Routing Problem (SRP) is a special case of the well-known Vehicle Routing Problem (VRP). The goal is to service a large number of customers in the city zone. New heuristics for solving a complex SRP is evaluated based on real data. This paper presents several approximations to the length of SRP using the mixed transportation mode and compares them with the published approximations used for VRP or Travelling Salesman Problems (TSP). The system was tested in five real world instances ranging from 12000 to 29000 customers