- Rating
- 2(+1)
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes TaxiGPT, a framework for learning passenger-seeking policies for ride-hailing. The key idea is to decouple the knowledge required for passenger seeking into different parts.
Critical strengths
The problem analysis is good, clearly pointing out the significant challenge in the field.
Critical weaknesses
-
The problem setup is not clear enough. Providing a detailed MDP formulation would be beneficial.
-
The task of this paper is similar to relocation in ride-hailing. However, the proposed method only considers a single vehicle, neglecting system-level interactions.
-
The modeling in this paper lacks practicality. In fact, thousands of on-demand vehicles operate simultaneously in a city. An order near a driver does not mean the platform will dispatch it to that driver. It also depends on the spatiotemporal demand-supply relationship. Without a ride-hailing simulator evaluation or AB test, the current results lack convincing evidence.
-
The compared methods lack recent baselines.
Questions for authors
My major concern is weakness 3, regarding the validation and correctness of the story. If the authors could provide a clear explanation, I would like to increase my score.
3 comments
Thank you for your effort and response. Most of my concerns have been addressed, and I have increased my score to 2. However, I am still not convinced by the story. Intuitively, if too many vacant vehicles choose the same seek region, it may not be good for the overall system.
Thank you for taking the time to review and respond to our reply and increasing your score. We agree that excessive supply concentration can reduce system-wide efficiency. However, individual passenger seeking and fleet-level coordination are two well-established research problems with distinct optimization objectives, both of which continue to receive substantial research attention.
Individual passenger seeking optimizes a vacant vehicle's routing decisions to improve its own long-term return. This problem has been studied by O'Keeffe et al. (2022), Guo et al. (2024), and more recently Liu et al. (2025). Notably, O'Keeffe et al. explicitly evaluate a single RL taxi competing with other vehicles. In contrast, fleet-level repositioning addresses the coordinated spatial allocation of multiple vehicles to balance supply and demand, as studied by Beojone et al. (2024), Lyu et al. (2026), and Jusup et al. (2026).
TAXIGPT follows the established individual-seeking formulation, optimizing cumulative return across successive seek–serve cycles (Eq. 1). Our new competitive evaluation further accounts for interactions with other vehicles through finite, exclusively assigned requests. The original policy is evaluated across eight settings with different background policies and fleet densities, demonstrating its effectiveness under competing supply.
We respectfully hope that the contribution of TAXIGPT will not be discounted simply because it addresses individual passenger seeking rather than the distinct problem of fleet-wide coordination. Both are meaningful and actively studied research objectives. Requiring a single-vehicle seeking method to also optimize fleet-wide allocation would introduce an additional objective beyond its stated research problem.
We sincerely hope that the established literature, together with our additional competitive experiments, will help you reconsider your assessment of TAXIGPT within its intended research scope. Thank you!
Thank you for your precious time and review. We hope this could address your concern. We added both frozen-policy evaluation and adaptation in a finite-request, multi-vehicle environment, and clarify the individual-policy formulation below.
W1. Thank you for mentioning this. We will add a detailed MDP formulation in revised version. The process in Sections 3.1-3.3 is a leg-level semi-Markov decision process. Each seeking leg starts from sk=(ℓk,tk,wk) (location, time and day type). The action is a variable-length route τk=(ℓk,1,…,ℓk,Lk,EOT), executed until pickup or route termination. A pickup leads to the sampled service destination after seeking plus service time. Without pickup, the next leg starts at the route endpoint after a 15-minute wait. Equation (4) rewards service value and subtracts seeking cost. Equation (1) maximizes cumulative discounted reward.
In the competitive environment, the full state also includes the request pool and release schedule, plus other vehicles' locations and service status. TAXIGPT retains sk as its local observation, so the fleet-level state is partially observed.
W2. The learning objective and the presence of competing vehicles are separate questions. Our control decision is where a vacant vehicle should seek next, with the objective of improving that vehicle’s cumulative return. This individual-policy scope is shared with CAC, Guo and Chen (2024), and the focal RL taxi in O’Keeffe et al.’s (2022) hybrid fleet. A centralized dispatcher controls joint assignments across vehicles, which is a different decision scope. W3 explicitly adds competing supply and exclusive allocation while preserving our seeking-policy objective.
W3. Thank you for pointing this out. We added a multi-vehicle simulator in which a nearby request can be assigned to another vehicle. Historical completed trips serve as proxies for passenger requests. Each reconstructed request has a release time, pickup cell, destination and service duration, and remains available for up to 15 minutes. Vacant vehicles in its cell compete for assignment, and each request can be assigned only once. Once matched, the request is removed and the vehicle remains occupied until service completion, then resumes seeking at the destination. Pickup opportunities therefore depend on both the remaining requests and the competing vehicles' current locations and availability.
Following the hybrid-fleet setup of [1], background vehicles use either random-neighbor or training-demand-greedy policies. We test both at four fleet densities, giving eight settings with different levels and patterns of competition.
Evaluation without retraining. We freeze the original TAXIGPT checkpoint and test whether it still performs well when other vehicles can take nearby requests. The table compares learned policies across the eight settings:
All methods use the same 50 test scenarios. We average the eight settings within each scenario before calculating the profit differences and their 95% confidence intervals. TAXIGPT outperforms all three controls under competition, with all three intervals above zero.
Learning with competition. We also adapt the same mobility prior in the competitive environment. GRPO increases profit from 395.1 to 474.8 Yuan/episode, a paired gain of +79.7 [38.0, 126.7] Yuan. This result complements the frozen-policy evaluation: the original policy performs well when requests are contested, and adaptation also improves the prior when competition is included during learning.
W4. We added Guo et al.'s (2024) SARSA(lambda) seeking method [2] in its published fixed-price SL-1.0 setting, matching our monetary protocol. We also added pretrained Transformer-PPO with the same architecture, trajectory representation and R=10 support. W3 reports the results, providing recent domain coverage and a shared-interface learning comparison.
[1] O'Keeffe et al. (2022). Using reinforcement learning to minimize taxi idle times. [2] Guo et al. (2024). Seeking in Ride-on-Demand Service: A Reinforcement Learning Model With Dynamic Price Prediction.