Optimal Design of Integrated Semi-Flexible Transit Services in Low-Demand Conditions
Bibliographic record
Abstract
Semi-flexible transit (SFT) is commonly discussed as a cost-effective alternative to serving public transportation users in low-demand conditions. We hypothesize that joint optimization of service headway and slack time per trip for route deviation is essential for designing a schedule for the operation of an integrated SFT that can meet both fixed-route and paratransit demand. An integrated SFT has the potential to lower the cost of transportation for regular transit users (both operators and riders) while redirecting potential paratransit riders to less expensive transit modes; thus, reducing demand for overwhelmed paratransit services operating with limited resources. The optimization problem has three competing objectives: minimizing operator costs, minimizing user costs, and maximizing service benefits. Two state-of-the-art multi-objective evolutionary algorithms NSGA-II and SMPSO are compared to obtain the most representative deterministic Pareto optimal solution set. This study has three major contributions. First, quantile regression is used to suggest multiple slack time values for a given headway that transit planners can consider when generating a static schedule for SFT operation. Second, relationships derived to analyze cost trade-offs suggest that headway governs operator cost and is negatively correlated, user cost is positively and equally influenced by both variables, and slack time governs service benefit and is positively correlated. Third, sensitivity analysis for an integrated SFT operation reveals that low-capacity minivans and standard vans offer higher vehicle occupancy and cost efficiency, mostly economical for low to medium demand (5-20 pass/hr), low permissible deviation from the fixed route is desirable during peak hours to avoid delays for passengers on-board, and extreme weather conditions dramatically and negatively influence costs. Policy recommendations for integrated SFT implementation include a recommendation for fare structure design addressing service equity through surcharges/discounts, vehicle technology and service booking technology advancements for cost reduction, and fleet mix design through estimation of passenger loading profile. The application of the study methodology is demonstrated for a low-demand bus route in Regina, Canada.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 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".