MILP formulations and a TS algorithm for reliable last train timetabling with uncertain transfer flows.
Shuo YangKai YangLixing YangZiyou GaoPublished in: J. Oper. Res. Soc. (2018)
Keyphrases
- learning algorithm
- computational cost
- np hard
- k means
- times faster
- computational complexity
- theoretical analysis
- recognition algorithm
- cost function
- dynamic programming
- experimental evaluation
- detection algorithm
- lower bound
- search space
- data structure
- linear program
- segmentation algorithm
- simulated annealing
- linear programming
- convex hull
- hybrid algorithm
- optimization algorithm
- packing problem
- expectation maximization
- high accuracy
- worst case
- upper bound
- significant improvement
- preprocessing
- search algorithm
- optimal solution
- objective function
- bayesian networks