A Column Generation-Based Heuristic for the Line Planning Problem with Service Levels (Short Paper)

Authors Hector Gatt, Jean-Marie Freche, Fabien Lehuédé, Thomas G. Yeung



PDF
Thumbnail PDF

File

OASIcs.ATMOS.2021.19.pdf
  • Filesize: 1.21 MB
  • 6 pages

Document Identifiers

Author Details

Hector Gatt
  • IMT Atlantique, LS2N, Nantes France
  • Lumiplan, Saint-Herblain, France
Jean-Marie Freche
  • Lumiplan, Saint-Herblain, France
Fabien Lehuédé
  • IMT Atlantique, LS2N, Nantes, France
Thomas G. Yeung
  • IMT Atlantique, LS2N, Nantes, France

Cite As Get BibTex

Hector Gatt, Jean-Marie Freche, Fabien Lehuédé, and Thomas G. Yeung. A Column Generation-Based Heuristic for the Line Planning Problem with Service Levels (Short Paper). In 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021). Open Access Series in Informatics (OASIcs), Volume 96, pp. 19:1-19:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021) https://doi.org/10.4230/OASIcs.ATMOS.2021.19

Abstract

This paper addresses the line planning problem by the combination of existing models reinforced with realistic characteristics like lines frequencies intervals or maximum number of lines, useful for public transportation companies. The problem is solved by an innovative, easily implementable, heuristic combining column generation and elementary column enumeration methods. In this paper, the operator’s exploitation costs are minimized while respecting new quality of service parameters addressed to passengers. Furthermore, a case study based on a real network is performed and described in this paper to prove the efficiency of our method.

Subject Classification

ACM Subject Classification
  • Networks → Network design and planning algorithms
Keywords
  • Line Planning
  • Network Design
  • Column Generation
  • Service Performance

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. M. H. Baaj and H. S. Mahmassani. Hybrid route generation heuristic algorithm for the design of transit networks. Transportation Research Part C: Emerging Technologies, 1995. Google Scholar
  2. R. Baldacci, N. Christofides, and A. Mingozzi. An exact algorithm for the vrp based on the set partitioning formulation with additional cuts. Mathematical Programming, 2008. Google Scholar
  3. D. Bertsimas, Y. S. Ng, and J. Yan. Data-Driven Transit Network Design at Scale. Operations Research, 2021. Google Scholar
  4. R. Borndörfer, M. Grötschel, and M. E. Pfetsch. A Column-Generation Approach to Line Planning in Public Transport. Transportation Science, 2007. Google Scholar
  5. R. Borndörfer and M. Karbstein. A Direct Connection Approach to Integrated Line Planning and Passenger Routing. Discrete Optimization, 2012. Google Scholar
  6. A. Ceder and N. H. M. Wilson. Bus network design. Transportation Research Part B: Methodological, 1986. Google Scholar
  7. M. Karbstein. Line Planning and Connectivity. PhD thesis, Mathematik und Naturwissenschaften der Technischen Universität Berlin, 2013. Google Scholar
  8. A. Schöbel. Line planning in public transportation: models and methods. Springer, 2012. Google Scholar
  9. A. Schöbel and S. Scholl. Line planning with minimal traveling time. ATMOS, 2005. Google Scholar
  10. H. K. Suman and N. B. Bolia. Improvement in direct bus services through route planning. Transport Policy, 2019. Google Scholar
  11. H. K. Suman, N. B. Bolia, and G. Tiwari. Perception of potential bus users and impact of feasible interventions to improve quality of bus services in Delhi. Case Studies on Transport Policy, 2018. Google Scholar
  12. W.Y. Szeto and Y. Jiang. Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach. Transportation Research Part B, 2014. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail