This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theory, aims at finding minimal user ride...

Due to the complexity of the traffic flow dynamics in urban road networks, most quantitative descriptions of city traffic so far are based on computer simulations. This contribution pursues a macroscopic (fluid-dynamic) simulation approach, which facilitates a simple simulation of congestion...

This paper describes the modeling of recurring congestion in a network. It is shown that the standard economic models of marginal cost cannot describe precisely traffic congestion in networks during time-dependent conditions. Following a macroscopic traffic approach, we describe the equilibrium...

The assumption that the penalty for being early is less than that for being late was put forward by Vickrey (1963) who analyzed how commuters compare penalties in the form of schedule delay (due to peak hour congestion), against penalties in the form of reaching their destination (ahead or...