This paper presents an improved simulation method for solving the train scheduling problem to reduce the total travel time on the single-track railway. An algorithm based on the global information of the train is designed to obtain a more effective travel advance strategy of the train than the...

The essential distinction between the Fundamental Diagram Approach (FDA) and Kerner’s three-phase theory (KTPT) is the existence of a unique gap–speed (or flow–density) relationship in the former class. In order to verify this relationship, empirical data are analyzed with the following...

The discrete network design problem deals with the selection of link additions to an existing road network, with given demand from each origin to each destination. The objective is to make an optimal investment decision in order to minimize the total travel cost in the network, while accounting...

In the research area of dynamic traffic assignment, link travel times can be derived from link cumulative inflow and outflow curves which are generated by dynamic network loading. In this paper, the profiles of cumulative flows are piecewise linearized. Both the step function (SF) and linear...

In this paper, a bilevel programming model for transit network design problem is presented, in which the upper model is a normal transit network design model, and the lower model is a transit equilibrium assignment model. A heuristic solution algorithm based on sensitivity analysis is designed...

Passengers may make several transfers between different lines to reach their destinations in urban railway transit networks. Coordination of last trains in feeding lines and connecting lines at transfer stations is especially important because it is the last chance for many travellers to...

Different from traditional methods, this paper formulates the logit-based stochastic dynamic user optimal (SDUO) route choice problem as a fixed point (FP) problem in terms of intersection movement choice probabilities, which contain travelers’ route information so that the realistic effects...

In this paper, train scheduling problem (TSCP) is discussed for the case of single-track railway corridor, in which variable sensitivity on train delay are discussed in detailed for different types of trains. The mathematical model is a complicated nonlinear mixed-integer programming. The object...