High Density Multi Modal Routing for ArcGIS
High Density Route Planning is the right choice when you want to visit all addresses in an area. This is often the case for Postal Mail Delivery, Residential Garbage Collection and Total Market Coverage (TMC) with printed advertisement material like folders or leaflets.
Because of the large number of addresses it is not possible to produce an OD cost matrix calculating all-to-all drive time combinations. This is why the high density edition of Rapidis Logistics Planner for ArcGIS works with “address grouping” or “clustering” to make the OD cost matrix calculations possible.
Mail Delivery and TMC often involves walking postmen and carriers. To accommodate for this the Route Planning software automatically produces a sidewalk network allowing walking speed to be set by the planner. Car routes uses a traditional street network.
This extension for ArcGIS has a Postal VRP (Vehicle Routing Problem) tool that divides the area into efficient routes and a Postal TSP (Travelling Salesman Propblem) tool providing the best sequence for one or many individual routes without swapping tasks between routes.
Workflows for High Density Route Planning – The Geoprocessing Tools
The Sidewalk Tool automatically creates a separate network of sidewalks based on the road network and settings.
Inputs are roads, road types and settings. This digital road network are available from TomTom and other suppliers.
Building the sidewalk network is an automated process that should only bee activated when roads have changed and an updated road network is available.
- Aggregate addresses into small groups
- Group addresses close to each other, on the same sidewalk
- Maximum size of groups in terms of weight and service time
- The matrices of travel distance in the sidewalk network are the basis for the planning calculations
- One matrix is calculated between the end-points for all address groups – used for overall route creation
- A set of matrices, 2 for each route, is created as the basis for optimization of each route (see TSP tool)
More information and downloads
Please contact Leif Dahl Petersen for prices, documentation and test access