Journal
TRANSPORT
Volume 25, Issue 1, Pages 29-35Publisher
VILNIUS GEDIMINAS TECH UNIV
DOI: 10.3846/transport.2010.05
Keywords
street routing problem (SRP); vehicle routing problem (VRP); heuristics; approximations
Categories
Funding
- Centre of excellence of information sciences and knowledge systems [ITMS 26220120007]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
