Abstract
An assignment algorithm is described which selects the connections used computes the average travel time in each relation in a public transport network. The selection of the connections is based on minimization of the average travel time. The only factors, which influence the selections, are the length of the connections and the departing frequency of each connection.