All Stories

  1. Constructing a cell transmission model solution adhering fully to first-in-first-out conditions
  2. Consistency and Inconsistency Between the Fundamental Relationships on Which Different Traffic Assignment Models Are Based
  3. Travel-Time Models With and Without Homogeneity Over Time
  4. Representation requirements for perfect first-in-first-out verification in continuous flow dynamic models
  5. On the Convergence of the Method of Successive Averages for Calculating Equilibrium in Traffic Networks
  6. Extending travel-time based models for dynamic network loading and assignment, to achieve adherence to first-in-first-out and link capacities
  7. Implementing first-in–first-out in the cell transmission model for networks
  8. Extending the Cell Transmission Model to Multiple Lanes and Lane-Changing
  9. Dynamic traffic assignment approximating the kinematic wave model: System optimum, marginal costs, externalities and tolls
  10. A Review of Properties of Flow–Density Functions
  11. Comparison of Methods for Path Flow Reassignment for Dynamic User Equilibrium
  12. Route swapping in dynamic traffic networks
  13. A framework for user equilibrium dynamic traffic assignment
  14. Retaining desirable properties in discretising a travel-time model
  15. Scheduling trains on a network of busy complex stations
  16. Alternative Conditions for a Well-Behaved Travel Time Model
  17. Convergence of a Discretised Travel-Time Model
  18. Link Travel Times II: Properties Derived from Traffic-Flow Models
  19. An exit-flow model used in dynamic traffic assignment
  20. Efficient Discretisation for Link Travel Time Models
  21. Link Travel Times I: Desirable Properties
  22. Comparing whole-link travel time models
  23. Pseudo-periodicity in a travel-time model used in dynamic traffic assignment
  24. Scheduling and platforming trains at busy complex stations
  25. A Whole-Link Travel-Time Model with Desirable Properties
  26. The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation
  27. Link Outflow Rate Computing under Continuous Dynamic Loads
  28. Behaviour of a whole-link travel time model used in dynamic traffic assignment
  29. Erratum to “An approach to modelling time-varying flows on congested networks” [Transportation Research Part B 34(3) 157–183]
  30. Testing schedule performance and reliability for train stations
  31. An approach to modelling time-varying flows on congested networks
  32. Ex ante heuristic measures of schedule reliability
  33. Optimizing scheduled times, allowing for behavioural response
  34. Optimal consolidation of municipalities: An analysis of alternative designs
  35. A Model, Algorithms and Strategy for Train Pathing
  36. A Model, Algorithms and Strategy for Train Pathing
  37. A Model, Algorithms and Strategy for Train Pathing
  38. Properties of expected costs and performance measures in stochastic models of scheduled transport
  39. Dynamic Congestion Pricing and the Price of Fifo
  40. Swapping the order of scheduled services to minimize expected costs of delays
  41. Reliability of interconnected scheduled services
  42. A model and strategy for train pathing with choice of lines, platforms, and routes
  43. Extending a train pathing model from one-way to two-way track
  44. Stochastic approximation to the effects of headways on knock-on delays of trains
  45. Solving a class of network models for dynamic flow control
  46. Externalities, Average and Marginal Costs, and Tolls on Congested Networks with Time-Varying Flows
  47. Nonconvexity of the dynamic traffic assignment problem
  48. Extending and solving a multiperiod congested network flow model
  49. Estimating nonparametric convex functions using gradient data
  50. Congested network flows: Time-varying demands and start-time policies
  51. Network equilibrium: Optimization formulations with both quantities and prices as variables
  52. Optimal Time-Varying Flows on Congested Networks
  53. Intertemporal benefit functions
  54. Constrained Estimation of Direct Demand Functions and Trip Matrices
  55. A Constraint Qualification for a Dynamic Traffic Assignment Model
  56. The dual of the traffic assignment problem with elastic demands
  57. Bounds on expected performance of networks with links subject to failure
  58. On Mutually Exclusive and Collectively Exhaustive Properties of Demand Functions
  59. A Method for Direct Estimation of Origin/Destination Trip Matrices
  60. STABILITY OF COMPETITIVE REGIONAL TRADE WITH MONOTONE DEMAND/SUPPLY FUNCTIONS*
  61. The Birmingham Energy Model
  62. OPTIMAL ALLOCATION AND PRICING WHEN CONSUMER BEHAVIOUR IS SUBOPTIMAL
  63. Integrability and Mathematical Programming Models: A Survey and a Parametric Approach
  64. Route Swap Processes and Convergence Measures in Dynamic Traffic Assignment