A revised branch‐and‐price algorithm for dial‐a‐ride problems with the consideration of time‐dependent travel cost
Bibliographic record
Abstract
Summary Developing demand responsive transit systems are important with regard to meeting the travel needs for elderly people. Although Dial‐a‐ride Problems (DARP) have been discussed for several decades, most researchers have worked to develop algorithms with low computational cost under the minimal total travel costs, and fewer studies have considered how changes in travel time might affect the vehicle routes and service sequences. Ignoring such variations in travel time when design vehicle routes and schedules might lead to the production of inefficient vehicle routes, as well as incorrect actual vehicle arrival times at the related nodes. The purpose of this paper is to construct a DARP formulation with consideration of time‐dependent travel times and utilizes the traffic simulation software, DynaTAIWAN, to simulate the real traffic conditions in order to obtain the time‐dependent travel time matrices. The branch‐and‐price approach is introduced for the time‐dependent DARP and tested by examining the sub‐network of Kaohsiung City, Taiwan. The numerical results reveal that the length of the time window can significantly affect the vehicle routes and quantitative measurements. As the length of the time window increases, the objective value and the number of vehicles will reduce significantly. However, the CPU time, the average pickup delay time, the average delivery delay time and the average actual ride time (ART)/direct ride time (DRT) will increase significantly as the length of the time window increases. Designing the vehicle routes to reduce operating costs and satisfy the requirements of customers is a difficult task, and a trade‐off must be made between these goals. Copyright © 2014 John Wiley & Sons, Ltd.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.015 | 0.002 |
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".