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


    Access

    Download


    Export, share and cite



    Title :

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


    Contributors:
    Peter Matis (author)


    Publication date :

    2010




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown







    A Mixed Load Solution for the Rural School Bus Routing Problem

    Silva, Cristiano Maciel / Sarubbi, Joao F. M. / Silva, Daniel Fonseca et al. | IEEE | 2015


    Transportation Routing

    ROWLEY HENRY / BALUJA SHUMEET | European Patent Office | 2017

    Free access