mcpField
C
cuopt-routing-formulation

cuopt-routing-formulation

github.com/nvidiaData & databases3.8k1.3k installsUpdated today
Repository

About cuopt-routing-formulation

cuopt-routing-formulation is a domain-concepts skill for vehicle routing. It helps agents clarify whether a problem is TSP, VRP, or PDP and gather locations, orders, fleet details, and constraints; it provides no API or interface details.

Key features

  1. 01Distinguish TSP, VRP, and PDP
  2. 02Identify locations, depots, and cost data
  3. 03Specify order locations, demand, and service
  4. 04Define fleet size, capacity, and endpoints
  5. 05Collect time-window and precedence constraints

Use cases

  1. 01Classify a delivery problem as a routing model
  2. 02Prepare distance or travel-time matrices
  3. 03Organize vehicle capacities and order demands
  4. 04Clarify time windows, service times, and visit order

Install

Copy the command and run it in a terminal.

$npx skills add https://github.com/nvidia/skills --skill cuopt-routing-formulation

After installing, type/cuopt-routing-formulationin Claude Code to confirm it loaded.

Bundled files

References and scripts installed along with SKILL.md.

BENCHMARK.md
skill-card.md
skill.oms.sig
evals/
evals.json

Details

From the project README

Routing Formulation

Domain concepts for vehicle routing. No API or interface details here.

What is routing

  • TSP: Single vehicle, visit all locations once (e.g. shortest tour).
  • VRP: Multiple vehicles, capacity and/or time limits; assign orders to vehicles and sequence stops.
  • PDP: Pickup and delivery pairs; pickup must be visited before the corresponding delivery.

Required questions (problem and data)

Ask these if not already clear:

  1. Problem type — TSP, VRP, or PDP?
  2. Locations — How many? Depot(s)? Cost or distance between pairs (matrix or derived)?
  3. Orders / tasks — Which locations must be visited? Demand or service per stop?
  4. Fleet — Number of vehicles, capacity per vehicle (and per dimension if multiple), start/end locations?
  5. Constraints — Time windows (earliest/latest arrival), service times, precedence (order A before B)?

Typical data

  • Cost or distance matrix (or travel-time matrix).
  • Order locations and, for VRP, demand per order.
  • Vehicle capacities and optional time windows for vehicles and orders.

Comments

Markdown supported