neshan_vrp_logistic
Assigns delivery jobs to vehicles to minimize total distance or duration while respecting capacity, skills, and time windows.
Instructions
Solve a Vehicle Routing Problem (VRP) for logistics / delivery optimization.
Assigns a set of jobs to vehicles starting from a depot, minimising total distance or duration, respecting vehicle capacities, skills, and time windows. See each object's field descriptions in the tool schema for exact shape.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| jobs | Yes | Jobs to assign to vehicles. 'skills' on a job must be a subset of the assigned vehicle's 'skills' to be eligible. | |
| depot | Yes | Starting/ending point shared by vehicles without their own startLocation/endLocation. | |
| vehicles | Yes | Vehicles available to plan routes for. | |
| cost_type | No | Optimise for 'DISTANCE' or 'DURATION'. | DISTANCE |
| plan_time | No | Max solver time in milliseconds (default 45000). | |
| routing_engine | No | 'typical' | 'car' | 'motorcycle'. | typical |
| balance_workload | No | Distribute jobs evenly across vehicles. | |
| exploration_level | No | 'LOW' | 'MEDIUM' | 'HIGH'. | MEDIUM |
| solution_strategy | No | 'BEST_EFFORT' | 'FAST' | 'THOROUGH'. | BEST_EFFORT |
| use_time_balancing | No | Balance travel time across vehicles. | |
| use_traffic_multiplier | No | Apply live traffic to duration estimates. |