Research Article
High-Speed Rail Train Timetabling Problem: A Time-Space Network Based Method with an Improved Branch-and-Price Algorithm
Table 1
The parameters for IBAP.
| the set of nodes generated in branch-and-price tree, indexed by | : the set of un-split a node | : the set of nodes unsearched in , indexed by | : the set of time-space path, and | Co(): the set of all the constraints in a node | : the time-space network with the value of dual variables | UB(): upper bound of a node | : reduce cost of time-space path | LB(): lower bound of a node | : is the lower bound of branch-and-price tree | ā | : is the upper bound of branch-and-price tree |
|
|