MétaCan
Menu
← Back to cohort
Record W4402938335 · doi:10.1155/2024/5416014

Bilevel Optimization of Regular Bus‐Subway‐Shared Bicycle Cooperative Operation considering Dual Uncertainties

2024· article· en· W4402938335 on OpenAlexvenueno aff
Yunqiang Xue, Tong He, Tao Li, Hongzhi Guan, Yang Qiu

Bibliographic record

VenueJournal of Advanced Transportation · 2024
Typearticle
Languageen
FieldSocial Sciences
TopicUrban Transport and Accessibility
Canadian institutionsnot available
FundersNatural Science Foundation of Jiangxi ProvinceNational Natural Science Foundation of China
KeywordsBilevel optimizationDual (grammatical number)Computer scienceAutomotive engineeringTransport engineeringEngineeringOptimization problemAlgorithm

Abstract

fetched live from OpenAlex

The primary objective of this paper is to minimize the overall travel costs for passengers while simultaneously maximizing the operational revenue for the transportation company. This is achieved through the optimization and adjustment of various factors, such as the intervals between regular bus and subway services, the duration of vehicle stops at each station, and the pricing structure for subway and shared bicycle usage. By enhancing the efficiency of passenger travel, we have successfully bolstered the company’s operational profits. In contrast to prior research, this paper comprehensively considers the dual uncertainties associated with both bus operations and shared bicycle operations within a cooperative system. By establishing a coordinated dual‐level optimization model for regular bus, subway, and bike‐sharing networks under dual uncertainty conditions, we employed convex combination techniques to unify the dual uncertain variables into a single objective, which was then incorporated into a chance‐constrained bilevel programming model. Ultimately, we utilized KKT conditions to transform the model from a bilevel to a single level for resolution. This paper centers its research on the collaborative system comprising the Nanchang Metro Line 1, Bus Route 520, Bus Route 211, and the adjacent region hosting a cluster of shared bicycles. By leveraging Python programming, optimization models, empirical data on traffic flow and stoppage times, and OD data, we conducted an optimization analysis to solve the problem at hand. According to the optimization results, passenger waiting time, passenger transfer time, and passenger on board time are effectively reduced by 6.81%, 18.29%, and 23.92%. At a confidence level of 95%, the resulting time level results in a 12.44% reduction in total travel time. The average subway fare increased by 18.12%, the average shared bicycle fare decreased by 19.12%, and the total cost of travel expenses increased by 16.68%. The final total cost of travel was reduced by 4.06%, and the business operating income was increased by 13.10%. The comprehensive optimization results have effectively fulfilled the objectives of the bilevel optimization model, thereby confirming the rationality and practicality of the optimization approach. The research outcomes hold significant practical implications for facilitating the efficient and cooperative development of urban transportation networks, ultimately enhancing the convenience of residents’ travel experiences.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.017
Threshold uncertainty score0.034

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0020.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.022
GPT teacher head0.304
Teacher spread0.281 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations2
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Advanced Transportation→Same topicUrban Transport and Accessibility→French-language works237,207→