- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes OT-Dispatch Net, a bilevel sequential framework for DmTSP. The proposed method can simultaneously tackle the optimal dispatch amount and the dispatch solution. Experiments on synthetic and New York ride-hailing prove the efficiency of the proposed method.
Critical strengths
-
The proposed method seems good, with clear mathematical guarantees, and addresses a real and complex problem. Many previous methods fail to jointly optimize the dispatch amount and decision.
-
The writing is clear and well structured.
Critical weaknesses
-
The motivation of this paper, especially the criticism of previous works, is not clear enough. Many order dispatch solutions in the ride-sharing and food delivery fields have already taken the amount factor into consideration by encoding the onboard orders into the observation and designing proper order bundling methods.
-
In the experiments, the setup is too naive. Mostly, in ride-hailing simulation with the NYC dataset, we consider the number of agents from hundreds to ten thousand. It is unclear what the scaling capacity of the proposed method is.
-
Comparisons to recent order dispatch solutions in ride-sharing and food delivery are missing.
Questions for authors
My major concern is whether the proposed method can be trained successfully in real large-scale scenarios. In practical mTSP tasks, the main challenge is that the large dimension caused by the number of trips and vehicles hinders efficient training.
2 comments
Thank you for your efforts and response. My concerns are fully addressed and I increase my score to 3.
Dear Reviewer FUW7,
Thank you for the detailed and constructive review. We address each point below.
To W1:
Our motivation is to improve dispatch decisions by jointly representing allocation quantities and assignment preferences. To this end, we propose an OT-based dispatch framework that jointly learns these two components and couples them through marginal constraints.
Admittedly, existing ride-sharing and food-delivery methods account for workload. NeurADP [3] encodes accepted requests as an ordered sequence with remaining delay information, OSPO [1] represents onboard orders and remaining capacity, and DOUBLE-PDF [2] incorporates order bundling. We have added a paragraph in Related Work to discuss these mechanisms and clarify how OT-Dispatch Net differs from these methods.
In these matching-based methods, onboard-order information informs assignment scores, and the number of new requests each agent receives follows from matching. OT-Dispatch Net makes the target allocation share an explicit policy output. It jointly learns each agent’s share of the incoming batch and agent–request costs, then couples them through entropic OT marginal constraints. A soft-quota decoder produces executable assignments, and both outputs are trained using downstream service rewards.
To strengthen our motivation, two results support this distinction. Fixing the marginal to uniform worsens AvgWait and Makespan in all three ablation settings (Figure 2), and our method outperforms the adapted OSPO and DOUBLE-PDF baselines (Table 11).
To W2 and the question on scalability:
Motivated by the fleet sizes considered in the ride-sharing and food-delivery literature, we have extended the NYC evaluation to fleets of 50 to 1,000 agents in Appendix D.8, Table 11 (revised PDF).
For M=50,100,200, OT-Dispatch Net is trained at the corresponding fleet size on synthetic data and evaluated on NYC instances. Figure 5 shows the training reward curve at M=200.
Training throughput is limited by CPU rollouts, including the routing backend; training at M=200 takes about 35 hours. We could not complete direct training at M=500 or 1,000 during rebuttal. The M=200 experiment nevertheless demonstrates training at a substantially larger scale than the original 5–10-agent settings.
Larger fleets use hierarchical task clustering (HTC; Section 4.5, Appendix C, Algorithm 2), which requires no retraining. HTC uses a trained policy to recursively partition requests, repeatedly splitting the cluster with the largest estimated workload before matching partitions to agents. The original submission used the same procedure to deploy the M0=5 policy at M=20 (Table 1).
With HTC, mean AvgWait is 66.84 and 67.37 at M=500 and 1,000, and mean Makespan is 529.20 and 563.50, over 20 NYC instances per setting. At M=200, the directly trained policy achieves 58.27 and 497.34. Dispatch latency increases from approximately 222 ms to 1.7 s and 5.4 s. HTC therefore enables deployment at 1,000 agents, with moderately higher waiting and completion times than the M=200 setting and increased computation time.
To W3:
Following your suggestion, we reviewed the ride-sharing and food-delivery literature and selected OSPO [1] and DOUBLE-PDF [2] as additional baselines. Table 11 reports these comparisons. OT-Dispatch Net achieves the lowest AvgWait, Makespan, and dispatch latency at every evaluated fleet size. Relative to OSPO, the stronger baseline, AvgWait is 38.5–46.4% lower and Makespan is 17.3–21.8% lower; OSPO takes 3.5–5.1 times as long for dispatch.
Both baselines are adapted to single-location DmTSP requests and trained with the same weighted Makespan and waiting-time objective. We retain OSPO’s shared MLP, policy update rule, and Hungarian matching, and DOUBLE-PDF’s BiLSTM, attention scoring, critic updates, and matching mechanism. DOUBLE-PDF’s payment branch is disabled. Appendix D.8 (revised pdf)provides the adaptation details.
Thank you again for your detailed review. We welcome suggestions for any relevant work we may have overlooked.
References
[1] Zijian Zhao and Sen Li. One Step is Enough: Multi-Agent Reinforcement Learning Based on One-Step Policy Optimization for Order Dispatch on Ride-Sharing Platforms. NeurIPS 2026.
[2] Zijian Zhao and Sen Li. Discriminatory Order Assignment and Payment-Setting of On-Demand Food-Delivery Platforms: A Multi-Action and Multi-Agent Reinforcement Learning Framework. Transportation Research Part E 2026.
[3] Sanket Shah et al. Neural Approximate Dynamic Programming for On-Demand Ride-Pooling. AAAI 2020.