Investigating the interactions of road users and pedestrians in a dynamic rail level crossing environment

There are 23,500 level crossings in Australia. In these types of environments it is important to understand what human factor issues are present and how road users and pedestrians engage with crossings. A series of on-site observations were performed over a 2-day period at a 3-track active crossing. This was followed by 52 interviews with local business owners and members of the public. Data were captured using a manual-coding scheme for recording and categorising violations. Over 700 separate road user and pedestrian violations were recorded, with representations in multiple categories. Time stamping revealed that the crossing was active for 59% of the time in some morning periods. Further, trains could take up to 4-min to arrive following its first activation. Many pedestrians jaywalked under side rails and around active boom gates. In numerous cases pedestrians put themselves at risk in order to beat or catch the approaching train, ignored signs to stop walking when the lights were flashing. Analysis of interview data identified themes associated with congestion, safety, and violations. This work offers insight into context specific issues associated with active level crossing protection.

A new constraint programming approach for optimising a coal rail system

Because of the bottlenecking operations in a complex coal rail system, millions of dollars are costed by mining companies. To handle this issue, this paper investigates a real-world coal rail system and aims to optimise the coal railing operations under constraints of limited resources (e.g., limited number of locomotives and wagons). In the literature, most studies considered the train scheduling problem on a single-track railway network to be strongly NP-hard and thus developed metaheuristics as the main solution methods. In this paper, a new mathematical programming model is formulated and coded by optimization programming language based on a constraint programming (CP) approach. A new depth-first-search technique is developed and embedded inside the CP model to obtain the optimised coal railing timetable efficiently. Computational experiments demonstrate that high-quality solutions are obtainable in industry-scale applications. To provide insightful decisions, sensitivity analysis is conducted in terms of different scenarios and specific criteria. Keywords Train scheduling · Rail transportation · Coal mining · Constraint programming