Aiming at the optimization problem of lasttrain connection planning in urban rail transit networks, which often brings difficulties in successful transfers, this study selects the arrival times of the last trains as decision variables and constructs a mixedinteger linear programming model to minimize the number of failed passenger transfers. To address the high model complexity caused by the expansion of the network scale, a quantum computing method is adopted to solve the proposed model. First, the original model is reconstructed into a twostage problem with a smaller computation scale. Then, the firststage optimization model is transformed into a quadratic unconstrained binary optimization (QUBO) model that can run on a quantum computer. Algorithm development and experimental testing are conducted based on the optical quantum computing technology of the coherent Ising machine. To verify the effectiveness of the proposed method, we consider the Beijing subway network as an example. The quantum computing results are compared with those from commercial solvers, confirming the feasibility of both the model transformation method and the quantum computing approach proposed in this study. These findings provide technical support for the further application of quantum computing in solving complex optimization problems in rail transit.
| 科 Family | 属数 Number of genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) | 属 Genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) |
|---|---|---|---|---|---|---|
| 鹅膏菌科Amanitaceae | 2 | 11 | 5.26 | 鹅膏菌属 Amanita | 10 | 4.78 |
| 小菇科 Mycenaceae | 2 | 12 | 5.74 | 丝盖伞属 Inocybe | 5 | 2.39 |
| 多孔菌科 Polyporaceae | 8 | 14 | 6.70 | 蜡蘑属 Laccaria | 5 | 2.39 |
| 红菇科 Russulaceae | 3 | 23 | 11.00 | 小皮伞属 Marasmius | 6 | 2.87 |
| 小菇属 Mycena | 11 | 5.26 | ||||
| 光柄菇属 Pluteus | 5 | 2.39 | ||||
| 红菇属 Russula | 17 | 8.13 | ||||
| 栓菌属 Trametes | 5 | 2.39 |