C
cuopt-routing-formulation
About cuopt-routing-formulation
A domain skill for formulating vehicle-routing problems, covering TSP, VRP, and pickup-and-delivery problems. It helps identify the locations, tasks, fleet details, and constraints needed to describe a routing problem.
Key features
- 01TSP, VRP, and PDP concepts
- 02Location and depot data questions
- 03Task demand and service details
- 04Fleet capacity and endpoint details
- 05Time windows and precedence constraints
Use cases
- 01Classifying a routing problem as TSP, VRP, or PDP
- 02Gathering data needed for a routing model
- 03Identifying fleet and stop constraints
Install
Copy the command and run it in a terminal.
$
npx skills add https:/After installing, type/cuopt-routing-formulationin Claude Code to confirm it loaded.
Bundled files
References and scripts installed along with SKILL.md.
BENCHMARK.mdskill-card.mdskill.oms.sigevals/evals.jsonDetails
From the project READMERouting 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:
- Problem type — TSP, VRP, or PDP?
- Locations — How many? Depot(s)? Cost or distance between pairs (matrix or derived)?
- Orders / tasks — Which locations must be visited? Demand or service per stop?
- Fleet — Number of vehicles, capacity per vehicle (and per dimension if multiple), start/end locations?
- 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