Column generation and local search for the profit-oriented hub-line location problem with elastic demands
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Population growth and city sprawl have been driving increasing amounts of traffic congestion in multiple major cities worldwide. In this scenario, developing efficient public transportation networks becomes critical to ensure adequate mobility. Hub network location models address the problems of designing public transit networks to model — and to optimize — passenger mobility. More specifically, hub-line location problems (HLLP) play an essential role in the design of rapid transit corridors and subway lines. In this work we address the profit-oriented hub-line location problem (ED-HLLP) for which we introduce a column generation method to solve the linear relaxation of a mixed-integer model and matheuristic that combines column generation and local search. The proposed methodologies lead to the calculation of primal and dual bounds. We assess the performance of the proposed methods on some classic datasets from the HLLP literature. Furthermore, we conduct a study based on real-world data representing the metropolitan area of Montreal, Canada. Finally, we conduct a sensitivity analysis to assess the major attributes driving our results, both from an algorithmic point of view as well as from a planning perspective. The numerical results show that the proposed methods produce high-quality solutions, reduce computational times, and address the model’s combinatorial complexity more effectively than a commercial off-the-shelf solver, allowing for the solution of larger problems otherwise untractable for the latter. • We introduce a column generation (CG) method for the ED-HLLP. • CG allows for the computation of strong dual bounds in moderate computing times. • Introduce a hybrid matheuristic that combines CG with local search (CG+LS). • CG+LS is capable of producing strong primal bounds in short computing times. • We perform a sensitivity analysis and derive managerial insights.
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.
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 it