- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents RideSkill, a hierarchical framework for generalized ride-sharing with offline LLM-assisted algorithm evolution. Instead of using LLMs directly for online decision making, the framework uses them during training to evolve reusable dispatching and repositioning strategies, which are then deployed without further LLM calls. The method is designed to adapt to changes in operating conditions, such as fleet size, vehicle speed, passenger capacity, and demand patterns, as well as different platform objectives. Experiments on RideGym with NYC taxi data compare RideSkill against classical matching methods, MARL baselines, and prior LLM-based approaches. The reported results show consistently strong performance across these settings, with additional ablations examining objective adaptation, repositioning, and fairness.
Critical strengths
-
The decomposition into reusable scoring skills, an objective-conditioned combiner, and a sequential repositioner is intuitive and practically motivated. In particular, using the LLM only during offline algorithm search avoids the inference latency and cost associated with LLM-based online dispatch, which is important for large-scale real-time mobility systems.
-
The paper evaluates the method across multiple operational axes, including fleet size, vehicle speed, capacity, time periods, and objectives, and includes useful ablations on the combiner, repositioner, fairness mechanism, objective conditioning, and the choice of the underlying LLM. In particular, the comparison between an objective aware policy and an otherwise identical objective blind policy is a useful diagnostic for verifying that the combiner actually responds to the supplied objective.
Critical weaknesses
-
The methodological novelty is somewhat limited, as the proposed framework mainly combines several intuitive and established components rather than introducing a clearly new learning or optimization principle. The proposed framework combines several intuitive and well-established components, including skill-based scoring, bipartite matching, sequential repositioning, evolutionary search, and LLM-based program generation. While these components are integrated coherently for the ride-sharing setting, the overall method feels more like a combination of existing techniques than a substantially new learning framework. In particular, the hierarchical decomposition, objective-conditioned skill selection, and LLM-guided evolution are all reasonable design choices, but individually they are fairly intuitive, and their combination does not clearly introduce a fundamentally new algorithmic principle. As a result, I find the methodological contribution less compelling from a novelty perspective, despite the practical effectiveness of the system.
-
The empirical setup does not convincingly support the paper's central claim of generalized adaptation across scenarios and objectives. RideSkill is explicitly optimized on a diverse distribution of scenarios and objectives, whereas the MARL baselines are trained only on a single anchor condition (fleet size 1,000, capacity 4, speed 35 km/h, and one anchor objective) and are then evaluated under distribution shifts. Consequently, the reported OOD advantage conflates the proposed architecture with substantially broader training exposure. A much more informative comparison would be against goal-conditioned, multi-task, domain-randomized, or otherwise generalized RL baselines trained with the same scenario/objective distribution. Without such comparisons, the experiments do not establish that the proposed method itself is responsible for the claimed generalization advantage.
Questions for authors
-
Can the authors provide a comparison in which generalized learning baselines are trained under the same distribution of scenarios and objectives as RideSkill?
-
What is the precise class of objectives for which the proposed objective probing mechanism is expected to work?
2 comments
Response Part 2
Q2. Objective class and probing
Thank you for your insightful comment. We clarified the supported objective interface and the identifiability condition for objective probing in Appendix F. The interface accepts deterministic functions of the declared per-vehicle step-event fields, fixed within an episode, including nonlinear terms and within-event interactions. Natural-language preferences are translated into this callable before rollout, and the same function supplies event rewards and probe responses. Episode return sums these event rewards; episode-level ratios, accumulated thresholds, and history-dependent rates require sufficient event/state information or an explicit approximation.
The combiner uses reward responses to a finite set of synthetic events to select and blend skills. For a linear feature family,
fix the context, query events, and linear preprocessing. The observed probe responses then satisfy
where B is the probe-feature matrix after preprocessing. Let the rows of D contain cumulative feature differences between relevant feasible trajectories. Probe-equivalent objectives preserve these return contrasts for every coefficient vector exactly when
Full column rank of B identifies all coefficients in exact arithmetic. The condition states precisely when the probes identify the return contrasts needed to distinguish those trajectories.
The released program's diagnostics identify confounded assignment-bonus and some party-price directions, together with mixed response channels. Two callables with the same probe transcript in the same context induce the same routing, even if they differ on unqueried events. The router's response to distinguishable objectives then depends on its learned composition logic and the behaviors available in the frozen skill library.
Appendix F.1, “Objective interface and finite-probe identifiability,” gives these conditions and diagnostics. Appendix D, “Objective Response,” reports observed responses to pickup-time and detour-time rewards and natural-language long-trip and detour objectives.
Response Part 1
Thank you for the review. Substantive manuscript changes are marked in blue.
W1. Methodological contribution
Thank you for your insightful comment. RideSkill contributes an application-inspired discovery-to-composition mechanism for ride-sharing. General LLM-guided evolution supplies the program-search operators; RideSkill uses them to discover reusable vehicle–order scoring skills, learns a combiner that selects and blends these skills for each vehicle according to its state, the operating scenario, and the platform objective, and then repositions idle vehicles. This makes the discovered behaviors reusable across changing dispatch conditions and objectives.
The skill–combiner design follows the structure of ride-sharing. An idle vehicle can prioritize pickup efficiency, a loaded vehicle must protect existing passengers' routes, and a vehicle with little time slack needs a different assignment preference. Platform priorities also change across operating periods. A library of basic skills captures these distinct behaviors, while conditional composition determines which behaviors each vehicle should use in the current setting. General program-evolution methods can generate dispatch policies; the additional mechanism here is the discovery and conditional composition of reusable dispatch skills, rather than evolving a single scoring program for a fixed task. This is the methodological distinction from the general LLM-search methods and the adapted ride-hailing comparator discussed in Appendix A.
Sections 3.2–3.3 specify the skill interface, conditional composition, and sequential repositioning. Appendix E, “Analysis,” reports the controlled module comparisons. The contribution is this transportation-specific representation and adaptive reuse of skills within a complete dispatch algorithm.
W2/Q1. Generalized RL comparison with matched task support
Thank you for your insightful comment. We added REDA-MT, a scenario- and objective-conditioned multi-task REDA policy, on the same finite task support as the added Phase-2 search. On the Table 1 grid under the anchor objective, its mean Reward is 58.6–68.6% lower than anchor-trained REDA across the four scenario groups in Table 9 (Appendix D.10), and RideSkill has higher mean Reward than both REDA policies. This directly evaluates a shared RL policy trained across the varied scenarios and objectives.
REDA-MT shares one network, target network, optimizer, and replay buffer across five objective families, with 136–1,989 vehicles, capacities 1–10, and speeds 25.40–44.96 km/h. It receives reward-probe responses and scenario/preference fields; the supplied callable generates both probe responses and environment rewards. REDA-MT was trained for 126 episodes and anchor REDA for 500; we evaluate the multi-task policy's fixed final checkpoint, whose validation return was non-monotonic during training. RideSkill includes repositioning, while both REDA policies are dispatch-only.
Below we show Hour and Fleet size; Table 9 in Appendix D.10 reports all four scenario groups. Each group first averages three environment seeds per configuration, then reports the mean and population standard deviation across configuration means. Service rate, completion rate, and utilization are fractions; times are minutes.
In this comparison, broadening REDA’s task support did not recover RideSkill’s performance. Changes in fleet size, capacity, and speed alter feasible assignments and transition dynamics, while changes in objectives alter reward scales. Including context in the state identifies the setting but still requires the network to learn effective behavior throughout that range. REDA-MT's non-monotonic validation and lower anchor-objective return are consistent with this optimization difficulty. This is a comparison on shared task support under the training budgets and deployment components described above. Table 9 in Appendix D.10, “Multi-task reinforcement-learning comparison,” reports the full seven-metric results.