Skip to content

Theoretical maximum capacity as a benchmark for empty vehicle redistribution in Personal Rapid Transit

Research output: Working paperWorking paper and Preprints

Standard

Theoretical maximum capacity as a benchmark for empty vehicle redistribution in Personal Rapid Transit. / Lees-Miller, JD; Hammersley, John; Wilson, RE.

2010.

Research output: Working paperWorking paper and Preprints

Harvard

APA

Vancouver

Author

Lees-Miller, JD; Hammersley, John; Wilson, RE / Theoretical maximum capacity as a benchmark for empty vehicle redistribution in Personal Rapid Transit.

2010.

Research output: Working paperWorking paper and Preprints

Bibtex

@techreport{e99c978d1f2347478db969773c6997c7,
title = "Theoretical maximum capacity as a benchmark for empty vehicle redistribution in Personal Rapid Transit",
keywords = "Personal Rapid Transit, PRT, empty vehicle redistribution",
author = "JD Lees-Miller and John Hammersley and RE Wilson",
note = "Additional information: A preprint document later published in, Transportation Research Record: Journal of the Transportation Research Board, 2146, 76–83. Sponsorship: JDLM acknowledges the support of an Overseas Research Scholarship from the University of Bristol. REW acknowledges the support of an EPSRC Advanced Fellowship EP/E055567/1. This work was partly funded by the CityMobil Sixth Framework Programme for DG Research Thematic Priority 1.6, Sustainable Development, Global Change and Ecosystems, Integrated Project, Contract Number TIP5-CT-2006-031315.",
year = "2010",
doi = "10.3141/2146-10",
type = "WorkingPaper <importModel: WorkingPaperImportModel>",

}

RIS - suitable for import to EndNote

TY - UNPB

T1 - Theoretical maximum capacity as a benchmark for empty vehicle redistribution in Personal Rapid Transit

AU - Lees-Miller,JD

AU - Hammersley,John

AU - Wilson,RE

N1 - Additional information: A preprint document later published in, Transportation Research Record: Journal of the Transportation Research Board, 2146, 76–83. Sponsorship: JDLM acknowledges the support of an Overseas Research Scholarship from the University of Bristol. REW acknowledges the support of an EPSRC Advanced Fellowship EP/E055567/1. This work was partly funded by the CityMobil Sixth Framework Programme for DG Research Thematic Priority 1.6, Sustainable Development, Global Change and Ecosystems, Integrated Project, Contract Number TIP5-CT-2006-031315.

PY - 2010

Y1 - 2010

N2 - A Personal Rapid Transit (PRT) 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/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. This paper describes a method 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 to the benchmark. The method is applied to two simple EVR heuristics on two example systems, and 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.

AB - A Personal Rapid Transit (PRT) 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/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. This paper describes a method 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 to the benchmark. The method is applied to two simple EVR heuristics on two example systems, and 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.

KW - Personal Rapid Transit

KW - PRT

KW - empty vehicle redistribution

U2 - 10.3141/2146-10

DO - 10.3141/2146-10

M3 - Working paper and Preprints

BT - Theoretical maximum capacity as a benchmark for empty vehicle redistribution in Personal Rapid Transit

ER -