A branch and bound algorithm for the exact solution of the problem of EMU circulation scheduling in railway network

DOI10.1155/2016/8537089zbMath1400.90174OpenAlexW2233663158WikidataQ59140948 ScholiaQ59140948MaRDI QIDQ1793684

Ran Chen, Lei-shan Zhou, Chao Lu, Yi-xiang Yue

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/8537089

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Robust rolling stock in rapid transit networks
• Circulation of railway rolling stock: a branch-and-price approach
• A Lagrangian heuristic for a train-unit assignment problem
• Solving a real-world train-unit assignment problem
• Models and Algorithms for the Train Unit Assignment Problem
• A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem

This page was built for publication: A branch and bound algorithm for the exact solution of the problem of EMU circulation scheduling in railway network