Pith. sign in

REVIEW 3 major objections 6 minor 46 references

Public transport line planning can be done at city scale with demand that responds to service quality; the optimal networks favor fewer, far more frequent lines, and hinge on the measured demand elasticity.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-02 05:41 UTC pith:A5Z2YML7

load-bearing objection Worth a serious look for the method; don't cite the ridership numbers without checking the calibration sensitivity. the 3 major comments →

arxiv 2607.13263 v1 pith:A5Z2YML7 submitted 2026-07-14 math.OC

An ALNS Heuristic for Large-Scale Line Planning with Mode Choice and Line Generation

Siv Marie Cartland Hansen , Richard Martin Lusby , Rowan Hoogervorst , Otto Anker Nielsen This is my paper
classification math.OC MSC 90B0690C59
keywords line planningpublic transportadaptive large neighborhood searchendogenous demandmode choicedynamic line generationlogit modelfrequency setting
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper sets out to show that public transport line planning can be optimized at realistic city scale even when passenger demand is allowed to respond to the quality of the service offered. The authors develop an adaptive large neighborhood search algorithm that jointly selects lines, sets frequencies, routes passengers, and estimates mode choice through a logit model, generating new lines dynamically during the search rather than relying on a fixed candidate set. Applied to the Odense, Denmark bus network with about 1,800 origin-destination pairs, the algorithm produces networks that concentrate service into fewer, more frequent lines — average headways fall from roughly 41 minutes to 6.8–13 minutes — and captured public transport demand rises from about 8% of total trips to 12–32% depending on the subsidy level. The paper further shows that the resulting network design is sensitive to the assumed demand elasticity, swinging from a 5-line network at low sensitivity to a 28-line network at high sensitivity, which is why the authors argue careful demand calibration is essential.

Core claim

The paper's central claim is that a matheuristic based on adaptive large neighborhood search can solve line planning with endogenous demand, dynamic line generation, and passenger assignment on a real network of roughly 1,800 origin-destination pairs — beyond what exact methods can handle. The optimized line concepts concentrate resources on fewer, higher-frequency services, cutting average headways from about 41 minutes to 6.8–13 minutes and lifting captured public transport demand from about 8% to 12–32% of total trips depending on subsidy. Network structure is highly sensitive to the logit elasticity beta: 0.02 yields about 5 lines, 0.05 about 20, and 0.10 about 28. The authors take this

What carries the argument

The key mechanism is the coupling of an ALNS metaheuristic with an embedded evaluation loop. Destroy and repair operators (removing, shortening, extending, and adding lines) modify a line concept; a local search procedure adjusts operating frequencies by estimating marginal objective improvements; and each candidate solution is evaluated by a column-generation-based fixed-point heuristic that alternates between solving a capacitated multi-commodity passenger flow and updating OD-specific demand via a logit mode-choice function. The logit function — with OD-specific constants calibrated to observed demand and a fixed sensitivity beta — is what links service quality to demand, making ridership

Load-bearing premise

The demand response is governed by a single fixed elasticity parameter and OD-specific constants calibrated to observed demand under current operations, plus a 5% floor on baseline mode shares; if these values misrepresent how travelers actually switch modes, the optimized networks and their ridership gains are artifacts of the calibration.

What would settle it

Measure the actual mode-choice elasticity for the Odense area from smart-card or survey data, re-run the optimization with the estimated parameter and re-calibrated constants, and compare the resulting network. If the real elasticity is at or below about 0.02, the model itself indicates only about 5 lines would be optimal — meaning the paper's central 'fewer, higher-frequency lines' conclusion would collapse.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

Share X Bluesky LinkedIn Reddit HN

