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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vilnius Gediminas Technical University
2010-03-01
|
| Series: | Transport |
| Subjects: | |
| Online Access: | http://www.transport.vgtu.lt/en/lt/3/NR/PUB/23143 |
| id |
doaj-645eb325cfc3494da307b8e0d151cb52 |
|---|---|
| record_format |
Article |
| spelling |
doaj-645eb325cfc3494da307b8e0d151cb522021-07-02T04:56:14ZengVilnius Gediminas Technical UniversityTransport1648-41421648-34802010-03-012512935Finding a solution for a complex street routing problem using the mixed transportation modeP. MatisThe 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.http://www.transport.vgtu.lt/en/lt/3/NR/PUB/23143street routing problem (SRP)vehicle routing problem (VRP)heuristicsapproximations |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
P. Matis |
| spellingShingle |
P. Matis Finding a solution for a complex street routing problem using the mixed transportation mode Transport street routing problem (SRP) vehicle routing problem (VRP) heuristics approximations |
| author_facet |
P. Matis |
| author_sort |
P. Matis |
| title |
Finding a solution for a complex street routing problem using the mixed transportation mode |
| title_short |
Finding a solution for a complex street routing problem using the mixed transportation mode |
| title_full |
Finding a solution for a complex street routing problem using the mixed transportation mode |
| title_fullStr |
Finding a solution for a complex street routing problem using the mixed transportation mode |
| title_full_unstemmed |
Finding a solution for a complex street routing problem using the mixed transportation mode |
| title_sort |
finding a solution for a complex street routing problem using the mixed transportation mode |
| publisher |
Vilnius Gediminas Technical University |
| series |
Transport |
| issn |
1648-4142 1648-3480 |
| publishDate |
2010-03-01 |
| description |
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. |
| topic |
street routing problem (SRP) vehicle routing problem (VRP) heuristics approximations |
| url |
http://www.transport.vgtu.lt/en/lt/3/NR/PUB/23143 |
| work_keys_str_mv |
AT pmatis findingasolutionforacomplexstreetroutingproblemusingthemixedtransportationmode |
| _version_ |
1721339342598701056 |