cuopt-routing-formulation
Compare original and translation side by side
🇺🇸
Original
English🇨🇳
Translation
ChineseRouting Formulation
路径规划模型构建
Domain concepts for vehicle routing. No API or interface details here.
车辆路径规划的领域概念介绍。此处不涉及API或接口细节。
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.
- TSP：单车辆，遍历所有地点一次（例如最短路径）。
- VRP：多车辆，存在容量和/或时间限制；需将订单分配给车辆并规划停靠顺序。
- PDP：取货与送货配对；取货必须在对应送货之前完成。
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)?
若以下信息不明确，请确认：
- 问题类型——是TSP、VRP还是PDP？
- 地点——数量多少？是否有仓库？地点间的成本或距离（矩阵形式或推导得出）？
- 订单/任务——哪些地点必须访问？每个停靠点的需求或服务内容？
- 车队——车辆数量、单辆车的容量（若为多维度则需各维度容量）、起始/结束地点？
- 约束条件——时间窗口（最早/最晚到达时间）、服务时长、优先级（A任务需在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.
- 成本或距离矩阵（或行程时间矩阵）。
- 订单地点，以及VRP场景下的每单需求。
- 车辆容量，以及车辆和订单的可选时间窗口。