A tree-based model for setting optimal train fare zones

DOI10.1155/2014/384321MaRDI QIDQ1718240zbMATH OpenOpenAlexWikidataFDO

Authors José Alberto Conejero, Esther Sanabria-Codesal, Cristina Jordán

Publication date 8 February 2019

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/384321

Mathematics Subject Classification ID

Trees (05C05) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Review text

Summary: Given a railway line with \(n\) stops and the number of travelers between each pair of stops, we show how to split these stops into \(k\) different fare zones in order to maximize the benefit obtained from the sale of tickets to the travelers. We present a method to obtain this solution that is based on finding the longest path in a weighted root tree. This method improves in terms of efficiency the combinatorial method, where all the possible distributions have to be considered for deciding which is the optimal one.

Recommendations

• scientific article; zbMATH DE number 764425
• scientific article; zbMATH DE number 5117514
• scientific article; zbMATH DE number 1057917
• Optimal lines for railway systems
• Design of Zone Tariff Systems in Public Transportation

Cites work

• A Lagrangian heuristic for a train-unit assignment problem
• A passenger demand model for airline flight scheduling and fleet routing
• An iterative algorithm for the management of an electric car-rental service
• Design of tariff zones in public transportation networks: theoretical results and heuristics
• Design of Zone Tariff Systems in Public Transportation
• scientific article; zbMATH DE number 3561438 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 858902 (Why is no real title available?)
• scientific article; zbMATH DE number 915571 (Why is no real title available?)
• scientific article; zbMATH DE number 2229025 (Why is no real title available?)
• Integrating Robust Railway Network Design and Line Planning under Failures
• Models for fare planning in public transport
• Network flows. Theory, algorithms, and applications.
• On the online track assignment problem
• Solving a real-world train-unit assignment problem
• Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem

Cited in

(4)

• Station choice for Australian commuter rail lines: equilibrium and optimal fare design
• Service location grouping and pricing in transportation: application in air cargo
• scientific article; zbMATH DE number 764425 (Why is no real title available?)
• scientific article; zbMATH DE number 915571 (Why is no real title available?)

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A tree-based model for setting optimal train fare zones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1718240)