routing-formulation
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:
- 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.
More from nvidia/cuopt
cuopt-lp-milp-api-cli
LP and MILP with cuOpt — CLI only (MPS files, cuopt_cli). Use when the user is solving from MPS via command line.
2cuopt-lp-milp-api-c
LP and MILP with cuOpt — C API only. Use when the user is embedding LP/MILP in C/C++.
2cuopt-user-rules
Base behavior rules for using NVIDIA cuOpt. Read this FIRST before any cuOpt user task (routing, LP/MILP, QP, installation, server). Covers handling incomplete questions, clarifying data requirements, verifying understanding, and running commands safely.
1cuopt-qp-api-c
Quadratic Programming (QP) with cuOpt — C API. Use when the user is embedding QP in C/C++.
1cuopt-developer
Contribute to NVIDIA cuOpt codebase including C++/CUDA, Python, server, docs, and CI. Use when the user wants to modify solver internals, add features, submit PRs, or understand the codebase architecture.
1cuopt-qp-api-cli
QP with cuOpt — CLI (e.g. cuopt_cli with QP-capable input). Use when the user is solving QP from the command line.
1