The vehicle scheduling and routing (VSR) optimizer considers routing, and the sequence in which resources arrive at certain locations (as well as the scheduling of tasks running in parallel). It evaluates potential changes to the routing and the effect such changes can have on scheduling, helping to avoid the possibility of delayed deliveries and follow-on costs.
The goal of the optimizer is to assign freight units to vehicles/resources and determine the route and sequence of freight units per vehicle/resource such that all constraints are met and total costs are minimized. The optimizer achieves this goal by evolutionary local search, a population-based metaheuristic that borrows selection principles from evolutionary algorithms and relies heavily on local optimization.

The transformation displayed in the figure is obviously a reduction of the driven distance.
Costs and Constraints
The total cost, which the optimizer is designed to minimize, is a weighted sum of the following items:
- Non-delivery/execution penalty (per freight unit (FU))
- Earliness and lateness penalty (per FU)
- Fixed cost (per vehicle or tour)
- Travel-dependent costs (per vehicle), for example, distance and duration.
- Load-dependent costs (per vehicle and tour)
- Sustainability costs, such as CO2 emissions