If this is right

  • If the optimization is correct, a city can cut average headways from roughly 41 minutes to 6.8–13 minutes by operating fewer lines, giving riders much shorter waits without necessarily adding vehicles at low subsidy levels.
  • Because lines are generated dynamically during the search, planners no longer need to pre-specify a candidate line pool; the initial line pool only seeds the search rather than constraining the final design.
  • Captured public transport demand rises from about 8% to 12–32% as the per-passenger subsidy increases, producing a cost-ridership frontier that a transport authority could use to set investment levels.
  • The three-hour runtime on a real network with about 1,800 origin-destination pairs suggests the approach is practical for routine planning studies rather than only one-off research.
  • The wide variation in optimal networks across the logit elasticity parameter (5 to 28 lines) means the demand-model calibration is a central input to planning, not a detail.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The paper's headline ridership gains are outputs of a demand model calibrated to observed trips with a fixed sensitivity parameter and a 5% baseline floor; if the true elasticity lies outside the 0.02–0.10 range, the absolute numbers — and possibly the qualitative 'fewer, more frequent lines' recommendation — would change.
  • Because the calibration only covers OD pairs present in the observed data, the model cannot represent latent trips induced by the improved service; the reported ridership increases may be a lower bound if new trips appear.
  • The paper shows that a threshold-based mode-choice model produces sparse networks that look good under its own assumptions but perform poorly when re-evaluated with the logit model; this suggests that re-evaluation under a common model, as the paper does, is a useful check for any demand-responsive planning study.
  • The algorithm's dependence on the initial solution (baseline operations vs a constructive heuristic) suggests that running several restarts and taking the best network, or combining solutions, would make the planning recommendation more robust.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper proposes an Adaptive Large Neighborhood Search (ALNS) matheuristic for public transport line planning with endogenous demand. The model is an MINLP that jointly chooses lines and frequencies, routes passengers on a Change & Go network, and determines the PT mode share with a logit function. The algorithm combines destroy/repair operators, a frequency-setting local search, and an embedded fixed-point column-generation heuristic for passenger assignment and demand estimation. It is evaluated on the Odense, Denmark, bus network with 1,826 OD pairs. The authors report that the optimized networks reduce average headways from about 41 minutes to 6.8–13 minutes and increase PT share from about 8% to 12–32%, while emphasizing that the resulting designs are sensitive to passenger-behavior assumptions.

Significance. If the algorithmic claims hold, this is a useful step toward practical line planning with demand responsiveness, dynamic line generation, and frequency optimization at a scale beyond exact methods. The paper is strong in its presentation: the MINLP is clearly written, the ALNS and construction heuristic are given in pseudocode, and the experiments include ablated operators, replicated runs, convergence plots, and alternative routing and demand assumptions. The authors are also transparent about the sensitivity of their results. However, the headline ridership figures are outputs of a demand model calibrated to the baseline by construction, with a hand-set elasticity and an unestimated share floor; moreover, the formal capacity constraint appears dimensionally inconsistent. These issues affect the quantitative conclusions and must be resolved before the paper can be accepted.

major comments (3)
  1. [§5.1.3, Eq. (11), Table 5] The demand model is calibrated so that the baseline PT share is reproduced by construction: total demand is set as b_wd = q_obs_d / p_obs_d, where p_obs_d is obtained from Eq. (11) with α_d=0 and a 5% floor, and α_d is then fitted so the logit model reproduces the observed baseline share. The baseline ~8% share is therefore not a model prediction, and all out-of-sample ridership gains are governed mainly by the hand-set β_d=0.05 and the 5% floor. Table 5 shows the stakes: at β_d=0.02 the optimized network serves 1,460 PT passengers (below the observed baseline of 4,885), while at β_d=0.10 it serves 30,675; line counts vary from 5 to 28 and vehicles from 35 to 472. The abstract and conclusion state that the optimized networks "substantially increase" ridership. This is not robust: it holds only for the middle value of an unestimated parameter. Please either estimate β_d and the floor from
  2. [§3.4, Eq. (6); §3.1–§3.2] Constraint (6) bounds passenger flow on an arc of line l by δ_{m(l)} z_l, where z_l is the number of vehicles assigned to line l. But the capacity of a line over the planning period (one peak hour) depends on the frequency f, not on the fleet size: capacity is approximately δ_m f T, while z_l satisfies z_l ≥ φ_lf ≈ f τ_l, with τ_l the round-trip time. Unless τ_l equals the planning period, Eq. (6) overestimates capacity by a factor τ_l/T, which is larger for longer lines. This can make the reported line plans infeasible with respect to actual passenger loads. Please correct the capacity constraint (e.g., express capacity in terms of the selected y_lf and frequency f, or otherwise align z_l with a capacity measure) and confirm that the SAMCF evaluation in §4.7 enforces the same corrected capacity.
  3. [§5.2–§5.4, §4.7] The paper's central claim is that the ALNS is a "competitive and scalable" algorithm, but the experiments provide no comparison against exact solutions, lower bounds, or another published line-planning heuristic. The ablation study and convergence plots show only improvements relative to the algorithm's own starting solutions. Since the evaluation step is outsourced to the companion-paper SAMCF heuristic (Hansen and Lusby, 2026) and since three-hour runs continue to find small improvements late in the search, independent evidence of solution quality is needed. At minimum, report gaps to lower bounds (e.g., from an LP relaxation or from solving the MINLP on small instances) or benchmark against an existing method on a shared dataset.
