Share:


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

    Peter Matis Affiliation

Abstract

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.


First published online: 27 Oct 2010

Keyword : street routing problem (SRP), vehicle routing problem (VRP), heuristics, approximations

How to Cite
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
Published in Issue
Mar 31, 2010
Abstract Views
496
PDF Downloads
350
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.