Quasi-Optimum Redistribution of Empty PRT Vehicles

Ingmar Andréasson

1997 · 13 citations · 0 references

Concepts

Abstract

The task of redistributing empty vehicles in a PRT system is particularly difficult in peak periods and in large networks. Simulations of PRT systems often have a vehicle management component based on sequential choices of vehicles called to a station with a deficit. This paper discusses testing of various rules for call and send based on expected levels at other stations and the time required to bring a vehicle from a surplus to a deficit. Different planning horizons are used for each station based on the average call time to that station.