minor comments (6)
  1. [Abstract, §5.2] The phrase "substantially increasing public transport ridership" should be qualified as being conditional on the assumed demand elasticity β_d=0.05 and the 5% mode-share floor, given the sensitivity shown in Table 5.
  2. [§4.1, §4.2.2] The method is described as using dynamic line generation, but §4.1 assumes a predefined line pool for the construction heuristic and the backbone-flow repair operator, and the random-line operator uses shortest paths in the PTN. Please clarify how much of the claimed novelty depends on the precomputed 797-line pool versus genuinely generated lines.
  3. [§5.1.3] The choice β_d=0.05 is stated to be a "reasonable representation" of demand sensitivity, but no basis or reference is given. Please provide a justification, a calibration source, or at least a stated range of plausible values used in the sensitivity analysis.
  4. [§4.7] The SAMCF evaluation subroutine is described only by reference to a companion preprint. Since it is central to the results, please include sufficient detail (pricing subproblem, convergence checks, handling of empty PT path sets) for the paper to be self-contained.
  5. [§3.3.1, Eq. (10)] If no PT passengers are assigned to an OD pair, u_PT_d is undefined in Eq. (10). Please state how the model and the heuristic handle this case.
  6. [Global] No code or data availability statement is provided. For a computational paper of this type, releasing the instance generator, line pool, and calibrated OD matrix would materially improve reproducibility.

Circularity Check

2 steps flagged

The ridership headline is an output of the calibrated logit model (baseline 8% is fixed by construction), and the evaluator that produces every reported number is justified only by a same-author preprint.

specific steps
  1. fitted input called prediction [Section 5.1.3 (OD matrix calibration) and Section 5.2 (line plan characteristics)]
    "Since this matrix reflects only observed PT demand, we calibrate a baseline total-demand matrix by inverting the logit model under current operations... The total demand for OD pair d is then defined as b̂w_d = q^obs_d / p^obs_d. Given b̂w_d, we recompute the implied observed share p^obs_d = q^obs_d / b̂w_d and calibrate α_d such that the logit model reproduces this share under baseline conditions. ... In comparison, the current baseline system captures about 8% of total demand (4,885 trips out of a total demand of 59,453)."

    The 8% baseline PT share is not an empirical finding: it is constructed by the calibration. Since total demand is b̂w_d = q^obs_d / p^obs_d, with p^obs_d floored at 5% and then α_d chosen so the logit reproduces q^obs_d / b̂w_d, the aggregate baseline share (4,885/59,453 ≈ 8.2%) is fixed by the inversion. The optimized shares (12.4–32.3%) are then computed with the same total demand and the same logit function, with β_d = 0.05 hand-set rather than estimated. The paper itself shows that β = 0.02 gives only 1,460 PT passengers, below the observed baseline, while β = 0.10 gives 30,675. Thus the headline ‘substantially increasing ridership’ is an artifact of the calibration and elasticity assumptions, not an independent prediction.

  2. self citation load bearing [Section 4.1 (Overview), Section 4.7 (Evaluation step), Figure 1b, Algorithm 3; results in Section 5]
    "This evaluation corresponds exactly to the SAMCF problem introduced in Hansen and Lusby (2026). We therefore assess each candidate solution using the SAMCF-heuristic proposed in that paper, which determines passenger routing and mode split for the given network. ... Although the procedure does not have theoretical guarantees on solution quality, Hansen and Lusby (2026) demonstrate empirically that it yields solutions of high quality very quickly."

    Every quantitative result in the paper—objective values, PT demand, headways, line counts, fleet sizes, and the sensitivity tables—is produced by this SAMCF-heuristic. The heuristic is not independently verified, re-derived, or benchmarked in the present manuscript; its adequacy is supported only by a citation to a preprint by the same authors. The paper even states that the procedure ‘does not have theoretical guarantees’, so the load-bearing claim that the evaluator is trustworthy reduces to the authors’ own unpublished claim. This is not a definitional equivalence, but it is a self-citation chain supporting the central computational results.

