Hui-Zhang Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hui-Zhang Xu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Junhua Chen
School of Traffic and Transportation, Beijing Jiaotong University, No. 3 Shang Yuan Cun, Hai Dian District, Beijing 100044, China
1 shared publication - Kai Wen
Beijing QBoson Quantum Technology Co., Ltd
1 shared publication - Te-Er Lu
School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
1 shared publication - Tianze Gao
School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China
1 shared publication - Xingchen Zhang
School of Traffic and Transportation, Beijing Jiaotong University, No. 3 Shang Yuan Cun, Hai Dian District, Beijing 100044, China
1 shared publication - Yin Ma
Beijing QBoson Quantum Technology Co., Ltd., Beijing 100015, China
1 shared publication
Latest Publications
- Open Access
- 22 November 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (11) , 1-28
High-speed train timetable optimization based on space–time network model and quantum simulator
Timetable scheduling is a combinatorial optimization problem that presents formidable challenges for classical computers. This paper introduces a pioneering methodology for addressing the high-speed train timetabling problem through quantum computing. Initially, a comprehensive binary integer programming model, grounded in the space–time network, is proposed (M1). To manage the intricacy of model M1, a knapsack problem reformulation is employed to establish a simplified binary integer programming model (M2). Both M1 and M2 are subsequently converted into quadratic unconstrained binary optimization (QUBO) models to harness the potential of quantum computing. Several techniques, including the Gurobi solver, simulated annealing, and the coherent Ising machine (CIM) quantum simulator, are deployed to solve the model across four distinct scenarios of varying complexity. The findings indicate that CIM quantum simulator outperforms the simulated annealing method in terms of solution quality for medium-scale problems.
- 22 November 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (11) , 1-28
Open AccessHigh-speed train timetable optimization based on space–time network model and quantum simulator
Timetable scheduling is a combinatorial optimization problem that presents formidable challenges for classical computers. This paper introduces a pioneering methodology for addressing the high-speed train timetabling problem through quantum computing. Initially, a comprehensive binary integer programming model, grounded in the space–time network, is proposed (M1). To manage the intricacy of model M1, a knapsack problem reformulation is employed to establish a simplified binary integer programming model (M2). Both M1 and M2 are subsequently converted into quadratic unconstrained binary optimization (QUBO) models to harness the potential of quantum computing. Several techniques, including the Gurobi solver, simulated annealing, and the coherent Ising machine (CIM) quantum simulator, are deployed to solve the model across four distinct scenarios of varying complexity. The findings indicate that CIM quantum simulator outperforms the simulated annealing method in terms of solution quality for medium-scale problems.