Energy-efficient metro operation has received increasing attention because of the energy cost and environmental concerns. This paper developed an integrated optimization model on train control and timetable to minimize the net energy consumption. The extents of train motoring and braking as well as timetable configurations such as train headway and interstation runtime are optimized to minimize the net energy consumption with consideration of utilizing regenerative energy. An improved model on train control is proposed to reduce traction energy by allowing coasting on downhill slopes as much as possible. Variations of train mass due to the change of onboard passengers are taken into account. The brute force algorithm is applied to attain energy-efficient speed profiles and an NS-GSA algorithm is designed to attain the optimal extents of motoring/braking and timetable configurations. Case studies on Beijing Metro Line 5 illustrate that the improved train control approach can save traction energy consumption by 20% in the sections with steep downhill slopes, in comparison with the commonly adopted train control sequence in timetable optimization. Moreover, the integrated model is able to significantly prolong the overlapping time between motoring and braking trains, and the net energy consumption is accordingly reduced by 4.97%.
Various traffic-sensing technologies have been employed to facilitate traffic control. Due to certain factors, e.g., malfunctioning devices and artificial mistakes, missing values typically occur in the Intelligent Transportation System (ITS) sensing datasets, resulting in a decrease in the data quality. In this study, an integrated imputation algorithm based on fuzzy C-means (FCM) and the genetic algorithm (GA) is proposed to improve the accuracy of the estimated values. The GA is applied to optimize the parameter of the membership degree and the number of cluster centroids in the FCM model. An experimental test of the taxi global positioning system (GPS) data in Manhattan, New York City, is employed to demonstrate the effectiveness of the integrated imputation approach. Three evaluation criteria, the root mean squared error (RMSE), correlation coefficient (R), and relative accuracy (RA), are used to verify the experimental results. Under the ±5% and ±10% thresholds, the average RAs obtained by the integrated imputation method are 0.576 and 0.785, which remain the highest among different methods, indicating that the integrated imputation method outperforms the history imputation method and the conventional FCM method. On the other hand, the clustering imputation performance with the Euclidean distance is better than that with the Manhattan distance. Thus, our proposed integrated imputation method can be employed to estimate the missing values in the daily traffic management.
1 April 2012 in Journal of Transportation Systems Engineering and Information Technology
On an oversaturated urban rail transit line, passengers at downstream stations have to wait for more trains until they get aboard, resulting in service imbalance problem. To improve the service quality, this paper proposes an integrated optimization approach combining the train timetabling and collaborative passenger flow control, with the aim of minimizing indicators associated with the passenger service imbalance and train loading capacity utilization. Considering train regulation constraints and passenger loading dynamics, a mixed-integer linear programming model is formulated. Based on the linear weighting technique, an iterative heuristic algorithm combining the tabu search and Gurobi solver is designed to solve the proposed model. Finally, a simple case with different-scale instances is used to verify that the proposed algorithm can obtain near-optimal solution efficiently. Moreover, a real-world case of Beijing Subway Batong Line is implemented to compare performances of the proposed approach with those under the original timetable and noncollaborative passenger flow control.
Last train coordination aims to synchronize the arrival and departure times of the last feeder trains and the last connecting trains at transfer stations to improve the transfer accessibility of urban rail networks. This study focuses on the transfer accessibility between last trains with considering heterogeneous transfer walking time. Three mathematical models are developed on the last train timetable optimization. The first model fine-tunes the last train timetable under the given bound of the dwell time. The second one aims to allow the mutual transfers with the prolonged dwell time to maximize the transfer accessibility. A biobjective function is proposed to seek the trade-off between the maximal transfer accessibility and the minimal extension of dwell time. The third model considers the heterogeneity of transfer walking time that is represented as a random variable following a probability distribution. A discrete approximation method is proposed to reformulate the nonlinear model. The embedded Branch & Cut algorithm of CPLEX is applied to solve the models. A real case on the Shenzhen metro network is conducted to demonstrate the performance of the models. The three models all provide better last train timetable than the current timetable in practice. The sensitivity analysis manifests that the third model are always advantageous in the optimization of successful transfer passengers.
Focusing on the multi-depot vehicle routing problem (MDVRP) for hazardous materials transportation, this paper presents a multi-objective optimization model to minimize total transportation energy consumption and transportation risk. A two-stage method (TSM) and hybrid multi-objective genetic algorithm (HMOGA) are then developed to solve the model. The TSM is used to find the set of customer points served by each depot through the global search clustering method considering transportation energy consumption, transportation risk, and depot capacity in the first stage, and to determine the service order of customer points to each depot by using a multi-objective genetic algorithm with the banker method to seek dominant individuals and gather distance to keep evolving the population distribution in the second stage, while with the HMOGA, customer points serviced by the depot and the serviced orders are optimized simultaneously. Finally, by experimenting on two cases with three depots and 20 customer points, the results show that both methods can obtain a Pareto solution set, and the hybrid multi-objective genetic algorithm is able to find better vehicle routes in the whole transportation network. Compared with distance as the optimization objective, when energy consumption is the optimization objective, although distance is slightly increased, the number of vehicles and energy consumption are effectively reduced.