full rationale

The paper is transparent about its main vulnerability: it openly reports that results are highly sensitive to β (Section 5.3, Table 5) and that the SAMCF-heuristic has no theoretical guarantees (Section 4.7). Such transparency is welcome, but it does not make the headline result independent of the calibration. The baseline 8% share is produced by the inverted logit calibration, and the optimized ridership gains are produced by the same logit model with a hand-set elasticity; within the range the paper itself tests, the qualitative conclusion can reverse. This is a calibration-dependence issue as much as a circularity issue, so I do not score it as a full 6 or 8. The additional self-citation of Hansen and Lusby (2026) is load-bearing because the entire evaluation pipeline is outsourced to that same-author preprint, without machine-checked code, an external exact benchmark, or an independent reproduction. However, the ALNS framework, destroy/repair operators, local search, and the Odense case study are developed in this paper and have independent content, so the paper is only partially self-referential. Overall circularity score: 4.

Axiom & Free-Parameter Ledger

4 free parameters · 5 axioms · 0 invented entities

No new physical or model entities are introduced beyond the parameter knobs listed above. The central claims rest on the calibrated demand model, the system-optimal assignment assumption, and the same-author SAMCF evaluation subroutine.

free parameters (4)
  • beta_d (logit elasticity) = 0.05
    Hand-set in Section 5.1.3 as 'a reasonable representation of demand sensitivity'; all ridership results are highly sensitive to this value (Section 5.3).
  • alpha_d (per-OD constants) = Calibrated per OD pair (about 1,826 values)
    Calibrated so the logit model reproduces observed baseline PT share for each OD pair; baseline demand is matched by construction (Section 5.1.3).
  • baseline mode-share floor = 0.05
    OD pairs with computed baseline share below 5% are set to 5% before inverting total demand; ad hoc threshold affecting total demand estimates (Section 5.1.3).
  • per-passenger subsidy Rsub = varied 20-80 DKK/pax
    Used as a trade-off knob between ridership and operating cost; the paper states it is not a measured reimbursement level (Section 5.1.4).
axioms (5)
  • domain assumption Logit mode choice with a single aggregated alternative mode
    Equation (2) and Section 3.3.2 assume passengers choose between PT and one fixed alternative mode with constant cost; ignores interactions between modes.
  • domain assumption System-optimal passenger assignment
    Routing is determined centrally as a system optimum (Section 3.3.1); the paper later tests SP and MNL routing and shows modest cost differences, but the optimization still uses the system-optimal assumption.
  • domain assumption OD matrix contains only observed PT trips, no latent demand
    Section 5.1.3 and Section 6 state that the demand model is limited to OD pairs with observed PT trips; induced demand from new OD pairs is not modeled.
  • domain assumption SAMCF-heuristic from Hansen & Lusby (2026) correctly and quickly solves the evaluation problem
    The evaluation subroutine is adopted wholesale from a same-author preprint with no theoretical guarantees; the paper relies on its empirical performance for every candidate evaluation.
  • domain assumption Budget constraint not binding in experiments
    Section 5.1.4 states the budget constraint is not used; the model freely trades fleet size against service, which drives the large fleet expansions.

