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...
[1]
Rajan Batta,et al.
Analysis of centroid aggregation for the Euclidean distance p-median problem
,
1999,
Eur. J. Oper. Res..
[2]
Rubén Ruiz,et al.
A decision support system for a real vehicle routing problem
,
2004,
Eur. J. Oper. Res..
[3]
Philippe Lacomme,et al.
Evolutionary Algorithms for Arc Routing Problems
,
2003
.
[4]
José Rui Figueira,et al.
An interactive decision support system for an aggregate production planning model based on multiple criteria mixed integer linear programming
,
2006
.
[5]
Albert P. M. Wagelmans,et al.
A savings based method for real-life vehicle routing problems
,
1999,
J. Oper. Res. Soc..
[6]
S K Amponsah,et al.
The investigation of a class of capacitated arc routing problems: the collection of garbage in developing countries.
,
2004,
Waste management.