In this paper, we present a track-circuits-based model for robust train platforming problem (RTPP) at busy complex stations. First, we explicitly explained the operation process of different train types and fixed track utilization rule. Second, we propose a multicriterion scheduling model for RTPP with objectives of minimizing the weighted number of delayed trains, minimizing trains that break rules, and maximizing robustness based on sectional-release interlocking system. Third, we design a hybrid heuristic algorithm to solve the above model based on dispatching rules and present different new solution generation strategies to further optimize rule-based solutions. Performance of the new solution generation strategies and algorithm is evaluated based on a case study for Guangzhou East Station. To validate the effectiveness of robustness indicator, we compared its performance on delay propagation counteraction with a TPP model without robustness objective under the same perturbation scenario.
In order to promote the cost reduction and efficiency improvement of the logistics distribution process and to guarantee the safety of goods transportation, this paper studies the portfolio optimization of goods loading and the problem of simultaneous pickup and delivery vehicle routing. A balanced loading constraint was introduced to restrict loading through two aspects of axle weight bearing and lateral center-of-gravity offset. With the shortest total route length as the objective, this paper constructs a simultaneous pickup and delivery vehicle routing model with three-dimensional (3D) balanced loading constraints (3BL-VRPSPD). Additionally, a hybrid tabu search (TS) algorithm embedded loading test was proposed to solve this problem. Firstly, a heuristic insertion method was applied to determine the initial routing scheme, and the node swapping and relocation operators were designed to construct the tabu neighborhood scheme for routing optimization. On this basis, the 3D balanced loading was incorporated into the routing iteration process. A balanced loading algorithm, combining multiple-indicator ordering and maximum space division strategies (MOMD), was formulated to develop a 3D-balanced loading plan for goods with a pickup and delivery vehicle routing scheme. Finally, standard instances verified the effectiveness of the method. The results show that the proposed method can effectively optimize 3BL-VRPSPD and outperform other algorithms.
Track failure at a railway station is a common disruption in the station area caused by abnormal weather or frequent use. This paper focuses on the real-time track reallocation problem to recover the affected track utilization plan and minimize the total train delays and passenger inconveniences. Train platforming operations in busy complex passenger stations are generally conducted according to fixed track utilization rules. In this paper, we presented a mixed-integer linear programming model for train platforming problems with constraints relevant to fixed track utilization rule and objectives of balanced usage of tracks. Furthermore, we proposed an improved genetic simulated annealing algorithm based on improved crossover and selection methods without breaking the fixed track utilization rule constraint. An experiment of Guanzhou East Station with fixed track utilization rules shows the effectiveness of the proposed model and algorithm. The model and algorithm provide efficient approaches for track reallocation problems based on fixed track utilization rules in busy complex passenger stations.
It is well known that stability, center-of-gravity balance, and concentrated-weight are key factors of the transportation safety. The reasonable formulation of the loading layout scheme ensures the safety of shipment based on fully utilizing the effective volume and load capacity of freight vehicles. This paper takes the railway mixed goods loading layout as the research object, considering the constraints such as goods loading center-of-gravity balance, the allowable moment of concentrated-weight, supporting and goods placement mode, and taking the maximum comprehensive utilization rates for both effective volume and load capacity of freight vehicle as the optimization objective, an optimization model of railway mixed goods balanced and anticoncentrated-weight loading layout considering stability is built. Additionally, this paper designs mixed goods classified and simple/general goods block composition methods. We improve the representation and selection of layout space, construct goods block selection algorithm based on the greedy d-step lookahead tree search and goods block evaluation function and propose a goods block placement strategy and update rules of layout space after goods block placement. An optimization algorithm of railway mixed goods balanced and anticoncentrated-weight load layout considering stability is designed. The results show that the formulated scheme not only ensures that the goods meet the full support constraints, but also the comprehensive utilization rate of the effective volume and load capacity of the vehicle is not less than 89%, and the probability of meeting the loading center-of-gravity balance and allowable moment of concentrated-weight are as high as 99% and 99.47%, respectively. The proposed method realizes the balanced and anticoncentrated-weight loading of railway mixed goods, ensures the safe, stable, and efficient goods loading, and provides decision support for the safe loading layout of railway goods.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.