Abstract

Servicing a large number of customers in a city zone is often a considerable part of many logistics chains. The capacity of one delivery vehicle is limited, but, at the same time, it usually serves plenty of customers. This problem is often called a Street Routing Problem (SRP). Key differences between Vehicle Routing Problem (VRP) and SRP are presented here. The main problem of SRP is that when the number of customers is huge, the number of delivery path combinations becomes enormous. As the experimental results show in the case of SRP the error on the length of delivery routes based on an expert's judgment when compared to the optimal solution is in the range of 10–25%. As presented in the paper, only using decision support systems such as Geographical Information Systems (GIS) makes possible to effectively manage SRP. Besides classical measurements used in VRP, such as total length of routes or time required for delivery in each route, other measurements, mostly qualitative ones, are presented. All of these are named as visual attractiveness. This paper discusses possible relationships between quantitative and qualitative measurements that give a promise for finding better solutions of SRP. Several new types of heuristics for solving SRP are evaluated and afterward compared using the real data. One of the key properties of GIS to use routing software is its flexible interactive and user‐friendly environment. Routing software can find a good solution and explore the possibilities while an expert later can change the calculated routes to explore other possibilities based on the expert's judgment. This paper presents a practical use of new heuristics with the ArcView and solution of address mail for several cities in Slovakia served by Slovak Post ltd. Other Decision Support Systems that solve SRP are presented as TRANSCAD developed by Caliper Corporation or GeoRoute promoted by Canadian Post and GIRO.

Highlights

  • The Street Routing Problem (SRP), as a problem of servicing a large number of customers in a city zone, is often a part of many logistics chains (Amponsah and Salhi 2004)

  • Other Decision Support Systems that solve SRP are presented as TRANSCAD developed by Caliper Corporation or GeoRoute promoted by Canadian Post and GIRO

  • We introduced some methodology for solving general SRPs

Read more

Summary

Introduction

The Street Routing Problem (SRP), as a problem of servicing a large number of customers in a city zone, is often a part of many logistics chains (Amponsah and Salhi 2004). As the experimental results show in the case of SRP the error on the length of delivery routes based on the expert’s judgment when compared to optimal solution is in the range of 10–25%. SRP is in many cases similar to the classical Vehicle Routing Problem (VRP). Traffic regulations in the city zone are more complicated and more restrictive than traffic regulations in a regular road network These regulations can and do greatly affect the expense for the routes. SRP requires large datasets including the city street networks, their parameters and regulations as well as the positions of customers with all their attributes and con-. Connecting GIS, user interface and solution algorithms we can create a decision support system (DSS) for the management of SRP (Ruiz et al 2004; Silva et al 2006)

Experimental sample
Customer aggregation
Visual attractiveness of routes
New heuristics for solution of SRP
Decision support system for the SRP
Findings
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.