A Creation Method of Passenger Traffic Plan Based on Feasible Label Continuation Network

Abstract

The present invention provides a passenger traffic planning method based on the feasible label connection network, the feasible label connection network is obtained according to the combined calculation of the feasible routes, and the planning model is obtained according to the integrated calculation of the feasible label connection network and the preset rules; using Lagrang The daily relaxation algorithm iteratively solves the planning model, and obtains the optimal solution, which is the intersection plan. The invention can greatly reduce the scale of computer memory required for calculation, so that results can be obtained in a relatively short period of time, and is especially suitable for large-scale road planning; the lower and upper bounds obtained by the Lagrangian relaxation algorithm converge to The optimal value, the gap between the upper and lower bounds is small, the solution quality is high, and it can prepare a high-quality passenger traffic plan for the railway system; comprehensively considering a variety of passenger rules, it is closer to reality and ensures the feasibility and reliability of the passenger traffic plan. authenticity.

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