Service Reliability and Optimal Running Time Schedules

To improve reliability, transit routes have time points at which early vehicles are held. Holding reduces waiting time and the amount of time passengers have to budget for a trip. However, it also reduces operating speed and thus increases passenger riding time and, potentially, operating cost. A ne...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Transportation research record 2007-01, Vol.2034 (1), p.55-61
Hauptverfasser: Furth, Peter G., Muller, Theo H. J.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 61
container_issue 1
container_start_page 55
container_title Transportation research record
container_volume 2034
creator Furth, Peter G.
Muller, Theo H. J.
description To improve reliability, transit routes have time points at which early vehicles are held. Holding reduces waiting time and the amount of time passengers have to budget for a trip. However, it also reduces operating speed and thus increases passenger riding time and, potentially, operating cost. A new approach is presented for quantifying the user costs associated with unreliability. User cost has three components: excess waiting time, potential travel time or buffer time (related to budgeted travel time), and mean riding time, of which the first two are reliability impacts. For long headway service, these costs can be determined from 2-percentile departure times, 95-percentile arrival times, and mean arrival and departure times at stops. With a simple route operations model on a hypothetical route, impacts of scheduling with different numbers of time points and with different levels of running time and cycle time supplements are explored, and optimal running time schedules are determined. For a typical case, the optimal time point schedule offers net benefits equivalent to 4.5 min of riding time per passenger compared with operation without time point control. Optimal route running times are roughly mean plus one standard deviation of uncontrolled running time, and optimal cycle time is roughly mean plus two to three standard deviations of uncontrolled route running time. Surprisingly, it was found that in an optimal schedule, inserting slack at time points does not increase cycle time, because slack time inserted en route simply substitutes for slack time needed in layover.
doi_str_mv 10.3141/2034-07
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_31911088</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sage_id>10.3141_2034-07</sage_id><sourcerecordid>31911088</sourcerecordid><originalsourceid>FETCH-LOGICAL-c313t-dd6183cc573fb5101be0212ae2e0546afdb1484380699196cd9ddb6d1a74b743</originalsourceid><addsrcrecordid>eNpl0MtqwzAQBVDRBzRNQ3_Bi9Ku3M5YsiwtS-kLAoEkeyFL41TBsVPLLuTv65Duurqbw2XmMnaL8MhR4FMGXKRQnLFJhlKnAvLsnM10oYCDBs0V4gWbAJeYolZ4xa5j3AJwLgo-YXJF3U9wlCypDrYMdegPiW18stj3YWfrZDk0TWg2yTrsKFm5L_JDTfGGXVa2jjT7yylbv72uXz7S-eL98-V5njqOvE-9l6i4c3nBqzJHwJIgw8xSRpALaStfolCCK5Bao5bOa-9L6dEWoiwEn7L7U-2-a78Hir3Zheiorm1D7RANR40ISo3w4QRd18bYUWX23Xh-dzAI5jiTOc5koBjl3UlGuyGzbYeuGR_4x34BsHNg5A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>31911088</pqid></control><display><type>article</type><title>Service Reliability and Optimal Running Time Schedules</title><source>Access via SAGE</source><creator>Furth, Peter G. ; Muller, Theo H. J.</creator><creatorcontrib>Furth, Peter G. ; Muller, Theo H. J.</creatorcontrib><description>To improve reliability, transit routes have time points at which early vehicles are held. Holding reduces waiting time and the amount of time passengers have to budget for a trip. However, it also reduces operating speed and thus increases passenger riding time and, potentially, operating cost. A new approach is presented for quantifying the user costs associated with unreliability. User cost has three components: excess waiting time, potential travel time or buffer time (related to budgeted travel time), and mean riding time, of which the first two are reliability impacts. For long headway service, these costs can be determined from 2-percentile departure times, 95-percentile arrival times, and mean arrival and departure times at stops. With a simple route operations model on a hypothetical route, impacts of scheduling with different numbers of time points and with different levels of running time and cycle time supplements are explored, and optimal running time schedules are determined. For a typical case, the optimal time point schedule offers net benefits equivalent to 4.5 min of riding time per passenger compared with operation without time point control. Optimal route running times are roughly mean plus one standard deviation of uncontrolled running time, and optimal cycle time is roughly mean plus two to three standard deviations of uncontrolled route running time. Surprisingly, it was found that in an optimal schedule, inserting slack at time points does not increase cycle time, because slack time inserted en route simply substitutes for slack time needed in layover.</description><identifier>ISSN: 0361-1981</identifier><identifier>ISBN: 9780309093811</identifier><identifier>ISBN: 0309093813</identifier><identifier>EISSN: 2169-4052</identifier><identifier>DOI: 10.3141/2034-07</identifier><language>eng</language><publisher>Los Angeles, CA: SAGE Publications</publisher><ispartof>Transportation research record, 2007-01, Vol.2034 (1), p.55-61</ispartof><rights>2007 National Academy of Sciences</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c313t-dd6183cc573fb5101be0212ae2e0546afdb1484380699196cd9ddb6d1a74b743</citedby><cites>FETCH-LOGICAL-c313t-dd6183cc573fb5101be0212ae2e0546afdb1484380699196cd9ddb6d1a74b743</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://journals.sagepub.com/doi/pdf/10.3141/2034-07$$EPDF$$P50$$Gsage$$H</linktopdf><linktohtml>$$Uhttps://journals.sagepub.com/doi/10.3141/2034-07$$EHTML$$P50$$Gsage$$H</linktohtml><link.rule.ids>315,781,785,21821,27926,27927,43623,43624</link.rule.ids></links><search><creatorcontrib>Furth, Peter G.</creatorcontrib><creatorcontrib>Muller, Theo H. J.</creatorcontrib><title>Service Reliability and Optimal Running Time Schedules</title><title>Transportation research record</title><description>To improve reliability, transit routes have time points at which early vehicles are held. Holding reduces waiting time and the amount of time passengers have to budget for a trip. However, it also reduces operating speed and thus increases passenger riding time and, potentially, operating cost. A new approach is presented for quantifying the user costs associated with unreliability. User cost has three components: excess waiting time, potential travel time or buffer time (related to budgeted travel time), and mean riding time, of which the first two are reliability impacts. For long headway service, these costs can be determined from 2-percentile departure times, 95-percentile arrival times, and mean arrival and departure times at stops. With a simple route operations model on a hypothetical route, impacts of scheduling with different numbers of time points and with different levels of running time and cycle time supplements are explored, and optimal running time schedules are determined. For a typical case, the optimal time point schedule offers net benefits equivalent to 4.5 min of riding time per passenger compared with operation without time point control. Optimal route running times are roughly mean plus one standard deviation of uncontrolled running time, and optimal cycle time is roughly mean plus two to three standard deviations of uncontrolled route running time. Surprisingly, it was found that in an optimal schedule, inserting slack at time points does not increase cycle time, because slack time inserted en route simply substitutes for slack time needed in layover.</description><issn>0361-1981</issn><issn>2169-4052</issn><isbn>9780309093811</isbn><isbn>0309093813</isbn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNpl0MtqwzAQBVDRBzRNQ3_Bi9Ku3M5YsiwtS-kLAoEkeyFL41TBsVPLLuTv65Duurqbw2XmMnaL8MhR4FMGXKRQnLFJhlKnAvLsnM10oYCDBs0V4gWbAJeYolZ4xa5j3AJwLgo-YXJF3U9wlCypDrYMdegPiW18stj3YWfrZDk0TWg2yTrsKFm5L_JDTfGGXVa2jjT7yylbv72uXz7S-eL98-V5njqOvE-9l6i4c3nBqzJHwJIgw8xSRpALaStfolCCK5Bao5bOa-9L6dEWoiwEn7L7U-2-a78Hir3Zheiorm1D7RANR40ISo3w4QRd18bYUWX23Xh-dzAI5jiTOc5koBjl3UlGuyGzbYeuGR_4x34BsHNg5A</recordid><startdate>200701</startdate><enddate>200701</enddate><creator>Furth, Peter G.</creator><creator>Muller, Theo H. J.</creator><general>SAGE Publications</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>FR3</scope><scope>KR7</scope></search><sort><creationdate>200701</creationdate><title>Service Reliability and Optimal Running Time Schedules</title><author>Furth, Peter G. ; Muller, Theo H. J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c313t-dd6183cc573fb5101be0212ae2e0546afdb1484380699196cd9ddb6d1a74b743</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Furth, Peter G.</creatorcontrib><creatorcontrib>Muller, Theo H. J.</creatorcontrib><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Civil Engineering Abstracts</collection><jtitle>Transportation research record</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Furth, Peter G.</au><au>Muller, Theo H. J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Service Reliability and Optimal Running Time Schedules</atitle><jtitle>Transportation research record</jtitle><date>2007-01</date><risdate>2007</risdate><volume>2034</volume><issue>1</issue><spage>55</spage><epage>61</epage><pages>55-61</pages><issn>0361-1981</issn><eissn>2169-4052</eissn><isbn>9780309093811</isbn><isbn>0309093813</isbn><abstract>To improve reliability, transit routes have time points at which early vehicles are held. Holding reduces waiting time and the amount of time passengers have to budget for a trip. However, it also reduces operating speed and thus increases passenger riding time and, potentially, operating cost. A new approach is presented for quantifying the user costs associated with unreliability. User cost has three components: excess waiting time, potential travel time or buffer time (related to budgeted travel time), and mean riding time, of which the first two are reliability impacts. For long headway service, these costs can be determined from 2-percentile departure times, 95-percentile arrival times, and mean arrival and departure times at stops. With a simple route operations model on a hypothetical route, impacts of scheduling with different numbers of time points and with different levels of running time and cycle time supplements are explored, and optimal running time schedules are determined. For a typical case, the optimal time point schedule offers net benefits equivalent to 4.5 min of riding time per passenger compared with operation without time point control. Optimal route running times are roughly mean plus one standard deviation of uncontrolled running time, and optimal cycle time is roughly mean plus two to three standard deviations of uncontrolled route running time. Surprisingly, it was found that in an optimal schedule, inserting slack at time points does not increase cycle time, because slack time inserted en route simply substitutes for slack time needed in layover.</abstract><cop>Los Angeles, CA</cop><pub>SAGE Publications</pub><doi>10.3141/2034-07</doi><tpages>7</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0361-1981
ispartof Transportation research record, 2007-01, Vol.2034 (1), p.55-61
issn 0361-1981
2169-4052
language eng
recordid cdi_proquest_miscellaneous_31911088
source Access via SAGE
title Service Reliability and Optimal Running Time Schedules
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-18T07%3A08%3A08IST&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=Service%20Reliability%20and%20Optimal%20Running%20Time%20Schedules&rft.jtitle=Transportation%20research%20record&rft.au=Furth,%20Peter%20G.&rft.date=2007-01&rft.volume=2034&rft.issue=1&rft.spage=55&rft.epage=61&rft.pages=55-61&rft.issn=0361-1981&rft.eissn=2169-4052&rft.isbn=9780309093811&rft.isbn_list=0309093813&rft_id=info:doi/10.3141/2034-07&rft_dat=%3Cproquest_cross%3E31911088%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=31911088&rft_id=info:pmid/&rft_sage_id=10.3141_2034-07&rfr_iscdi=true