Optimizing Train Routing Problem in a Multistation High-Speed Railway Hub by a Lagrangian Relaxation Approach.
Yidong WangRui SongShiwei HeZilong SongJushang ChiPublished in: IEEE Access (2022)
Keyphrases
- routing problem
- high speed railway
- lagrangian relaxation
- modeling method
- shortest path
- integer programming
- key technologies
- np hard
- column generation
- lower bound
- virtual reality
- branch and bound algorithm
- feasible solution
- vehicle routing problem
- particle swarm
- cutting plane algorithm
- dynamic programming
- lower and upper bounds
- linear programming
- vehicle routing problem with time windows
- traveling salesman problem
- routing algorithm
- travel time
- energy saving
- branch and bound
- valid inequalities
- global optimization
- neural network
- particle swarm optimization
- constraint programming
- combinatorial optimization
- road network
- evolutionary algorithm