Our Fleet Management routing engine enables you to optimise routes for multiple vehicle fleets, calling at many location nodes to either pick-up or deliver to. As an example, our Fleet Management routing engine is extremely flexible and has a rich rule-building capability, enabling you to specify and configure routing rules for a very wide range of applications, including:
• Fleet management
• Field force planning
• Restricted Delivery / Pick-up jobs
• Mixed Delivery / Pick-up routes for vehicles / resources
• School bus routing
• Waste collection, etc.
Multiple Scenario Analysis
Multiple scenario analysis allows users to model and examine alternative scenarios and the effects of changing and allocating resources to different locations.
Such scenarios include:
• Closing and relocating nodes – e.g. depots, stations, etc.
• Changing type and location of vehicles (resources).
• Assessing travel and response times as well as populations / households served by nodes (depots, stations, etc.)
• Assessing the impact of relocation upon optimal service areas for nodes / depots.
Fleet Management routing engine plugs into the rest of the EVO Platform, making the analysis available via Earthlight and Aurora, providing a full visual representation of all scenarios for all users.
Features and Functionality
Features and Functionality within the routing engine is sophisticated and enables you to build up complex scenarios to properly reflect the business restrictions which will affect your operational vehicles; such as sending the right vehicle (resource) to the delivery / pick-up node to cater for the restrictions in place at particular nodes (e.g. vehicles with wheelchair lifts for disabled pick-ups).
Features included within the software includes the following:
• Multiple depots
• Multiple resources (vehicles)
• Multi-day planning
• Asymmetric distance and time matrix
• Job – resource match
• Service time
• Geo-fencing (setting ‘no-go’ areas for vehicles / resources)
• Job priorities
• Breaks and Standby jobs
• Workload balancing
• Capacity: Weight, volume etc.
• Multiple time windows for a job (such as 8-9 or 10-12)
• Avoiding U-turns en route (curb approach)
• Round trip / open-ended trips
• Mixed pickup and delivery
• Preferred resources
• Built-in matrix calculation
• Driving directions
Complex Routing Features
• Node-to-Node Routing
• Spatial searches
• Max List Length
• Shortest / fastest / cheapest route
• Alpha parameter for improved speed
• Export to .shp, .kml, .gml, .csv, .dbf, array, GeoJSON
• Turn Restrictions
• Limits for vehicles / routes (maximum weight, width, etc.)
• Dynamic segmentation
• Driving directions
• Travelling salesman optimisation
• Nearest N facilities
• Isochrone functions – Link based
• Isochrone functions – Voronoi based
• Topological checks (subnets, missing snap, parallel links, cul-de-sac, • overpasses, etc.)
• Smoothing of Isochrones
• Hierarchical routing
• Approach-based routing
• Multi-threaded routing
• Travelling Salesman Optimisation with curb approach
• Minimum Spanning Tree
• Weighted Centre of Graph
• Traffic Assignment