scholarly journals Optimizing Crew Rostering with Multilicense on High-Speed Railway Lines

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Zhiqiang Tian
Keyword(s):  
Integer Programming ◽  
High Speed ◽  
Ant Colony Algorithm ◽  
Programming Model ◽  
Working Time ◽  
High Speed Railway ◽  
Crew Rostering ◽  
Crew Rostering Problem ◽  
Time Standard ◽  
Improved Ant Colony Algorithm

This paper studies the crew rostering problem with the consideration of multilicense of crewmembers. A 0-1 integer programming model is established to minimize the number of crewmembers used and to maintain the working time balance and the income balance of crewmembers. The method for calculating the reasonable cycle schemes is designed by considering the parameters of monthly working time standard and the number and the average working time of crew routes. The order for selecting the optimal cycle scheme is then determined with consideration of the connection relationships between crew routes. According to the characteristics of the problem and the requirements in application, this paper presents the design of an improved ant colony algorithm for solving the optimization model. The reasonableness of the model and the effectiveness of the algorithm are verified by a numerical example with 43 generated crew routes.

scholarly journals Modeling and Algorithms of the Crew Rostering Problem with Given Cycle on High-Speed Railway Lines

2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
Zhiqiang Tian ◽  
Huimin Niu
Keyword(s):  
High Speed ◽  
Ant Colony Algorithm ◽  
Set Covering ◽  
Covering Problem ◽  
High Speed Railway ◽  
Crew Rostering ◽  
Crew Rostering Problem ◽  
Plan Making ◽  
Higher Regularity ◽  
Improved Ant Colony Algorithm

This paper studies the modeling and algorithms of crew roster problem with given cycle on high-speed railway lines. Two feasible compilation strategies for work out the crew rostering plan are discussed, and then an integrated compilation method is proposed in this paper to obtain a plan with relatively higher regularity in execution and lower crew members arranged. The process of plan making is divided into two subproblems which are decomposition of crew legs and adjustment of nonmaximum crew roster scheme. The decomposition subproblem is transformed to finding a Hamilton chain with the best objective function in network which was solved by an improved ant colony algorithm, whereas the adjustment of nonmaximum crew rostering scheme is finally presented as a set covering problem and solved by a two-stage algorithm. The effectiveness of the proposed models and algorithms are testified by a numerical example.

scholarly journals Simultaneous Optimization of Train Timetabling and Platforming Problems for High-Speed Multiline Railway Network

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Qin Zhang ◽  
Xiaoning Zhu ◽  
Li Wang ◽  
Shuai Wang
Keyword(s):  
High Speed ◽  
Optimization Problems ◽  
Programming Model ◽  
Simultaneous Optimization ◽  
Resource Assignment ◽  
Railway Network ◽  
High Speed Railway ◽  
Train Timetabling ◽  
Train Timetable ◽  
Railway Operation

The optimization problems of train timetabling and platforming are two crucial problems in high-speed railway operation; these problems are typically considered sequentially and independently. With the construction of high-speed railways, an increasing number of interactions between trains on multiple lines have led to resource assignment difficulties at hub stations. To coordinate station resources for multiline train timetables, this study fully considered the resources of track segments, station throat areas, and platforms to design a three-part space-time (TPST) framework from a mesoscopic perspective to generate a train timetable and station track assignment simultaneously. A 0-1 integer programming model is proposed, whose objective is to minimize the total weighted train running costs. The construction of a set of incompatible vertexes and links facilitates the expression of difficult constraints. Finally, example results verify the validity and practicability of our proposed method, which can generate conflict-free train timetables with a station track allocation plan for multiple railway lines at the same time.

scholarly journals A Study on the Practical Carrying Capacity of Large High-Speed Railway Stations considering Train Set Utilization

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Bin Guo ◽  
Leishan Zhou ◽  
Yixiang Yue ◽  
Jinjin Tang
Keyword(s):  
Carrying Capacity ◽  
High Speed ◽  
Programming Model ◽  
High Speed Railway ◽  
Railway Stations ◽  
China Studies ◽  
Important Nodes ◽  
Entire Network

Methods for solving the carrying capacity problem for High-Speed Railways (HSRs) have received increasing attention in the literature in the last few years. As important nodes in the High-Speed Railway (HSR) network, large stations are usually the carrying capacity bottlenecks of the entire network due to the presence of multiple connections in different directions and the complexity of train operations at these stations. This paper focuses on solving the station carrying capacity problem and considers train set utilization constraints, which are important influencing factors that have rarely been studied by previous researchers. An integer linear programming model is built, and the CPLEX v12.2 software is used to solve the model. The proposed approach is tested on a real-world case study of the Beijing South Railway Station (BS), which is one of the busiest and most complex stations in China. Studies of the impacts of different train set utilization constraints on the practical station carrying capacity are carried out, and some suggestions are then presented for enhancing the practical carrying capacity. Contrast tests indicate that both the efficiency of the solving process and the quality of the solution show huge breakthroughs compared with the heuristic approach.

