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

The train formation plan develops the train services and assigns the transportation demands whose optimal solutions are normally difficult to find. In this paper, a new linear programming model for the train formation plan problem is proposed by the use of mixed integer programming methods. In addition, considering the long computing time by the mixed integer programming solver, an effective heuristic algorithm is designed to explore the solution space, where a neighborhood based search method evaluates, selects, and implements the moves. To verify the proposed mixed integer programming model and the solution method, numerical problems have been solved, and results are compared with those obtained by the ILOG CPLEX 12.6 version. Keywords—freight transportation; train formation plan; mixed integer programming model; CPLEX

Solving Train Formation Plan Problem in Freight Transportation Corridors