Theoretical Maximum Capacity as Benchmark for Empty Vehicle Redistribution in Personal Rapid Transit

A personal rapid transit system uses compact, computer-guided vehicles running on dedicated guideways to carry individuals or small groups directly between pairs of stations. Vehicles move on demand when a passenger requests service at his or her origin station. Because the number of trips requested...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Transportation research record 2010-01, Vol.2146 (1), p.76-83
Hauptverfasser: Lees-Miller, John D., Hammersley, John C., Wilson, R. Eddie
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 83
container_issue 1
container_start_page 76
container_title Transportation research record
container_volume 2146
creator Lees-Miller, John D.
Hammersley, John C.
Wilson, R. Eddie
description A personal rapid transit system uses compact, computer-guided vehicles running on dedicated guideways to carry individuals or small groups directly between pairs of stations. Vehicles move on demand when a passenger requests service at his or her origin station. Because the number of trips requested from a station need not equal the number of trips ending there, some vehicles must run empty to balance the flows. The empty vehicle redistribution (EVR) problem is to decide which empty vehicles to move and when and where to move them; an EVR algorithm makes these decisions in real time, as passengers arrive and request service. A method was developed for finding the theoretical maximum demand (with a given spatial distribution) that a given system could serve with any EVR algorithm, which provides a benchmark against which particular EVR algorithms can be compared. The maximum passenger demand that a particular EVR algorithm can serve can be determined by simulation and then compared with the benchmark. The method is applied to two simple EVR heuristics on two example systems. The results suggest that this is a useful method for determining the strengths and weaknesses of a variety of EVR heuristics across a range of networks, passenger demands, and fleet sizes.
doi_str_mv 10.3141/2146-10
format Article
fullrecord <record><control><sourceid>sage_cross</sourceid><recordid>TN_cdi_crossref_primary_10_3141_2146_10</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sage_id>10.3141_2146-10</sage_id><sourcerecordid>10.3141_2146-10</sourcerecordid><originalsourceid>FETCH-LOGICAL-c315t-ab357c978f4e20f01e754c149894a2f7a844d3629f8eb969eaa02a9b0c5608433</originalsourceid><addsrcrecordid>eNplkEtLAzEUhYMoWKv4F7IQXI3mJplHllrqAypKqW6HO5kbm9p5kEzB_ntH6s7V4Rw-DofD2CWIGwUabiXoLAFxxCYSMpNokcpjNhEqgwRMAafsLMaNEErpXE1YvVpTF2jwFrf8Bb99s2v4DHu0fthzjPyeWrtuMHxx1wU-b_ox_qC1t1viS6p9HIKvdoPvWu5b_kYhdu1YtcTe13wVsI1-OGcnDreRLv50yt4f5qvZU7J4fXye3S0SqyAdEqxUmluTF06TFE4A5am2oE1hNEqXY6F1rTJpXEGVyQwhCommEjbNRKGVmrLrQ68NXYyBXNkHP27flyDK33PK33NGM5JXBzLiJ5WbbhfG0fEf9gM-0mIR</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Theoretical Maximum Capacity as Benchmark for Empty Vehicle Redistribution in Personal Rapid Transit</title><source>SAGE Complete</source><creator>Lees-Miller, John D. ; Hammersley, John C. ; Wilson, R. Eddie</creator><creatorcontrib>Lees-Miller, John D. ; Hammersley, John C. ; Wilson, R. Eddie</creatorcontrib><description>A personal rapid transit system uses compact, computer-guided vehicles running on dedicated guideways to carry individuals or small groups directly between pairs of stations. Vehicles move on demand when a passenger requests service at his or her origin station. Because the number of trips requested from a station need not equal the number of trips ending there, some vehicles must run empty to balance the flows. The empty vehicle redistribution (EVR) problem is to decide which empty vehicles to move and when and where to move them; an EVR algorithm makes these decisions in real time, as passengers arrive and request service. A method was developed for finding the theoretical maximum demand (with a given spatial distribution) that a given system could serve with any EVR algorithm, which provides a benchmark against which particular EVR algorithms can be compared. The maximum passenger demand that a particular EVR algorithm can serve can be determined by simulation and then compared with the benchmark. The method is applied to two simple EVR heuristics on two example systems. The results suggest that this is a useful method for determining the strengths and weaknesses of a variety of EVR heuristics across a range of networks, passenger demands, and fleet sizes.</description><identifier>ISSN: 0361-1981</identifier><identifier>EISSN: 2169-4052</identifier><identifier>DOI: 10.3141/2146-10</identifier><language>eng</language><publisher>Los Angeles, CA: SAGE Publications</publisher><ispartof>Transportation research record, 2010-01, Vol.2146 (1), p.76-83</ispartof><rights>2010 National Academy of Sciences</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c315t-ab357c978f4e20f01e754c149894a2f7a844d3629f8eb969eaa02a9b0c5608433</citedby><cites>FETCH-LOGICAL-c315t-ab357c978f4e20f01e754c149894a2f7a844d3629f8eb969eaa02a9b0c5608433</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/2146-10$$EPDF$$P50$$Gsage$$H</linktopdf><linktohtml>$$Uhttps://journals.sagepub.com/doi/10.3141/2146-10$$EHTML$$P50$$Gsage$$H</linktohtml><link.rule.ids>314,780,784,21819,27924,27925,43621,43622</link.rule.ids></links><search><creatorcontrib>Lees-Miller, John D.</creatorcontrib><creatorcontrib>Hammersley, John C.</creatorcontrib><creatorcontrib>Wilson, R. Eddie</creatorcontrib><title>Theoretical Maximum Capacity as Benchmark for Empty Vehicle Redistribution in Personal Rapid Transit</title><title>Transportation research record</title><description>A personal rapid transit system uses compact, computer-guided vehicles running on dedicated guideways to carry individuals or small groups directly between pairs of stations. Vehicles move on demand when a passenger requests service at his or her origin station. Because the number of trips requested from a station need not equal the number of trips ending there, some vehicles must run empty to balance the flows. The empty vehicle redistribution (EVR) problem is to decide which empty vehicles to move and when and where to move them; an EVR algorithm makes these decisions in real time, as passengers arrive and request service. A method was developed for finding the theoretical maximum demand (with a given spatial distribution) that a given system could serve with any EVR algorithm, which provides a benchmark against which particular EVR algorithms can be compared. The maximum passenger demand that a particular EVR algorithm can serve can be determined by simulation and then compared with the benchmark. The method is applied to two simple EVR heuristics on two example systems. The results suggest that this is a useful method for determining the strengths and weaknesses of a variety of EVR heuristics across a range of networks, passenger demands, and fleet sizes.</description><issn>0361-1981</issn><issn>2169-4052</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNplkEtLAzEUhYMoWKv4F7IQXI3mJplHllrqAypKqW6HO5kbm9p5kEzB_ntH6s7V4Rw-DofD2CWIGwUabiXoLAFxxCYSMpNokcpjNhEqgwRMAafsLMaNEErpXE1YvVpTF2jwFrf8Bb99s2v4DHu0fthzjPyeWrtuMHxx1wU-b_ox_qC1t1viS6p9HIKvdoPvWu5b_kYhdu1YtcTe13wVsI1-OGcnDreRLv50yt4f5qvZU7J4fXye3S0SqyAdEqxUmluTF06TFE4A5am2oE1hNEqXY6F1rTJpXEGVyQwhCommEjbNRKGVmrLrQ68NXYyBXNkHP27flyDK33PK33NGM5JXBzLiJ5WbbhfG0fEf9gM-0mIR</recordid><startdate>20100101</startdate><enddate>20100101</enddate><creator>Lees-Miller, John D.</creator><creator>Hammersley, John C.</creator><creator>Wilson, R. Eddie</creator><general>SAGE Publications</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20100101</creationdate><title>Theoretical Maximum Capacity as Benchmark for Empty Vehicle Redistribution in Personal Rapid Transit</title><author>Lees-Miller, John D. ; Hammersley, John C. ; Wilson, R. Eddie</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c315t-ab357c978f4e20f01e754c149894a2f7a844d3629f8eb969eaa02a9b0c5608433</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lees-Miller, John D.</creatorcontrib><creatorcontrib>Hammersley, John C.</creatorcontrib><creatorcontrib>Wilson, R. Eddie</creatorcontrib><collection>CrossRef</collection><jtitle>Transportation research record</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lees-Miller, John D.</au><au>Hammersley, John C.</au><au>Wilson, R. Eddie</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Theoretical Maximum Capacity as Benchmark for Empty Vehicle Redistribution in Personal Rapid Transit</atitle><jtitle>Transportation research record</jtitle><date>2010-01-01</date><risdate>2010</risdate><volume>2146</volume><issue>1</issue><spage>76</spage><epage>83</epage><pages>76-83</pages><issn>0361-1981</issn><eissn>2169-4052</eissn><abstract>A personal rapid transit system uses compact, computer-guided vehicles running on dedicated guideways to carry individuals or small groups directly between pairs of stations. Vehicles move on demand when a passenger requests service at his or her origin station. Because the number of trips requested from a station need not equal the number of trips ending there, some vehicles must run empty to balance the flows. The empty vehicle redistribution (EVR) problem is to decide which empty vehicles to move and when and where to move them; an EVR algorithm makes these decisions in real time, as passengers arrive and request service. A method was developed for finding the theoretical maximum demand (with a given spatial distribution) that a given system could serve with any EVR algorithm, which provides a benchmark against which particular EVR algorithms can be compared. The maximum passenger demand that a particular EVR algorithm can serve can be determined by simulation and then compared with the benchmark. The method is applied to two simple EVR heuristics on two example systems. The results suggest that this is a useful method for determining the strengths and weaknesses of a variety of EVR heuristics across a range of networks, passenger demands, and fleet sizes.</abstract><cop>Los Angeles, CA</cop><pub>SAGE Publications</pub><doi>10.3141/2146-10</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0361-1981
ispartof Transportation research record, 2010-01, Vol.2146 (1), p.76-83
issn 0361-1981
2169-4052
language eng
recordid cdi_crossref_primary_10_3141_2146_10
source SAGE Complete
title Theoretical Maximum Capacity as Benchmark for Empty Vehicle Redistribution in Personal Rapid Transit
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T15%3A21%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-sage_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Theoretical%20Maximum%20Capacity%20as%20Benchmark%20for%20Empty%20Vehicle%20Redistribution%20in%20Personal%20Rapid%20Transit&rft.jtitle=Transportation%20research%20record&rft.au=Lees-Miller,%20John%20D.&rft.date=2010-01-01&rft.volume=2146&rft.issue=1&rft.spage=76&rft.epage=83&rft.pages=76-83&rft.issn=0361-1981&rft.eissn=2169-4052&rft_id=info:doi/10.3141/2146-10&rft_dat=%3Csage_cross%3E10.3141_2146-10%3C/sage_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_sage_id=10.3141_2146-10&rfr_iscdi=true