One of the most common motivations for public transport investments is increased capacity. However, appraisal methodologies for projects meant to increase capacity are relatively less well developed compared to methodologies for projects aiming to reduce travel times. Each of the consequences of...

For the simulation of pedestrians, a method is introduced to find routing alternatives from any origin position to a given destination area in a given geometry composed of walking areas and obstacles. The method includes a parameter which sets a threshold for the approximate minimum size of...

This paper analyzes the assignment of durable objects to successive generations of agents who live for two periods. The optimal assignment rule is stationary, favors old agents and is determined by a selectivity function, which satisfies an iterative functional differential equation. More...

The paper presents a minimum-cost flow approach for dynamic assignment procedures for networks with storage devices over time. Decision variables are diversion of flow at specific nodes and the storage of material in buffers which have to meet upper and lower capacity constraints. Evaluation of...

This paper reviews the transportation models used for predicting impacts of congestion charging in European cities and carries out in-depth comparison of two such models, METROPOLIS and SILVESTER. Both are mesoscopic dynamic models involving modal split, route choice and departure time choice...

We analyze dynamic assignment problems where agents successively receive different objects (positions, offices, etc.). A finite set of n vertically differentiated indivisible objects are assigned to n agents who live n periods. At each period, a new agent enters society, and the oldest agent...

We analyze dynamic assignment problems where agents successively receive different objects (positions, offices, etc.). A finite set of n vertically differentiated indivisible objects are assigned to n agents who live n periods. At each period, a new agent enters society, and the oldest agent...