Dept of Transportation Networks, Faculty of Management Science and Informatics, University of Zilina, Univerzitna 8215/1, 010 26 Zilina, Slovak Republic
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 12 000 to 29 000 customers.
Matis, P. (2010). Finding a solution for a complex street routing problem using the mixed transportation mode. Transport, 25(1), 29-35. https://doi.org/10.3846/transport.2010.05
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