pith-pipeline@v1.3.0-alltime-deepseek · 3632 in / 7312 out tokens · 152563 ms · 2026-08-02T05:41:14.516648+00:00 · methodology

0 comments
Cite this review

Pith. "Pith review of An ALNS Heuristic for Large-Scale Line Planning with Mode Choice and Line Generation." pith.science (2026). https://pith.science/paper/A5Z2YML7

@misc{pith2026260713263,
  author       = {Pith},
  title        = {Pith review of: An ALNS Heuristic for Large-Scale Line Planning with Mode Choice and Line Generation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/A5Z2YML7}},
  note         = {Machine review of arXiv:2607.13263}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Demand responsiveness is an important consideration in public transport line planning, as network design and service quality influence passenger demand. However, accounting for this interaction further complicates an already challenging combinatorial optimization problem. To address this challenge, we propose a scalable Adaptive Large Neighborhood Search (ALNS) algorithm for large-scale line planning with endogenous demand. The algorithm jointly optimizes lines and frequencies while accounting for passenger mode choice, passenger assignment, and vehicle capacities. Candidate lines are generated dynamically throughout the search, and solutions are evaluated using an embedded evaluation procedure for passenger assignment and demand estimation, together with a dedicated local search procedure for frequency optimization. The proposed methodology is evaluated on the public transport network of Odense, Denmark, comprising approximately 1,800 origin-destination pairs. Computational results demonstrate the applicability of the approach to realistic, large-scale instances. The optimized networks concentrate resources on fewer, higher-frequency services, reducing average headways from approximately 41 minutes to 6.8-13 minutes while substantially increasing public transport ridership. Furthermore, the results show that network design is highly sensitive to assumptions regarding passenger behavior, highlighting the importance of carefully calibrated demand models when incorporating demand responsiveness into line planning.

Figures

Figures reproduced from arXiv: 2607.13263 by Otto Anker Nielsen, Richard Martin Lusby, Rowan Hoogervorst, Siv Marie Cartland Hansen.

