Globally, traffic accidents on the highway network contribute significantly to a high fatality rate, drawing considerable attention from health institutions. The efficiency of transportation plays a vital role in mitigating the severe consequences of these incidents. This study delves into the issues of emergency vehicles experiencing delays despite having priority. Therefore, we construct mixed-integer linear programming with semi-soft time windows (MIPSSTW) model for optimizing emergency vehicle routing in highway incidents. We analyze the time-varying and complex traffic situations and respectively propose corresponding estimation approaches for the travel time of road segments, intersections on the urban road network, and ramp-weave sections on the highway network. Furthermore, we developed a modified cuckoo search(MCS) algorithm to solve this combinatorial problem. Optimization strategies of Lévy flight and dynamic inertial weight strategy are introduced to strengthen the exploration capability and the diversity of solution space of the CS algorithm. Computational experiments based on the Chinese emergency medical system data are designed to validate the efficacy and effectiveness of the MIPSSTW model and MCS algorithm. The results show that our works succeed in searching for high-quality solutions for emergency vehicle routing problems and enhance the efficacy of strategic decision-making processes in the realm of incident management and emergency response systems.

The phenomenon of stop-and-go traffic and its environmental impact has become a crucial issue that needs to be tackled, in terms of the junctions between freeway and urban road networks, which consist of freeway off-ramps, downstream intersections, and the junction section. The development of Connected and Automated Vehicles (CAVs) has provided promising solutions to tackle the difficulties that arise along intersections and freeway off-ramps separately. However, several problems still exist that need to be handled in terms of junction structure, including vehicle merging trajectory optimization, vehicle crossing trajectory optimization, and heterogeneous decision-making. In this paper, a two-stage CAV trajectory optimization strategy is presented to improve fuel economy and to reduce delays through a joint framework. The first stage considers an approach to determine travel time considering the different topological structures of each subarea to ensure maximum capacity. In the second stage, Pontryagin’s Minimum Principle (PMP) is employed to construct Hamiltonian equations to smooth vehicle trajectory under the requirements of vehicle dynamics and safety. Targeted methods are devised to avoid driving backwards and to ensure an optimal vehicle gap, which make up for the shortcomings of the PMP theory. Finally, simulation experiments are designed to verify the effectiveness of the proposed strategy. The evaluation results show that our strategy could effectively militate travel delays and fuel consumption.