This paper presents a first approach to dynamic frequency-based transit assignment. As such the model aims to close the gap between schedule-based and frequency-based models. Frequency-based approaches have some advantages compared to schedule-based models, however, when modelling highly...

This paper transfers the classic frequency-based transit assignment method of Spiess and Florian to containers demonstrating its promise as the basis for a global maritime container assignment model. In this model, containers are carried by shipping lines operating strings (or port rotations)...

Areas subject to natural or man-made disasters, such as earthquakes, fires, floods or attacks, are reliant on the residual transport network for the rescue of survivors and subsequent recovery. Pre-disaster planning requires assumptions about how the transport network may degrade. This paper...

Static traffic assignment models are still widely applied for strategic transport planning purposes in spite of the fact that such models produce implausible traffic flows that exceed link capacities and predict incorrect congestion locations. There have been numerous attempts to constrain link...

A recently proposed frequency-based maritime container assignment model (Bell et al., 2011) seeks an assignment of full and empty containers to paths that minimises expected container travel time, whereas containers are in practice more likely to be assigned to minimise expected cost. A...

This paper presents a dynamic user equilibrium for bus networks where recurrent overcrowding results in queues at stops. The route-choice model embedded in the dynamic assignment explicitly considers common lines and strategies with alternative routes. As such, the shortest hyperpath problem is...

This paper proposes an equilibrium model to characterize the bilateral searching and meeting between customers and taxis on road networks. A taxi driver searches or waits for a customer by considering both the expected searching or waiting time cost and ride revenue, and a customer seeks a taxi...

This paper aims to estimate capacity utilization of a liner ship route with a bounded polyhedral container shipment demand pattern, arising in the liner container shipping industry. The proposed maximum and minimum liner ship route capacity utilization problems are formulated as a linear...

Origin-destination (OD) matrix estimation largely depends on the quality and quantity of the input data, which in turn depends on the number and sites of count locations. In this paper, we focus on the network count location problem (NCLP), namely the identification of informative links in the...

The Astar algorithm, which forms the backbone of vehicle navigation systems, is capable of producing only one path. Given uncertainty about link travel times, there is interest in algorithms that can deliver all the paths that may be optimal, termed collectively a hyperpath, to improve travel...