Analyzing Rail Traffic Diversion Based on Machine Learning Technique considering Transportation Security
Bibliographic record
Abstract
Based on a stated preference survey, we comprehensively analyze the travel psychology of residents and the advantages and disadvantages of rail transit and conventional buses, travel time, travel cost, travel security, and vehicle comfort and investigate the relationship between the relevant influencing factors and the transition probability from rail transit to buses. A stochastic utility theory is introduced to describe the transfer behavior pertaining to travel modes, and a binary Logit model for diversion transfer is constructed. The decision tree is also used to predict the diversion transfer. Then, based on the large amount of travel willingness data obtained through the stated preference survey, a maximum likelihood estimation method is used to calibrate the parameters of the binary Logit model. The performance of the binary Logit proves to be better than that of the decision tree. Results show that the travel time most notably affects the passenger flow transfer, followed by the vehicle comfort. Finally, Guangzhou Rail Transit Line 3 is considered an example, and the diversion route planning and design are performed according to the constructed diversion transfer probability model to verify the effectiveness and practicability of the model. The research provides an effective theoretical basis and technical reference for other cities to perform rail traffic diversion planning. Based on these results, the following suggestions can be made: (1) the organization of public transportation routes, delivery volume, and travel speed outside should be improved; (2) undertaking combined operation of bus and rail transportation and integrated development is preferred; (3) the transportation management should focus on the comprehensive function development and hardware support of public transportation stations. The convenience and comfort of rail transit are closely related to the facilities and functions of the stations and their connections, which should be highly valued.
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.002 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".