With the continuous development of engineering construction in China, more and more large-section highway tunnels have emerged. Different geological engineering environments determine the diversity of construction plans. The determination of construction plans and the prediction of tunnel deformations have always been the key points of engineering construction. In this paper, we use numerical simulations to determine specific construction parameters in the context of actual highway tunnel projects, and then use deep learning methods to predict deformation during tunnel construction, thus providing guidance for construction. We have found that: (i) Different excavation sequences and excavation depths have different effects on the surrounding rock deformation around the tunnel. The optimal excavation sequence through numerical simulation in this study is symmetrical excavation, and the excavation depth is 2 m. (ii) Numerical simulation based on Long Short-Term Memory (LSTM) algorithm is used to predict the tunnel deformation. It is found that the prediction results of the LSTM algorithm are more consistent with the actual monitoring data. (iii) Multi-step prediction is more important for engineering guidance, and three-step prediction can be considered during the process of engineering construction. Therefore, the machine learning algorithm provides a new method for engineering prediction.
Electric vehicles (EVs) are a promising option to reduce air pollution and shipping costs, especially in urban areas. To provide scientific guidance for the growing number of logistics companies using EVs, we investigated an electric-vehicle-routing problem with simultaneous pickup and delivery that also considers non-linear charging and load-dependent discharging (EVRPSPD-NL-LD). The objective was to minimize the total number of EVs and the total working time, including travel time, charging time, waiting time, and service time. We formulated the problem as a mixed integer linear program (MILP), and small-size problems could be solved to optimality in an acceptable amount of time using the commercial solver IBM ILOG CPLEX Optimization Studio (CPLEX). In view of the fact that the problem is NP-hard, an adaptive large neighborhood search (ALNS) metaheuristic method was proposed to solve large-size problems. Meanwhile, new operators and a time priority approach were developed to provide options for different scenarios. The results of our computational investigation and sensitivity analysis showed that the proposed methods are effective and efficient for modified benchmark instances.
Highway merging bottleneck is challenged with serious traffic conflicts between on-ramp and mainline vehicles, causing significant capacity drop and drastic speed changes. The paper proposes an adaptive coordinated variable speed limit model to manage highway speed of on-ramp and mainline continuous sections without priority to mainline. That helps to remove the speed difference between the vehicles from on-ramp and mainline flooding into the merging zone, and to sustain actual traffic density close to critical density to counteract capacity drop as indicated with macroscopic fundamental diagram. The method of deep reinforcement learning based on deep deterministic policy gradient is employed to solve the proposed model with a row of continuous control variables. Simulation platform with VISSIM 5.3 is established, and the proposed method can enhance traffic flow through the merging zone by around 10% and 19% under static and dynamic demand, respectively, in addition to reduced density and speed variation by around 30%. This research provides insights into the management of highway capacity so as to secure traffic efficiency and reliability for the merging zone.
Urban transportation demands are growing rapidly. Concurrently, the sharing economy continues to expand. These dual trends establish ride-hailing dispatch as a critical research focus for building sustainable smart transportation systems. Current ride-hailing systems only serve passengers. However, they ignore an important opportunity: transporting packages. This limitation causes two issues: (1) wasted vehicle capacity in cities, and (2) extra carbon emissions from cars waiting idle. Our solution combines passenger rides with package delivery in real time. This dual-mode strategy achieves four benefits: (1) better matching of supply and demand, (2) 38% less empty driving, (3) higher vehicle usage rates, and (4) increased earnings for drivers in changing conditions. We built a Dynamic Heterogeneous Demand-aware Ride-hailing Dispatch System (DHDRDS) using deep reinforcement learning. It works by (a) managing both passenger and package requests on one platform and (b) allocating vehicles efficiently to reduce the environmental impact. An empirical validation confirms the developed framework’s superiority over conventional approaches across three critical dimensions: service efficiency, carbon footprint reduction, and driver profits. Specifically, DHDRDS achieves at least a 5.1% increase in driver profits and an 11.2% reduction in vehicle idle time compared to the baselines, while ensuring that the majority of customer waiting times are within the system threshold of 8 min. By minimizing redundant vehicle trips and optimizing fleet utilization, this research provides a novel solution for advancing sustainable urban mobility systems aligned with global carbon neutrality goals.
In this paper, we consider an application of lot-streaming for processing a lot of multiple items in a hybrid flow shop (HFS) for the objective of minimizing makespan. The HFS that we consider consists of two stages with a single machine available for processing in Stage 1 and m identical parallel machines in Stage 2. We call this problem a 1 + m TSHFS-LSP (two-stage hybrid flow shop, lot streaming problem), and show it to be NP-hard in general, except for the case when the sublot sizes are treated to be continuous. The novelty of our work is in obtaining closed-form expressions for optimal continuous sublot sizes that can be solved in polynomial time, for a given number of sublots. A fast linear search algorithm is also developed for determining the optimal number of sublots for the case of continuous sublot sizes. For the case when the sublot sizes are discrete, we propose a branch-and-bound-based heuristic to determine both the number of sublots and sublot sizes and demonstrate its efficacy by comparing its performance against that of a direct solution of a mixed-integer formulation of the problem by CPLEX®.