Feasible label continuing network-based crew affair route planning method

Abstract

The invention provides a feasible label continuing network-based crew affair route planning method, which comprises the following steps of combining and calculating feasible routes to obtain a feasible label continuing network, and integrating and calculating according to the feasible label continuing network and a preset rule to obtain a planning model; and carrying out iterative solution on theplanning model by utilizing a Lagrange relaxation algorithm to obtain an optimal solution, namely the intersection plan. According to the method, the computer memory occupation scale required by calculation can be greatly reduced, so that a result can be obtained in a short time, and the method is particularly suitable for large-scale route planning; the lower bound value and the upper bound valueobtained by the Lagrange relaxation algorithm are converged to the optimal value, the difference between the upper bound value and the lower bound value is small, the solving quality is high, and a high-quality crew traffic plan can be compiled for a railway system. Various crew rules are comprehensively considered, so that the method is closer to reality, and the feasibility and authenticity ofa crew route plan are ensured.

Description

technical field [0001] The invention relates to a method for formulating passenger traffic plan based on a feasible label connection network, which belongs to the technical field of computer data processing. Background technique [0002] The railway passenger traffic planning problem is usually abstracted as a set covering / partitioning problem with additional constraints. The three most common solutions for solving large-scale set covering / partitioning models are branch pricing algorithms, Lagrangian relaxation algorithms, and a combination of heuristic algorithms and relaxation algorithms. No matter which solution method is used, we are working on exploring more effective strategies to improve the quality and efficiency of the solution, such as strategies to reduce the network size, more effective branching / pruning strategies, and cross-path selection strategies. [0003] In addition to the set cover / partition model, the railway passenger traffic plan can also be modeled a...

AI Technical Summary

Problems solved by technology

[0006] (1) The crew rules considered in existing studies contain fewer rules, such as the lack of crew dining rules, which cannot fully describe the various rules that need to be met in actual situations, and simply adding the number of rules will undoubtedly lead to a substantial increase in complexity , the calculation scale increases;

[0007] (2) The exact solution methods in existing studies are only suitable for small-scale passenger traffic planning solutions. Once the scale becomes large, these solution methods can easily lead to computer memory overflow, and the solution time will also become slow

Images