Online delay management on a single train line: beyond competitive analysis
We consider the Online Delay Management Problem (ODMP) on a network with a path topology that is served by one train. In this problem the number of delayed passengers who want to board the train is not known beforehand but revealed in an online fashion once the train arrives at the corresponding sta...
Gespeichert in:
| Veröffentlicht in: | Public transport 2013-10, Vol.5 (3), p.243-266 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 266 |
|---|---|
| container_issue | 3 |
| container_start_page | 243 |
| container_title | Public transport |
| container_volume | 5 |
| creator | Bender, Marco Büttner, Sabine Krumke, Sven O. |
| description | We consider the Online Delay Management Problem (ODMP) on a network with a path topology that is served by one train. In this problem the number of delayed passengers who want to board the train is not known beforehand but revealed in an online fashion once the train arrives at the corresponding station. The goal is to decide at which station a train should wait in order to minimize the total delay of all passengers.
Competitive analysis has become one of the standard tools to evaluate the performance of algorithms in the presence of incomplete information from a theoretical point of view. The ODMP has been analyzed by means of classical competitive analysis, where one compares the output of an online algorithm with that of an optimal offline algorithm which has complete knowledge about the input data. In this paper we use different approaches to overcome the often criticized pessimism of standard competitive analysis: lookahead, comparative analysis and average-case analysis. Each of these approaches extends the classical worst-case approach of competitive analysis in different aspects. We complement these extensions by addressing the problem from the viewpoint of stochastic optimization. We discuss the theoretical benefits of the concepts and provide a case-study on real world data. |
| doi_str_mv | 10.1007/s12469-013-0070-z |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1464544990</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1464544990</sourcerecordid><originalsourceid>FETCH-LOGICAL-c349t-aa9389df933af705256ca101999ba60a00e24c5ef3ed5b0311fd838b57566863</originalsourceid><addsrcrecordid>eNp1kEtrwzAQhEVpoSHND-hN0EsvbiXrZfVWQl80kEsOvQnZXgcFW04lp-D8-iq4h1LoXnYHvhmWQeiakjtKiLqPNOdSZ4SyLEmSHc_QjMqkFBX6PN2FlJni-uMSLWLckTQsV4VQM_S-9q3zgGto7Yg76-0WOvAD7j22ODq_bQEPwTqPT9wDLmHsfY2rvtvD4Ab3BTiZ2jG6eIUuGttGWPzsOdo8P22Wr9lq_fK2fFxlFeN6yKzVrNB1oxmzjSIiF7KylFCtdWklsYRAzisBDYNalIRR2tQFK0qhhJSFZHN0O8XuQ_95gDiYzsUK2tZ66A_RUC654FxrktCbP-iuP4T07oliSjHBGUsUnagq9DEGaMw-uM6G0VBiTgWbqWCTCjangs0xefLJExPrtxB-Jf9r-gZtHH0B</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1437735433</pqid></control><display><type>article</type><title>Online delay management on a single train line: beyond competitive analysis</title><source>SpringerLink (Online service)</source><creator>Bender, Marco ; Büttner, Sabine ; Krumke, Sven O.</creator><creatorcontrib>Bender, Marco ; Büttner, Sabine ; Krumke, Sven O.</creatorcontrib><description>We consider the Online Delay Management Problem (ODMP) on a network with a path topology that is served by one train. In this problem the number of delayed passengers who want to board the train is not known beforehand but revealed in an online fashion once the train arrives at the corresponding station. The goal is to decide at which station a train should wait in order to minimize the total delay of all passengers.
Competitive analysis has become one of the standard tools to evaluate the performance of algorithms in the presence of incomplete information from a theoretical point of view. The ODMP has been analyzed by means of classical competitive analysis, where one compares the output of an online algorithm with that of an optimal offline algorithm which has complete knowledge about the input data. In this paper we use different approaches to overcome the often criticized pessimism of standard competitive analysis: lookahead, comparative analysis and average-case analysis. Each of these approaches extends the classical worst-case approach of competitive analysis in different aspects. We complement these extensions by addressing the problem from the viewpoint of stochastic optimization. We discuss the theoretical benefits of the concepts and provide a case-study on real world data.</description><identifier>ISSN: 1866-749X</identifier><identifier>EISSN: 1613-7159</identifier><identifier>DOI: 10.1007/s12469-013-0070-z</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithms ; Automotive Engineering ; Business and Management ; CAE) and Design ; Competition ; Competitive intelligence ; Computer-Aided Engineering (CAD ; Delay ; On-line systems ; Online ; Operations Research/Decision Theory ; Optimization ; Original Paper ; Passengers ; Pessimism ; Public transportation ; Railroad transportation ; Stations ; Stochastic models ; Studies ; Trains ; Transportation</subject><ispartof>Public transport, 2013-10, Vol.5 (3), p.243-266</ispartof><rights>Springer-Verlag Berlin Heidelberg 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c349t-aa9389df933af705256ca101999ba60a00e24c5ef3ed5b0311fd838b57566863</citedby><cites>FETCH-LOGICAL-c349t-aa9389df933af705256ca101999ba60a00e24c5ef3ed5b0311fd838b57566863</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s12469-013-0070-z$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s12469-013-0070-z$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Bender, Marco</creatorcontrib><creatorcontrib>Büttner, Sabine</creatorcontrib><creatorcontrib>Krumke, Sven O.</creatorcontrib><title>Online delay management on a single train line: beyond competitive analysis</title><title>Public transport</title><addtitle>Public Transp</addtitle><description>We consider the Online Delay Management Problem (ODMP) on a network with a path topology that is served by one train. In this problem the number of delayed passengers who want to board the train is not known beforehand but revealed in an online fashion once the train arrives at the corresponding station. The goal is to decide at which station a train should wait in order to minimize the total delay of all passengers.
Competitive analysis has become one of the standard tools to evaluate the performance of algorithms in the presence of incomplete information from a theoretical point of view. The ODMP has been analyzed by means of classical competitive analysis, where one compares the output of an online algorithm with that of an optimal offline algorithm which has complete knowledge about the input data. In this paper we use different approaches to overcome the often criticized pessimism of standard competitive analysis: lookahead, comparative analysis and average-case analysis. Each of these approaches extends the classical worst-case approach of competitive analysis in different aspects. We complement these extensions by addressing the problem from the viewpoint of stochastic optimization. We discuss the theoretical benefits of the concepts and provide a case-study on real world data.</description><subject>Algorithms</subject><subject>Automotive Engineering</subject><subject>Business and Management</subject><subject>CAE) and Design</subject><subject>Competition</subject><subject>Competitive intelligence</subject><subject>Computer-Aided Engineering (CAD</subject><subject>Delay</subject><subject>On-line systems</subject><subject>Online</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Original Paper</subject><subject>Passengers</subject><subject>Pessimism</subject><subject>Public transportation</subject><subject>Railroad transportation</subject><subject>Stations</subject><subject>Stochastic models</subject><subject>Studies</subject><subject>Trains</subject><subject>Transportation</subject><issn>1866-749X</issn><issn>1613-7159</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kEtrwzAQhEVpoSHND-hN0EsvbiXrZfVWQl80kEsOvQnZXgcFW04lp-D8-iq4h1LoXnYHvhmWQeiakjtKiLqPNOdSZ4SyLEmSHc_QjMqkFBX6PN2FlJni-uMSLWLckTQsV4VQM_S-9q3zgGto7Yg76-0WOvAD7j22ODq_bQEPwTqPT9wDLmHsfY2rvtvD4Ab3BTiZ2jG6eIUuGttGWPzsOdo8P22Wr9lq_fK2fFxlFeN6yKzVrNB1oxmzjSIiF7KylFCtdWklsYRAzisBDYNalIRR2tQFK0qhhJSFZHN0O8XuQ_95gDiYzsUK2tZ66A_RUC654FxrktCbP-iuP4T07oliSjHBGUsUnagq9DEGaMw-uM6G0VBiTgWbqWCTCjangs0xefLJExPrtxB-Jf9r-gZtHH0B</recordid><startdate>20131001</startdate><enddate>20131001</enddate><creator>Bender, Marco</creator><creator>Büttner, Sabine</creator><creator>Krumke, Sven O.</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0-V</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88J</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ALSLI</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>H8D</scope><scope>HCIFZ</scope><scope>K60</scope><scope>K6~</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>M0C</scope><scope>M2R</scope><scope>M7S</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYYUZ</scope><scope>Q9U</scope><scope>7SC</scope><scope>JQ2</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20131001</creationdate><title>Online delay management on a single train line: beyond competitive analysis</title><author>Bender, Marco ; Büttner, Sabine ; Krumke, Sven O.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c349t-aa9389df933af705256ca101999ba60a00e24c5ef3ed5b0311fd838b57566863</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Automotive Engineering</topic><topic>Business and Management</topic><topic>CAE) and Design</topic><topic>Competition</topic><topic>Competitive intelligence</topic><topic>Computer-Aided Engineering (CAD</topic><topic>Delay</topic><topic>On-line systems</topic><topic>Online</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Original Paper</topic><topic>Passengers</topic><topic>Pessimism</topic><topic>Public transportation</topic><topic>Railroad transportation</topic><topic>Stations</topic><topic>Stochastic models</topic><topic>Studies</topic><topic>Trains</topic><topic>Transportation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bender, Marco</creatorcontrib><creatorcontrib>Büttner, Sabine</creatorcontrib><creatorcontrib>Krumke, Sven O.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Social Sciences Premium Collection【Remote access available】</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Social Science Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Social Science Premium Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Aerospace Database</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ABI/INFORM Global</collection><collection>Social Science Database</collection><collection>Engineering Database</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering collection</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Public transport</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bender, Marco</au><au>Büttner, Sabine</au><au>Krumke, Sven O.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Online delay management on a single train line: beyond competitive analysis</atitle><jtitle>Public transport</jtitle><stitle>Public Transp</stitle><date>2013-10-01</date><risdate>2013</risdate><volume>5</volume><issue>3</issue><spage>243</spage><epage>266</epage><pages>243-266</pages><issn>1866-749X</issn><eissn>1613-7159</eissn><abstract>We consider the Online Delay Management Problem (ODMP) on a network with a path topology that is served by one train. In this problem the number of delayed passengers who want to board the train is not known beforehand but revealed in an online fashion once the train arrives at the corresponding station. The goal is to decide at which station a train should wait in order to minimize the total delay of all passengers.
Competitive analysis has become one of the standard tools to evaluate the performance of algorithms in the presence of incomplete information from a theoretical point of view. The ODMP has been analyzed by means of classical competitive analysis, where one compares the output of an online algorithm with that of an optimal offline algorithm which has complete knowledge about the input data. In this paper we use different approaches to overcome the often criticized pessimism of standard competitive analysis: lookahead, comparative analysis and average-case analysis. Each of these approaches extends the classical worst-case approach of competitive analysis in different aspects. We complement these extensions by addressing the problem from the viewpoint of stochastic optimization. We discuss the theoretical benefits of the concepts and provide a case-study on real world data.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s12469-013-0070-z</doi><tpages>24</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1866-749X |
| ispartof | Public transport, 2013-10, Vol.5 (3), p.243-266 |
| issn | 1866-749X 1613-7159 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1464544990 |
| source | SpringerLink (Online service) |
| subjects | Algorithms Automotive Engineering Business and Management CAE) and Design Competition Competitive intelligence Computer-Aided Engineering (CAD Delay On-line systems Online Operations Research/Decision Theory Optimization Original Paper Passengers Pessimism Public transportation Railroad transportation Stations Stochastic models Studies Trains Transportation |
| title | Online delay management on a single train line: beyond competitive analysis |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T05%3A31%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Online%20delay%20management%20on%20a%20single%20train%20line:%20beyond%20competitive%20analysis&rft.jtitle=Public%20transport&rft.au=Bender,%20Marco&rft.date=2013-10-01&rft.volume=5&rft.issue=3&rft.spage=243&rft.epage=266&rft.pages=243-266&rft.issn=1866-749X&rft.eissn=1613-7159&rft_id=info:doi/10.1007/s12469-013-0070-z&rft_dat=%3Cproquest_cross%3E1464544990%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1437735433&rft_id=info:pmid/&rfr_iscdi=true |