ortools-pickup-delivery-routing

ortools-pickup-delivery-routing is a skill for Claude Code, Codex from benchflow-ai/skillsbench. It costs 64 tokens per session (1,630 once invoked), scanned A, original, Apache-2.0.

A guide to routing jobs that have a required pickup and dropoff, such as deliveries, courier work, or passenger transport.

In plain words
What is it for?
Use it to model paired transport requests, delivery time windows, vehicle capacity, optional service, and connected groups of jobs.
Why use it?
It enforces rules such as using the same vehicle and visiting the pickup before the dropoff, which ordinary route models may not capture.

Skill for Claude CodeCodex

Written for no agent in particular: nothing here depends on one.

Good fit Use it to model paired transport requests, delivery time windows, vehicle capacity, optional service, and connected groups of jobs.

Compare 6 skills from other repositories ↓
Install with agentmods
npx agentmods add skills/benchflow-ai/skillsbench/ortools-pickup-delivery-routing
About the project

SkillsBench is a benchmark for measuring how effectively AI agents use modular skills—folders containing instructions, scripts, and resources—to complete specialized tasks. It helps researchers and developers evaluate both skill quality and agent behavior, including tasks that require combining multiple skills. The catalogue’s skills and instructions are evaluated as part of this workflow.

benchflow-ai/skillsbench · 1,764 stars · on GitHub · skillsbench.ai

Install

Getting it into your agent

One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.

Any agent
npx skills add benchflow-ai/skillsbench --skill ortools-pickup-delivery-routing
Clone the repo
git clone --depth 1 https://github.com/benchflow-ai/skillsbench

Made for: Claude Code, Codex.

Wrote this? Show the measurements

A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.

agentmods badge for ortools-pickup-delivery-routing

README.md
[![agentmods](https://agentmods.dev/badge/skills/benchflow-ai/skillsbench/ortools-pickup-delivery-routing/github.svg)](https://agentmods.dev/skills/benchflow-ai/skillsbench/ortools-pickup-delivery-routing)
Your own site
<a href="https://agentmods.dev/skills/benchflow-ai/skillsbench/ortools-pickup-delivery-routing"><img src="https://agentmods.dev/badge/skills/benchflow-ai/skillsbench/ortools-pickup-delivery-routing/github.svg" alt="Measured on agentmods" height="20"></a>

Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.

agentmods 80×15 button for ortools-pickup-delivery-routing

Your own site · 80×15
<a href="https://agentmods.dev/skills/benchflow-ai/skillsbench/ortools-pickup-delivery-routing"><img src="https://agentmods.dev/badge/skills/benchflow-ai/skillsbench/ortools-pickup-delivery-routing.svg" alt="Reviewed on agentmods" width="80" height="20"></a>
Per session 64 Skills are progressive disclosure: only the name and description are preloaded; the body loads when the skill is used.
When invoked 1,630 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. A grade says what 26 rules found in the file — not that it is safe. Third-party audits
  • NVIDIA SkillSpector pass 7 Sept 2026
How audits are shown
Origin original No closer match found in the catalogue.
Token cost

What it costs to keep this loaded

Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.

ModelPer sessionOnce invoked
Fable 5.1 $0.00064 $0.01630
Opus 5 $0.00032 $0.00815
Sonnet 5 $0.00013 $0.00326
Haiku 4.5 $0.00006 $0.00163

Measured 9d ago against content hash cad3ae9d92bd, method: parsed. Prices are Anthropic first-party input rates as of 2026-09-12, from the pricing page.

Security

Grade A, and why

ortools-pickup-delivery-routing scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 9d ago.

A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.

Nothing flagged

None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.

Origin

Copies of this mod

1 near-identical copy found in the catalogue:

tasks/paratransit-routing/environment/skills/ortools-pickup-delivery-routing/SKILL.md · 129 lines

How it starts

The opening of the file, as written. The whole thing — 129 lines — stays where its author put it; the contents beside it link to each section on GitHub.

Pickup And Delivery Routing

Use this skill when each job has related pickup and dropoff or delivery events that must be served together. Apply it after the base routing model has a time dimension and before solving.

Implementation Flow

  1. Create one pickup node and one dropoff node per job.
  2. Add same-vehicle and precedence constraints for every pair.
  3. Apply the customer-facing time windows and service-time convention from the problem statement.
  4. Choose optional-service handling: independent pairs, or connected request sets.
  5. After solving, postprocess connected sets, rebuild route sequences if needed, and re-audit feasibility before counting served jobs or writing output.

Pair Structure

  • Represent pickup and dropoff as separate service nodes connected by a shared job ID.
  • Pickup demand is positive; dropoff demand is negative. Depot nodes have zero demand and zero service time.
  • Add routing.AddPickupAndDelivery(pickup_index, dropoff_index) for each pair.
  • Add explicit constraints for the actual business rules:
    • same vehicle: routing.VehicleVar(pickup_index) == routing.VehicleVar(dropoff_index)
    • pickup before dropoff: time_dimension.CumulVar(pickup_index) <= time_dimension.CumulVar(dropoff_index)

Time Windows And Service Times

  • Apply customer time windows to the service event promised to the customer. Appointment and dial-a-ride problems often constrain dropoff arrival; pickup windows can be derived by subtracting direct pickup-to-dropoff travel time from the dropoff window.
  • If a problem statement gives explicit pickup and dropoff time-window formulas, implement those formulas directly. Service time belongs in the time transit from a node to the next node; do not change the stated window formula to compensate for service time unless the problem explicitly says to.

Pair Constraint Skeleton

Use this pattern after adding the time dimension. It enforces the paired-service relationship for each job. Add optional-service logic separately after deciding whether jobs are independent pairs or members of connected request sets.

Read the full file on GitHub · 129 lines

Changes

What this file has done since we first saw it

Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.

  1. 9d ago First seen · 129 lines · 64 tokens per session scan A cad3ae9d92bd

Subscribe to this mod's changes

ortools-pickup-delivery-routing is a skill published in the GitHub repository benchflow-ai/skillsbench (1,764 stars, last pushed 1mo ago), licensed Apache-2.0. It adds 64 tokens to every session and 1,630 once invoked, about $0.0003 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-09-03.