A Slack Departure Strategy for Demand Responsive Transit Based on Bounded Rationality
Bibliographic record
Abstract
Demand responsive transit (DRT) is emerging as one of the most potential travel modes to satisfy flexible travel demands. Nevertheless, how to attract more passengers has become a critical problem in the success of DRT projects. It is necessary to take into account the psychological factors impacting passengers’ choices. The study proposes a slack departure strategy considering boundedly rational passengers, which introduces passengers’ decision-making psychology into the optimization process. The strategy can adjust the departure time of passengers to adjacent time windows. The discount-incentive mechanism is presented to attract passengers to accept the changes while maintaining the quality of service. On this basis, the theory of bounded rationality is applied to describe the decision-making process of passengers. We construct a multiobjective programming model to analyze the operator-passenger interactive effect. To address the multiobjective problem, a two-phase heuristic algorithm is established to get the Pareto solution for the model. A numerical experiment is carried out on the Sioux Falls network. The case study of Beijing is discussed to evaluate the effectiveness of the strategy. The results indicate that the slack departure strategy can significantly benefit both the operators and passengers. The operating profit substantially increases by up to 63%. Meanwhile, the passenger’s general travel cost declines by 12%. The optimal discount rate of the incentive mechanism is 20%. Therefore, the study contributes to comprehending the passenger’s decision-making psychology and providing a new optimization strategy for the operator of DRT.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".