Abstract
Personal rapid transit (PRT) is a public and automated transport systemin which a fleet of small driverless vehicles operate in order to transport passengers between a set of stations through a network of guided ways. Each customer is carried from one station to another directly with no stop in intermediate stations. This mode of transport can result in a high level of unused capacity due to the empty moves of the vehicles. In this paper, we model the problem of minimizing the energy consumed by the PRT system while assuming predeterministic list of orders; then we solve it using some constructive heuristics. Experiments are run on 1320 randomly generated test problems with various sizes. Our algorithms are shown to give good results over large trip instances.