Application of Particle Swarm Algorithm in Train-Set Circulation Problem of China

2012 ◽  
Vol 253-255 ◽  
pp. 1235-1240
Author(s):  
Hua Li ◽  
Bao Ming Han ◽  
Fang Lu ◽  
Xiao Juan Li
Keyword(s):  
High Speed ◽  
Particle Swarm Optimization Algorithm ◽  
Programming Model ◽  
Real Life ◽  
Particle Swarm ◽  
Particle Swarm Algorithm ◽  
High Speed Railway ◽  
Railway Line ◽  
Circulation Problem

Train-set circulation problem is an important issue in operations of high-speed passenger trains in the world. On the basis of characteristics of the train-set circulation problem in China, an integer programming model is presented without considering distinct train-set types. With redefinitions of some basic mathematical objects and operations, an improved particle swarm optimization algorithm is proposed to solve the model. The algorithm is applied in a real-life case study based on the timetable of the Wuhan-Guangzhou High-speed Railway Line. The results show that the proposed algorithm is effective to find the optimized train-set circulation plan.

scholarly journals Optimization Problem of Pricing and Seat Allocation Based on Bilevel Multifollower Programming in High-Speed Railway

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Lianbo Deng ◽  
Jing Xu ◽  
Ningxin Zeng ◽  
Xinlei Hu
Keyword(s):  
Optimization Model ◽  
Dynamic Pricing ◽  
High Speed ◽  
Large Scale ◽  
Solution Method ◽  
Programming Model ◽  
Divide And Conquer ◽  
Small Scale ◽  
High Speed Railway ◽  
Seat Allocation

This paper studies the multistage pricing and seat allocation problems for multiple train services in a high-speed railway (HSR) with multiple origins and destinations (ODs). Taking the maximum total revenue of all trains as the objective function, a joint optimization model of multistage pricing and seat allocation is established. The actual operation constraints, including train seat capacity constraints, price time constraints in each period, and price space constraints among products, are fully considered. We reformulate the optimization model as a bilevel multifollower programming model in which the upper-level model solves the seat allocation problem for all trains serving multiple ODs in the whole booking horizon and the lower optimizes the pricing decisions for each train serving each OD in different decision periods. The upper and lower are a large-scale static seat allocation programming and many small-scale multistage dynamic pricing programming which can be solved independently, respectively. The solving difficulty can be significantly reduced by decomposing. Then, we design an effective solution method based on divide-and-conquer strategy. A real instance of the China’s Wuhan-Guangzhou high-speed railway is employed to validate the advantages of the proposed model and the solution method.

scholarly journals Graph Coloring based Heuristic for Crew Rostering

2020 ◽  
Author(s):  
László Hajdu ◽  
Attila Tóth ◽  
Miklós Krész
Keyword(s):  
Mathematical Model ◽  
Graph Coloring ◽  
Financial Management ◽  
Input Data ◽  
Programming Model ◽  
Real Life ◽  
Personnel Cost ◽  
Two Phase ◽  
Crew Rostering ◽  
Crew Rostering Problem

In the last years personnel cost became a huge factor in the financial management of many companies and institutions.The firms are obligated to employ their workers in accordance with the law prescribing labour rules. The companies can save costs with minimizing the differences between the real and the expected worktimes. Crew rostering is assigning the workers to the previously determined shifts, which has been widely studied in the literature. In this paper, a mathematical model of the problem is presented and a two-phase graph coloring method for the crew rostering problem is introduced. Our method has been tested on artificially generated and real life input data. The results of the new algorithm have been compared to the solutions of the integer programming model for moderate-sized problems instances.

Research on Data Management for China Railway Based on Computer Science

2014 ◽  
Vol 631-632 ◽  
pp. 1304-1307
Author(s):  
Jun Cheng
Keyword(s):  
Data Management ◽  
High Speed ◽  
Programming Model ◽  
Three Dimensions ◽  
Technical Solution ◽  
Time Dimension ◽  
High Speed Railway ◽  
Challenges And Opportunities ◽  
China Railway ◽  
Dimension Space

This article introduces content and utilization status of railway data management. In view of the characteristics of diversity, dispersion and mass memory, this paper puts forward an integration analysis method from three dimensions-time dimension, space dimension and category. This paper proposes a framework of data management of high-speed railway equipment, where cloud computing provides a feasible technical solution combined with MapReduce programming model based on Hadoop platform. These models are capable of considering the characteristics of data and processing demand in management of High-speed railway equipment. Finally, we summarize the challenges and opportunities with Big Data for application of China railway and point out there is more than enough that we can work on.

Sign in / Sign up

Export Citation Format

Share Document