Feasible label continuing network-based crew affair route planning method

• Main Authors: WANG YING, ZHANG ZHEMING, ZHANG JINCHUAN, XIANG DUBING
• Format: Patent
• Language: Chinese; English
• Published: 18.12.2020
• Subjects: CALCULATING; COMPUTING; COUNTING; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES; ELECTRIC DIGITAL DATA PROCESSING; PHYSICS; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR

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 p