The Cheapest Ticket Problem in Public Transport

Author:

Schöbel Anita12ORCID,Urban Reena1ORCID

Affiliation:

1. Department of Mathematics, Technische Universität Kaiserslautern, 67663 Kaiserslautern, Germany;

2. Fraunhofer Institute for Industrial Mathematics, 67663 Kaiserslautern, Germany

Abstract

Route choice models in public transport have been discussed for a long time. The main reason why a passenger chooses a specific path is usually based on its length or travel time. However, also the ticket price that passengers have to pay may influence their decision because passengers prefer cheaper paths over more expensive ones. In this paper, we deal with the cheapest ticket problem, which asks for a cheapest ticket to travel between a pair of stations. The complexity and the algorithmic approach to solve this problem depend crucially on the underlying fare structure; for example, it is easy if the ticket price is proportional to the distance traveled (as in distance tariff fare structures), but may become NP-complete in zone tariff fare structures. We hence discuss the cheapest ticket problem for different variations of distance- and zone-based fare structures. We start by modeling the respective fare structure mathematically, then identify its main properties, and finally provide a polynomial algorithm, or prove NP-completeness of the cheapest ticket problem. We also provide general results on the combination of two fare structures, which is often observed in practice.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Transportation,Civil and Structural Engineering

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3