Figure 1
Figure 1. Figure 1: Schematic overview of the ALNS algorithm and the embedded evaluation procedure. [PITH_FULL_IMAGE:figures/full_fig_p014_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The PTN network for the Odense instance. Bus edges are shown in black, train edges in [PITH_FULL_IMAGE:figures/full_fig_p022_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Characteristics of observed travel demand [PITH_FULL_IMAGE:figures/full_fig_p024_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Characteristics of the line concepts produced by the algorithm considered different [PITH_FULL_IMAGE:figures/full_fig_p028_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Effect of per-passenger subsidy on PT mode share. [PITH_FULL_IMAGE:figures/full_fig_p029_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: ALNS convergence over time starting from different initial solutions (Blue: as-is operations, [PITH_FULL_IMAGE:figures/full_fig_p031_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Demand functions for each OD pair for different values of [PITH_FULL_IMAGE:figures/full_fig_p043_7.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

46 extracted references · 9 canonical work pages · 1 internal anchor

  1. [1]

    Computers & Operations Research , author =

    Speeding up the passenger assignment problem in transit planning by the. Computers & Operations Research , author =. 2024 , keywords =. doi:10.1016/j.cor.2024.106647 , abstract =

    arXiv 2024

  2. [2]

    van and Martin, Layla and Yang, Lixing , year =

    Lu, Yahan and Lieshout, Rolf N. van and Martin, Layla and Yang, Lixing , year =. Line planning under crowding:

  3. [3]

    Nielsen, Otto Anker and Hylander, ens Portinson and Nyruzzaman, Robin , year =. Region

  4. [4]

    Transportation Science , author =

    Shuttle planning for link closures in urban public transport networks , volume =. Transportation Science , author =. 2016 , pages =. doi:10.1287/trsc.2015.0647 , abstract =

    arXiv 2016

  5. [5]

    Operations Research , author =

    Data-driven transit network design at scale , volume =. Operations Research , author =. 2021 , pages =. doi:10.1287/opre.2020.2057 , abstract =

    arXiv 2021

  6. [6]

    An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows , volume =

    Ropke, Stefan and Pisinger, David , month = nov, year =. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows , volume =. Transportation Science , publisher =. doi:10.1287/trsc.1050.0135 , abstract =

    arXiv

  7. [7]

    Discrete Applied Mathematics , author =

    A survey of very large-scale neighborhood search techniques , volume =. Discrete Applied Mathematics , author =. 2002 , pages =. doi:10.1016/S0166-218X(01)00338-9 , language =

    work page doi:10.1016/s0166-218x(01)00338-9 2002

  8. [8]

    Discrete choice analysis:

    Ben-Akiva, Moshe E and Lerman, Steven R , year =. Discrete choice analysis:

  9. [9]

    Transportation Research Part A: Policy and Practice , author =

    Relevance of detailed transfer attributes in large-scale multimodal route choice models for metropolitan public transport passengers , volume =. Transportation Research Part A: Policy and Practice , author =. 2021 , pages =. doi:10.1016/j.tra.2021.02.010 , language =

    work page doi:10.1016/j.tra.2021.02.010 2021

  10. [10]

    Suman and Nomesh B

    Hemant K. Suman and Nomesh B. Bolia , keywords =. Improvement in direct bus services through route planning , journal =. 2019 , issn =. doi:https://doi.org/10.1016/j.tranpol.2019.07.001 , url =

    work page doi:10.1016/j.tranpol.2019.07.001 2019

  11. [11]

    European Journal of Operational Research , author =

    An exact algorithm for public transport line planning considering passenger and operational costs and lost demand , issn =. European Journal of Operational Research , author =. 2026 , keywords =. doi:10.1016/j.ejor.2026.06.034 , abstract =

    doi:10.1016/j.ejor.2026.06.034 2026

  12. [12]

    Transportation Research Part B , author =

    Bus network design , volume =. Transportation Research Part B , author =. 1986 , keywords =. doi:10.1016/0191-2615(86)90047-0 , abstract =

    doi:10.1016/0191-2615(86)90047-0 1986

  13. [13]

    Public Transport , author =

    Line pool generation , volume =. Public Transport , author =. 2017 , pages =. doi:10.1007/s12469-016-0127-x , number =

    doi:10.1007/s12469-016-0127-x 2017

  14. [14]

    Genetic algorithms in bus network optimization , journal =

    Maurizio Bielli and Massimiliano Caramia and Pasquale Carotenuto , keywords =. Genetic algorithms in bus network optimization , journal =. 2002 , issn =. doi:https://doi.org/10.1016/S0968-090X(00)00048-6 , url =

    work page doi:10.1016/s0968-090x(00)00048-6 2002

  15. [15]

    Machemehl , title =

    Wei Fan and Randy B. Machemehl , title =. Journal of Transportation Engineering , volume =. 2006 , doi =

    2006

  16. [16]

    Applied Sciences , VOLUME =

    Iliopoulou, Christina and Tassopoulos, Ioannis and Beligiannis, Grigorios , TITLE =. Applied Sciences , VOLUME =. 2022 , NUMBER =

    2022

  17. [17]

    European Journal of Operational Research , author =

    Optimal lines for railway systems , volume =. European Journal of Operational Research , author =. 1997 , keywords =. doi:10.1016/0377-2217(95)00367-3 , abstract =

    doi:10.1016/0377-2217(95)00367-3 1997

  18. [18]

    EURO Journal on Transportation and Logistics , author =

    Solving the line planning problem with service-levels using a column generation-based heuristic algorithm , volume =. EURO Journal on Transportation and Logistics , author =. 2025 , pages =. doi:10.1016/j.ejtl.2025.100164 , language =

    arXiv 2025

  19. [19]

    A bilevel model for the frequency setting problem , volume =

    Gatt, Hadrien and Freche, Jean-Marc and Laurent, Anne and Lehuédé, François , editor =. A bilevel model for the frequency setting problem , volume =. 2022 , pages =. doi:10.4230/OASIcs.ATMOS.2022.5 , booktitle =

    doi:10.4230/oasics.atmos.2022.5 2022

  20. [20]

    Public Transport , author =

    A survey on the transit network design and frequency setting problem , volume =. Public Transport , author =. 2022 , keywords =. doi:10.1007/s12469-021-00284-y , language =

    doi:10.1007/s12469-021-00284-y 2022

  21. [21]

    Expert Systems with Applications , author =

    Designing bus line plans for realistic cases - the. Expert Systems with Applications , author =. 2022 , keywords =. doi:10.1016/j.eswa.2021.115918 , abstract =

    arXiv 2022

  22. [22]

    Journal of Advanced Transportation , author =

    A matheuristic iterative approach for profit-oriented line planning applied to the. Journal of Advanced Transportation , author =. 2020 , pages =. doi:10.1155/2020/4294195 , abstract =

    work page doi:10.1155/2020/4294195 2020

  23. [23]

    , title =

    Fan, Wei and Machemehl, Randy B. , title =. Computer-Aided Civil and Infrastructure Engineering , volume =. doi:https://doi.org/10.1111/j.1467-8667.2008.00556.x , url =

    arXiv 2008

  24. [24]

    Transportation Science , author =

    Modeling and solving line planning with mode choice , volume =. Transportation Science , author =. 2023 , pages =. doi:10.1287/trsc.2022.1171 , abstract =

    arXiv 2023

  25. [25]

    European Journal of Operational Research , author =

    Line planning with user-optimal route choice , volume =. European Journal of Operational Research , author =. 2017 , pages =. doi:10.1016/j.ejor.2016.10.034 , abstract =

    doi:10.1016/j.ejor.2016.10.034 2017

  26. [26]

    Large neighborhood search , volume =

    Pisinger, David and Ropke, Stefan , year =. Large neighborhood search , volume =. doi:10.1007/978-3-319-91086-4_4 , booktitle =

    doi:10.1007/978-3-319-91086-4_4

  27. [27]

    Transportation Science , author =

    A column-generation approach to line planning in public transport , volume =. Transportation Science , author =. 2007 , pages =. doi:10.1287/trsc.1060.0161 , abstract =

    arXiv 2007

  28. [28]

    Public transit planning and operation:

    Ceder, Avishai , year =. Public transit planning and operation:

  29. [29]

    Public Transport , author =

    A bus network design procedure with elastic demand for large urban areas , volume =. Public Transport , author =. 2012 , keywords =. doi:10.1007/s12469-012-0051-7 , abstract =

    work page doi:10.1007/s12469-012-0051-7 2012

  30. [30]

    Urquhart , keywords =

    Héctor Cancela and Antonio Mauttone and María E. Urquhart , keywords =. Mathematical programming formulations for transit network design , journal =. 2015 , issn =. doi:https://doi.org/10.1016/j.trb.2015.03.006 , url =

    doi:10.1016/j.trb.2015.03.006 2015

  31. [31]

    Transportation Research Part C: Emerging Technologies , author =

    The transit network design problem with elastic demand and internalisation of external costs:. Transportation Research Part C: Emerging Technologies , author =. 2011 , keywords =. doi:10.1016/j.trc.2011.02.008 , abstract =

    work page doi:10.1016/j.trc.2011.02.008 2011

  32. [32]

    Annals of Operations Research , author =

    A general rapid network design, line planning and fleet investment integrated model , volume =. Annals of Operations Research , author =. 2016 , keywords =. doi:10.1007/s10479-014-1725-0 , abstract =

    doi:10.1007/s10479-014-1725-0 2016

  33. [33]

    Computers & Operations Research , author =

    An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem , volume =. Computers & Operations Research , author =. 2017 , keywords =. doi:10.1016/j.cor.2016.08.008 , abstract =

    doi:10.1016/j.cor.2016.08.008 2017

  34. [34]

    Public Transport , author =

    The railway line frequency and size setting problem , volume =. Public Transport , author =. 2017 , keywords =. doi:10.1007/s12469-017-0154-2 , abstract =

    doi:10.1007/s12469-017-0154-2 2017

  35. [35]

    Transportation Research Part E: Logistics and Transportation Review , author =

    Integrated railway rapid transit network design and line planning problem with maximum profit , volume =. Transportation Research Part E: Logistics and Transportation Review , author =. 2019 , keywords =. doi:10.1016/j.tre.2019.04.007 , abstract =

    doi:10.1016/j.tre.2019.04.007 2019

  36. [36]

    Szeto, W. Y. and Jiang, Yu , month = jan, year =. Hybrid artificial bee colony algorithm for transit network design , volume =. Transportation Research Record , publisher =. doi:10.3141/2284-06 , abstract =

    work page doi:10.3141/2284-06

  37. [37]

    Schiewe, Philine and Schöbel, Anita and Jäger, Sven and Albert, Sebastian and Biedinger, Christine and Dahlheimer, Thorsten and Grafe, Vera and Roth, Sarah and Schiewe, Alexander and Spühler, Felix and Stinzendörfer, Moritz and Urban, Reena , year =

  38. [38]

    Line planning with minimal traveling time , url =

    Schöbel, Anita and Scholl, Susanne , year =. Line planning with minimal traveling time , url =. 5th workshop on algorithmic methods and models for optimization of railways,

  39. [39]

    OR Spectrum , author =

    Line planning in public transportation:. OR Spectrum , author =. 2012 , keywords =. doi:10.1007/s00291-011-0251-6 , abstract =

    doi:10.1007/s00291-011-0251-6 2012

  40. [40]

    and Haase, Knut , pages =

    Klier, Michael J. and Haase, Knut , pages =. Line optimization in public transport systems , doi =. Operations research proceedings 2007 , publisher =

    2007

  41. [41]

    Planning and optimizing transit lines , url =

    Schmidt, Marie and Schöbel, Anita , month = may, year =. Planning and optimizing transit lines , url =. doi:10.48550/arXiv.2405.10074 , abstract =

    Pith/arXiv arXiv doi:10.48550/arxiv.2405.10074

  42. [42]

    How urban density, network topology and socio-economy influence public transport ridership:

    Ingvardson, Jesper Bláfoss and Nielsen, Otto Anker , month = may, year =. How urban density, network topology and socio-economy influence public transport ridership:. doi:10.1016/j.jtrangeo.2018.07.002 , journal =

    doi:10.1016/j.jtrangeo.2018.07.002 2018

  43. [43]

    Using constraint programming and local search methods to solve vehicle routing problems , volume =

    Shaw, Paul , editor =. Using constraint programming and local search methods to solve vehicle routing problems , volume =. Principles and practice of constraint programming —. 1998 , note =. doi:10.1007/3-540-49481-2_30 , urldate =

    doi:10.1007/3-540-49481-2_30 1998

  44. [44]

    Transportation Research Part A: Policy and Practice , author =

    Transit network design and scheduling:. Transportation Research Part A: Policy and Practice , author =. 2008 , keywords =. doi:10.1016/j.tra.2008.03.011 , abstract =

    doi:10.1016/j.tra.2008.03.011 2008

  45. [45]

    Transportation Research Part C: Emerging Technologies , author =

    Passenger arrival and waiting time distributions dependent on train service frequency and station characteristics:. Transportation Research Part C: Emerging Technologies , author =. 2018 , keywords =. doi:10.1016/j.trc.2018.03.006 , abstract =

    doi:10.1016/j.trc.2018.03.006 2018

  46. [46]

    A column generation-based fixed-point heuristic for the service-aware multi-commodity flow problem

    Hansen, Siv Marie Cartland and Lusby, Richard Martin , month = jul, year =. A column generation-based fixed-point heuristic for the service-aware multi-commodity flow problem , copyright =. doi:10.48550/ARXIV.2607.10459 , abstract =

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.2607.10459