Conflict Entropy-Based Optimization of Vehicle Scheduling in Tunnel Traffic Networks

Against the backdrop of the advancing Transportation Power Strategy, long and large tunnels face critical challenges in ensuring the safety and efficiency of transportation scheduling due to their harsh environment, complex traffic network, and the need for coordination among multiple types of vehicles. Addressing the shortcomings of existing research-such as the disconnection between path planning and dynamic environments, insufficient coordination between timetables and paths, and incomplete conflict management-this paper constructs a comprehensive optimization model for the scheduling of construction vehicles in tunnel traffic networks. Firstly, integrating the improved social force model with the BPR function, an adaptive social force-BPR path planning model with a collision compensation mechanism is proposed, and the weights of sub-items are optimized using the improved AHP algorithm. Secondly, a constraint system covering paths, spatio-temporal logic, and three types of conflicts (crossing conflicts, head-on conflicts, and congestion conflicts) is established, and a bi-objective function of "minimum total scheduling time" and "minimum number of conflicts" is designed. Combined with the improved NSGA-II algorithm, the collaborative optimization of departure intervals and paths is realized. In particular, a conflict entropy repair operator is introduced to quantify the conflict chaos through node conflict entropy and vehicle conflict entropy, and the scheduling strategy is accurately adjusted based on the logic of "priority ranking-dynamic delay" to balance conflict resolution and efficiency loss. Finally, a case verification is carried out relying on a tunnel topological network with 30 nodes and 41 edges. The experimental results show that the optimal repulsion coefficient k_f of the social force model is 20, and the maximum departure interval of 8 min is the best configuration after introducing the repair operator. At this time, the total scheduling time is 136 min, and the total number of conflicts is only 2, completely avoiding high-risk head-on conflicts and congestion conflicts. The research outputs a vehicle scheduling scheme, enriches the theory of tunnel traffic scheduling, and provides scientific and feasible technical support for the coordinated scheduling of construction vehicles in long and large tunnels.