English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Train scheduling is one of the significant issues in the railway industry inrecent years since it has an important role in efficacy of railwayinfrastructure. In this paper, the timetabling problem of a multiple trackedrailway network is discussed. More specifically, a general model is presentedhere in which a set of operational and safety requirements is considered. Themodel handles the trains overtaking in stations and considers the stationscapacity. The objective function is to minimize the total travel time.Unfortunately, the problem is NP-hard and real size problems cannot be solvedin an acceptable amount of time. In order to reduce the processing time, wepresented some heuristic rules, which reduce the number of binary variables.These rules are based on problem's parameters such as travel time, dwell timeand safety time of stations and try to remove the impracticable areas of thesolution space. Furthermore, a Lagrangian Relaxation algorithm model ispresented in order to find a lower-bound. Finally, comprehensive numericalexperiments on the Tehran Metro case are reported. Results show the efficiencyof the heuristic rules and also the Lagrangian Relaxation method in a way thatfor all analyzed problems the optimum value are obtained.

Train Timetabling on double track and multiple station capacity railway with useful upper and lower bounds