License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2020.2
URN: urn:nbn:de:0030-drops-131382
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13138/
Go to the corresponding OASIcs Volume Portal

Timm, Mike ; Storandt, Sabine

On the Multi-Kind BahnCard Problem

pdf-format:
OASIcs-ATMOS-2020-2.pdf (0.5 MB)

Abstract

The BahnCard problem is an important problem in the realm of online decision making. In its original form, there is one kind of BahnCard associated with a certain price, which upon purchase reduces the ticket price of train journeys for a certain factor over a certain period of time. The problem consists of deciding on which dates BahnCards should be purchased such that the overall cost, that is, BahnCard prices plus (reduced) ticket prices, is minimized without having knowledge about the number and prices of future journeys. In this paper, we extend the problem such that multiple kinds of BahnCards are available for purchase. We provide an optimal offline algorithm, as well as online strategies with provable competitiveness factors. Furthermore, we describe and implement several heuristic online strategies and compare their competitiveness in realistic scenarios.

BibTeX - Entry

@InProceedings{timm_et_al:OASIcs:2020:13138,
  author =	{Mike Timm and Sabine Storandt},
  title =	{{On the Multi-Kind BahnCard Problem}},
  booktitle =	{20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)},
  pages =	{2:1--2:13},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-170-2},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{85},
  editor =	{Dennis Huisman and Christos D. Zaroliagis},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/13138},
  URN =		{urn:nbn:de:0030-drops-131382},
  doi =		{10.4230/OASIcs.ATMOS.2020.2},
  annote =	{Keywords: offline solution, competitiveness, traveller profiles}
}

Keywords: offline solution, competitiveness, traveller profiles
Collection: 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)
Issue Date: 2020
Date of publication: 10.11.2020

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI