Search

Accidents, bad weathers, traffic congestions, etc. led to the uncertainties of travel times in real-life road networks, which greatly affected the quality of individual’s life and the reliability of transportation system. This paper addressed the school bus routing problem in such a stochastic and time-dependent road environment. Firstly, the problem was set based on a single-school configuration, and the students were picked up at their homes, which was in line with the current situation of school bus systems in China. Thus, it could be regarded as an independent problem of school bus route generation in random dynamic networks, which could be solved as a variant of extended Vehicle Routing Problem. However, due to the fluctuation and uncertainty of link travel times, the arrival time at each stop including the destination was varying. Therefore, the selection of optimal path connecting the current service node with the next one was treated as a sub-problem in this study, where the reliability of travel times in the stochastic and time-varying network was highly concerned by such time-rigid commuters. To this end, a Robust Optimal Schedule Times model with a hard time windows constraint was built to generate a most cost-reliable route for school buses. By the use of Robust Optimization method, it was intended to minimize the worst-case total cost which combined the cost of earlier schedule delays with the disutility of travel times. It was also proved that the proposed model could be converted into solving a conventional problem in deterministic dynamic networks for a reduction of computation complexity, which provided the potential of applying to the practical problems. Finally, the validity of the proposed model and its performance evaluation was analyzed through a small-scale computational instance, where all the link travel times in the simulated network were attributed to both time-varying and stochastic. Then, a mathematical programming solver was used to find the exact optimal solution. The results indicated that the model was valid, and the necessity of considering the stochastic and time-dependent nature of transportation networks was also confirmed in the case study. [ABSTRACT FROM AUTHOR]

As a sustainable transportation mode, high-speed railway (HSR) has become an efficient way to meet the huge travel demand. However, due to the high acquisition and maintenance cost, it is impossible to build enough infrastructure and purchase enough train-sets. Great efforts are required to improve the transport capability of HSR. The utilization efficiency of train-sets (carrying tools of HSR) is one of the most important factors of the transport capacity of HSR. In order to enhance the utilization efficiency of the train-sets, this paper proposed a train-set circulation optimization model to minimize the total connection time. An innovative two-stage approach which contains segments generation and segments combination was designed to solve this model. In order to verify the feasibility of the proposed approach, an experiment was carried out in the Beijing-Tianjin passenger dedicated line, to fulfill a 174 trips train diagram. The model results showed that compared with the traditional Ant Colony Algorithm (ACA), the utilization efficiency of train-sets can be increased from 43.4% (ACA) to 46.9% (Two-Stage), and 1 train-set can be saved up to fulfill the same transportation tasks. The approach proposed in the study is faster and more stable than the traditional ones, by using which, the HSR staff can draw up the train-sets circulation plan more quickly and the utilization efficiency of the HSR system is also improved. [ABSTRACT FROM AUTHOR]