On the Multi-Kind BahnCard Problem

Cite This

Files in this item

Checksum: MD5:77cd6fbc12fcb693a0197ee5d64a88bf

TIMM, Mike, Sabine STORANDT, 2020. On the Multi-Kind BahnCard Problem. 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020). Pisa, Sep 7, 2020 - Sep 8, 2020. In: HUISMAN, Dennis, ed., Christos D. ZAROLIAGIS, ed.. 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020). Saarbrücken/Wadern:Dagstuhl Publishing, 2. eISSN 1868-8969. ISBN 978-3-95977-170-2. Available under: doi: 10.4230/OASIcs.ATMOS.2020.2

@inproceedings{Timm2020Multi-52930, title={On the Multi-Kind BahnCard Problem}, year={2020}, doi={10.4230/OASIcs.ATMOS.2020.2}, number={85}, isbn={978-3-95977-170-2}, address={Saarbrücken/Wadern}, publisher={Dagstuhl Publishing}, series={OpenAccess Series in Informatics (OASIcs)}, booktitle={20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)}, editor={Huisman, Dennis and Zaroliagis, Christos D.}, author={Timm, Mike and Storandt, Sabine}, note={Article Number: 2} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/52930"> <dcterms:issued>2020</dcterms:issued> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-02-19T09:54:12Z</dcterms:available> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/52930/1/Timm_2-805k5xro2u4a7.pdf"/> <dc:language>eng</dc:language> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:creator>Storandt, Sabine</dc:creator> <dc:rights>Attribution 3.0 Unported</dc:rights> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/52930/1/Timm_2-805k5xro2u4a7.pdf"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-02-19T09:54:12Z</dc:date> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Timm, Mike</dc:creator> <dcterms:abstract xml:lang="eng">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.</dcterms:abstract> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Storandt, Sabine</dc:contributor> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/3.0/"/> <dcterms:title>On the Multi-Kind BahnCard Problem</dcterms:title> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/52930"/> <dc:contributor>Timm, Mike</dc:contributor> </rdf:Description> </rdf:RDF>

Downloads since Feb 19, 2021 (Information about access statistics)

Timm_2-805k5xro2u4a7.pdf 22

This item appears in the following Collection(s)

Attribution 3.0 Unported Except where otherwise noted, this item's license is described as Attribution 3.0 Unported

Search KOPS


Browse

My Account