Designing the Master Schedule for Demand-Adaptive Transit Systems
Bibliographic record
Abstract
Demand-Adaptive Systems (DAS) display features of both traditional fixed-line bus services and purely on-demand systems such as dial-a-ride, that is they offer demand-responsive services within the framework of traditional scheduled bus transportation. A DAS bus line serves, on one hand, a given a set of compulsory stops according to a predefined schedule specifying the time windows associated to each, providing the traditional use of the transit line, without requiring any reservation. On the other hand, passengers may also issue requests for transportation between two desired, optional, stops, which induces detours in the vehicle routes. The design of a DAS line is a complex planning operation that requires to determine not only its design in terms of selecting the compulsory stops, but also its master schedule in terms of the time windows associated to the compulsory stops. Designing a DAS thus combines elements of strategic and tactical planning. In this paper we focus on determining a master-schedule for a single DAS line. We propose a mathematical description and a solution framework based on the estimation of a number of statistical parameters of the demand and the DAS line service. Results of numerical experiments are also given and analyzed. Cooperation as problem-solving and algorithm-design strategy is widely used to build methods addressing complex discrete optimization problems. In most cooperative-search algorithms, the explicit cooperation scheme yields a dynamic process not deliberately controlled by the algorithm design but inflecting the global behaviour of the cooperative solution strategy. The paper presents an overview of explicit cooperation mechanisms and describes issues related to the associated dynamic processes and the emergent computation they often generate. It also identifies a number of research directions into cooperation mechanisms, strategies for dynamic learning, automatic guidance, and self- adjustment, and the associated emergent computation processes.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".