CN110135721B - Train passenger ticket supplementing scheduling method based on overload limitation of dynamic reverse calculation - Google Patents

Train passenger ticket supplementing scheduling method based on overload limitation of dynamic reverse calculation Download PDF

Info

Publication number
CN110135721B
CN110135721B CN201910384012.1A CN201910384012A CN110135721B CN 110135721 B CN110135721 B CN 110135721B CN 201910384012 A CN201910384012 A CN 201910384012A CN 110135721 B CN110135721 B CN 110135721B
Authority
CN
China
Prior art keywords
station
tickets
train
maximum number
current
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910384012.1A
Other languages
Chinese (zh)
Other versions
CN110135721A (en
Inventor
贾文友
曹紫阳
刘莉
何慧娟
王子辉
石平
贾昊瑞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Anhui Polytechnic University
Original Assignee
Anhui Polytechnic University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Anhui Polytechnic University filed Critical Anhui Polytechnic University
Priority to CN201910384012.1A priority Critical patent/CN110135721B/en
Publication of CN110135721A publication Critical patent/CN110135721A/en
Application granted granted Critical
Publication of CN110135721B publication Critical patent/CN110135721B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315Needs-based resource requirements planning or analysis
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40Business processes related to the transportation industry

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Educational Administration (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Train Traffic Observation, Control, And Security (AREA)

Abstract

The train passenger ticket supplementing dispatching method based on the overload limitation of the dynamic reverse calculation comprises the steps of accumulating the number and classification of specific passengers at each station in real time, extracting and accumulating the number of tickets which are sold in advance at each station, performing the dynamic reverse calculation, and judging the dispatching termination condition; the dynamic reverse calculation overall requirement is that the number of tickets which are sold in advance in each station is extracted and accumulated according to the real-time accumulation of the number and classification of specific passengers in each station, the maximum number of tickets which are allowed to be replenished in the last station in the current station is calculated in real time, the maximum number of tickets which are allowed to be replenished in the next station after the current station is calculated in real time is calculated, the maximum number of tickets which are allowed to be replenished in all stations between the next station and the last station after the current station is calculated in real time, and the expressions of the maximum number of tickets which are allowed to be replenished form an integral model which must be satisfied at the same time and is updated dynamically, and the integral model belongs to a dynamic model; the termination condition is that the current station is the end station of the train. The train passenger ticket supplementing dispatching control system is simple in concept, convenient to implement and beneficial to effective train passenger ticket supplementing dispatching control in the rush hour.

Description

Train passenger ticket supplementing scheduling method based on overload limitation of dynamic reverse calculation
Technical Field
The invention relates to the technical field of scheduling methods, in particular to a train passenger ticket supplementing scheduling method based on overload limitation of dynamic reverse calculation.
Background
Trains (particularly high-speed railways) have become one of the most important transportation means for people to travel. Currently, people holding train tickets (or high-speed railway tickets) which are predetermined in advance cannot board the corresponding trains in the shift because the trains (or high-speed railways) are overloaded, and the trip plan is seriously influenced. The reason that people having train tickets (or high-speed railway tickets) which are predetermined in advance can not board the corresponding trains of the shifts is various due to overloading of the trains (or the high-speed railways), wherein the main reason is that passengers can not buy the tickets of the destination, only short-distance tickets can be bought, then the tickets are loaded and supplemented, the situation that the short-distance tickets are bought and the long-distance tickets are changed into the situation that the long-distance tickets are supplemented, passengers on the trains (or the high-speed railways) are subjected to accumulative explosion, and finally overload is formed, so that people having the train tickets (or the high-speed railway tickets) which are predetermined in advance can not board the corresponding trains of the shifts due to overloading of the trains (or the high-speed railways). This is a new topic faced by train passenger ticketing with overload restrictions.
At present, the train passenger with overload limitation has no scheduling method for supplementing tickets, so that the condition that the overload of a train (or a high-speed rail) cannot meet the condition that people with the train tickets (or the high-speed rail tickets) predetermined in advance board the corresponding train of a shift is met, and only full or compensatory returning tickets can be adopted and regress is given; and there is an authority impact on train tickets (or high-speed rail tickets).
Disclosure of Invention
In order to overcome the defect that the existing train passenger compensation ticket with overload limitation has no scheduling method, so that the condition that the train (or high-speed railway) overload cannot meet the condition that people with train tickets (or high-speed railway tickets) which are predetermined in advance board the corresponding train of a shift is overcome, only full or compensation return tickets can be adopted, and regress is performed; the invention provides a train passenger ticket compensation scheduling method based on overload limitation of dynamic reverse calculation based on the passenger number calculated by the dynamic reverse calculation.
The technical solution adopted by the invention to specifically solve the technical problem is as follows:
the train passenger ticket supplementing scheduling method based on the overload limitation of the dynamic reverse calculation comprises the steps of accumulating the specific number and classification of passengers at each station in real time, extracting and accumulating the number of tickets sold in advance at each station, calculating the constraint condition of the maximum number of tickets to be supplemented at the last station allowed by the current station in real time, calculating the constraint condition of the maximum number of tickets to be supplemented at the next station allowed by the current station in real time, dynamically calculating the reverse direction, judging the scheduling termination condition, the total number of stations stopping along the way of the train and the maximum carrying capacity of passengers of the train. The dynamic reverse calculation overall requirement is that the number of the pre-sold tickets of each station is extracted and accumulated according to the real-time accumulation of the number and classification of specific passengers of each station, and the maximum number of the allowed tickets for the last station at the current station is calculated from the real-time calculation of the maximum number of the allowed tickets for the last station at the current station to the real-time calculation of the maximum number of the allowed tickets for the next station at the current station, and the maximum number of the allowed tickets for all stations between the next station behind the current station and the last station is dynamically calculated in turn. The specific scheduling steps are as follows:
step 1, accumulating the number and classification of specific passengers at each station in real time: calculate Bi,j,Bi,jRepresenting the real-time specific passenger result when the j station gets off the train to the i station, and n represents the total number of the stop stations along the way of the train, wherein j is more than or equal to 1 and less than or equal to j<i is less than or equal to n, and i, j and n all belong to natural numbers;
step 2, extracting and accumulating the number of tickets sold in advance at each station: calculate Ci,j,Ci,jRepresenting the result of pre-selling the real-time specific passengers getting off from the ith station at the jth station, and n represents the total number of the stations along the way of the train, wherein j is more than or equal to 1 and less than or equal to j<i is less than or equal to n, and i, j and n all belong to natural numbers;
step 3, calculating the constraint condition of the maximum number of the ticket compensation allowed by each station after the current station in real time: the calculation model is as follows
Figure GDA0003537726560000021
Here, the current station is denoted as the jth station; t represents the maximum load capacity of train passengers, is the number of overload limits of the train, and belongs to a natural number; qn,jA constraint condition representing the maximum number of n supplementary tickets of the last station allowed by the jth station of the current station; qn-1,jA constraint condition of maximum number of supplementary tickets of a previous station for allowing a last station n at the jth station of the current station; qn-2,jRepresenting the constraint condition of the maximum number of the supplementary tickets of the first two stations of the jth station of the current station for allowing the last station n; qj+1,jA constraint condition representing the maximum allowable number of ticket compensation of a j +1 th station of a station next to the j th station of the current station; three solid dots "…" represent a computational expression with the constraint of omitting the maximum number of allowable supplementary tickets at the stations from the (n-3) th station to the (j + 2) th station in the middle; a and b denote the a-th and b-th stations, respectivelyA and b belong to natural numbers;
and 4, dynamic reverse calculation: the constraint condition of the maximum number of the ticket compensation of each station in the step 3 is an expression of the constraint condition of the maximum number of the allowable ticket compensation of the j +1 th station which is sequentially and reversely calculated from the last station to the next station of the j th station of the current station, and the maximum number of the allowable ticket compensation of the n-j stations; the expression of the constraint condition of the maximum number of allowable ticket replenishment of the n-j station requires that the expression of the constraint condition of the maximum number of allowable ticket replenishment of the n-j station forms an integral model and must be satisfied at the same time, and on the other hand, the accumulated number and classification of the specific passengers of each station are dynamically updated, the number and classification of the specific passengers of each station are reflected in real time, and the expression model reflecting the constraint condition of the maximum number of allowable ticket replenishment of the n-j station belongs to a dynamic model;
step 5, scheduling termination condition judgment: the current station is a terminal station of the train; if the matching j of the jth station of the current station is not more than n-1 and does not meet the specified scheduling termination condition of the whole real-time scheduling task, skipping to the step 1 according to dynamic reverse calculation; and if not, the scheduling termination condition of the whole real-time scheduling task is met when the current station is in the jth station, and the train passenger ticket supplementing scheduling method based on the overload limit calculated in the dynamic reverse direction is terminated.
The train passenger ticket supplementing scheduling method based on the overload limit of the dynamic reverse calculation has the advantages that the problem that the current train passenger ticket supplementing scheduling method with the overload limit cannot meet the requirement that people with train tickets (or high-speed railway tickets) which are preset in advance board a corresponding train in a shift due to the overload of the train (or the high-speed railway) is solved by adopting the train passenger ticket supplementing scheduling method based on the overload limit of the dynamic reverse calculation and calculating the number of passengers in the dynamic reverse calculation, and only full or compensatory refunds can be adopted and regressed; and the authority of the train ticket (or the high-speed rail ticket) is influenced. The train passenger ticket supplementing scheduling method is simple in concept, convenient to implement and high in robustness, and meets the practical requirements of effectively supplementing tickets and scheduling train passengers in the rush hour of the train (or high-speed rail) passengers.
Drawings
Fig. 1 is a flow chart of a train passenger ticket replenishment scheduling method based on overload limitation of dynamic reverse calculation.
Detailed Description
The invention is further described with reference to the following figures and examples:
the invention provides a train passenger ticket supplementing scheduling method based on overload limitation of dynamic reverse calculation, which comprises the steps of accumulating the specific number and classification of passengers at each station in real time, extracting and accumulating the number of tickets sold in advance at each station, calculating the constraint condition of the maximum number of tickets to be supplemented at the last station allowed by the current station in real time, calculating the constraint condition of the maximum number of tickets to be supplemented at the next station allowed by the current station in real time, dynamically calculating the reverse direction, judging the scheduling termination condition, judging the total number of stations stopped along the way of a train and the maximum carrying capacity of passengers of the train. Wherein six dots "… …" in the drawing indicate the maximum number of permissible restocking constraints for all stations not listed between the last station of the current station and the next station after the current station; the dynamic reverse calculation overall requirement is that the number of the pre-sold tickets of each station is extracted and accumulated according to the real-time accumulation of the number and classification of specific passengers of each station, and the maximum number of the allowed tickets for the last station at the current station is calculated from the real-time calculation of the maximum number of the allowed tickets for the last station at the current station to the real-time calculation of the maximum number of the allowed tickets for the next station at the current station, and the maximum number of the allowed tickets for all stations between the next station behind the current station and the last station is dynamically calculated in turn. The specific scheduling steps are as follows:
step 1, accumulating the number and classification of specific passengers at each station in real time: calculate Bi,j,Bi,jRepresenting the real-time specific passenger result when the j station gets off the train to the i station, and n represents the total number of the stop stations along the way of the train, wherein j is more than or equal to 1 and less than or equal to j<i is less than or equal to n, and i, j and n all belong to natural numbers;
step 2, extracting and accumulating the number of tickets sold in advance at each station: calculate Ci,j,Ci,jRepresenting the result of pre-selling the real-time specific passengers getting off from the ith station at the jth station, and n represents the total number of the stations along the way of the train, wherein j is more than or equal to 1 and less than or equal to j<i is less than or equal to n, and i, j and n all belong to natural numbers;
step 3, calculating the constraint condition of the maximum number of the ticket compensation allowed by each station after the current station in real time: the calculation model is as follows
Figure GDA0003537726560000041
Here, the current station is denoted as the jth station; t represents the maximum load capacity of train passengers, is the number of overload limits of the train, and belongs to a natural number; qn,jA constraint condition representing the maximum number of n supplementary tickets of the last station allowed by the jth station of the current station; qn-1,jA constraint condition of maximum number of supplementary tickets of a previous station for allowing a last station n at the jth station of the current station; qn-2,jRepresenting the constraint condition of the maximum number of the supplementary tickets of the first two stations of the jth station of the current station for allowing the last station n; qj+1,jA constraint condition representing the maximum allowable number of ticket compensation of a j +1 th station of a station next to the j th station of the current station; three solid dots "…" represent a computational expression with the constraint of omitting the maximum number of allowable supplementary tickets at the stations from the (n-3) th station to the (j + 2) th station in the middle; a and b represent the a-th station and the b-th station, respectively, and a and b belong to natural numbers;
and 4, dynamic reverse calculation: the constraint condition of the maximum number of the ticket compensation of each station in the step 3 is an expression of the constraint condition of the maximum number of the allowable ticket compensation of the j +1 th station which is sequentially and reversely calculated from the last station to the next station of the j th station of the current station, and the maximum number of the allowable ticket compensation of the n-j stations; the expression of the constraint condition of the maximum number of allowable ticket replenishment of the n-j stations requires that the expression of the constraint condition of the maximum number of allowable ticket replenishment of the n-j stations forms an integral model and must be met simultaneously, on the other hand, the accumulated number and classification of specific passengers of each station are dynamically updated to reflect the number and classification of the specific passengers of each station in real time, and the expression model of the constraint condition of the maximum number of allowable ticket replenishment of the n-j stations belongs to a dynamic model;
step 5, scheduling termination condition judgment: the current station is a terminal station of the train; if the matching j of the jth station of the current station is not more than n-1 and does not meet the specified scheduling termination condition of the whole real-time scheduling task, skipping to the step 1 according to dynamic reverse calculation; and if not, the scheduling termination condition of the whole real-time scheduling task is met when the current station is in the jth station, and the train passenger ticket supplementing scheduling method based on the overload limit calculated in the dynamic reverse direction is terminated.

Claims (2)

1. The train passenger ticket supplementing dispatching method based on overload limitation of dynamic reverse calculation comprises the steps of accumulating the number and classification of specific passengers at each station in real time, extracting and accumulating the number of tickets which are sold in advance at each station, calculating the constraint condition of the maximum number of tickets which are allowed to be supplemented at the last station at the current station in real time, calculating the constraint condition of the maximum number of tickets which are allowed to be supplemented at the next station at the current station in real time, dynamically reverse calculating, judging the dispatching termination condition, the total number of stations which stop along the way of the train and the maximum load of the passengers of the train, and is characterized in that the total requirement of the dynamic reverse calculation is that the number of the tickets which are sold in advance at each station is extracted and accumulated according to the number and classification of the specific passengers which are accumulated at each station in real time, starting from the calculation of the maximum number of the tickets which are allowed to be supplemented at the last station at the current station in real time, and finally calculating the maximum number of the tickets which are allowed to be supplemented at the next station behind the current station and the last station in turn dynamically, the specific scheduling steps are as follows:
step 1, accumulating the number and classification of specific passengers at each station in real time: calculate Bi,j,Bi,jRepresenting the real-time specific passenger result when the j station gets off the train to the i station, wherein n represents the total number of the stop stations along the way of the train, and j is more than or equal to 1<i is less than or equal to n, and i, j and n all belong to natural numbers;
step 2, extracting and accumulating the number of tickets sold in advance at each station: calculate Ci,j,Ci,jRepresenting the result of pre-selling the real-time specific passengers getting off from the ith station at the jth station, wherein n represents the total number of the stop stations along the way of the train, and j is more than or equal to 1 and less than or equal to j<i is less than or equal to n, and i, j and n all belong to natural numbers;
step 3, calculating the constraint condition of the maximum number of the ticket compensation allowed by each station after the current station in real time: the calculation model is as follows
Figure FDA0003537726550000011
Marking the current station as the jth station; t represents the maximum load capacity of train passengers, is the number of overload limits of the train, and belongs to a natural number; qn,jA constraint condition representing the maximum number of n supplementary tickets of the last station allowed by the jth station of the current station; qn-1,jA constraint condition of maximum number of supplementary tickets of a previous station for allowing a last station n at the jth station of the current station; qn-2,jRepresenting the constraint condition of the maximum number of the supplementary tickets of the first two stations of the jth station of the current station for allowing the last station n; qj+1,jA constraint condition representing the maximum allowable number of ticket compensation of a j +1 th station of a station next to the j th station of the current station; three solid dots "…" represent a computational expression with the constraint of omitting the maximum number of allowable supplementary tickets at the stations from the (n-3) th station to the (j + 2) th station in the middle; a and b represent the a-th station and the b-th station, respectively, and a and b belong to natural numbers;
and 4, dynamic reverse calculation: the constraint condition of the maximum number of the ticket compensation of each station in the step 3 is an expression of the constraint condition of the maximum number of the allowable ticket compensation of the j +1 th station which is sequentially and reversely calculated from the last station to the next station of the j th station of the current station, and the maximum number of the allowable ticket compensation of the n-j stations;
step 5, scheduling termination condition judgment: the current station is a terminal station of the train; if the matching j of the jth station of the current station is not more than n-1 and does not meet the specified scheduling termination condition of the whole real-time scheduling task, skipping to the step 1 according to dynamic reverse calculation; and if not, the scheduling termination condition of the whole real-time scheduling task is met when the current station is in the jth station, and the train passenger ticket supplementing scheduling method based on the overload limit calculated in the dynamic reverse direction is terminated.
2. The train passenger ticket replenishment scheduling method based on the overload limitation of the dynamic reverse calculation as recited in claim 1, wherein the expression of the constraint condition of the maximum number of allowable ticket replenishment at the n-j stations requires that the expression of the constraint condition of the maximum number of allowable ticket replenishment at the n-j stations form an integral model and must be satisfied simultaneously, and on the other hand, the accumulated specific passenger number and classification at each station are dynamically updated to reflect the specific passenger number and classification at each station in real time, and the expression model of the constraint condition of the maximum number of allowable ticket replenishment at the n-j stations belongs to the dynamic model.
CN201910384012.1A 2019-05-09 2019-05-09 Train passenger ticket supplementing scheduling method based on overload limitation of dynamic reverse calculation Active CN110135721B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910384012.1A CN110135721B (en) 2019-05-09 2019-05-09 Train passenger ticket supplementing scheduling method based on overload limitation of dynamic reverse calculation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910384012.1A CN110135721B (en) 2019-05-09 2019-05-09 Train passenger ticket supplementing scheduling method based on overload limitation of dynamic reverse calculation

Publications (2)

Publication Number Publication Date
CN110135721A CN110135721A (en) 2019-08-16
CN110135721B true CN110135721B (en) 2022-04-26

Family

ID=67576970

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910384012.1A Active CN110135721B (en) 2019-05-09 2019-05-09 Train passenger ticket supplementing scheduling method based on overload limitation of dynamic reverse calculation

Country Status (1)

Country Link
CN (1) CN110135721B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114282740B (en) * 2021-09-07 2022-09-23 内蒙古大学 High-speed rail ticket amount distribution optimization method considering flexible tickets

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101635045A (en) * 2009-08-05 2010-01-27 郝晓谷 Railway ticket system and work method thereof
EP2835767A1 (en) * 2013-08-06 2015-02-11 Skidata Ag Customer medium for detecting the use of services
CN104463656A (en) * 2014-12-09 2015-03-25 北海和思科技有限公司 Timely information updating method for railway station ticketing system
CN104765799A (en) * 2015-03-27 2015-07-08 王鸿宾 Intelligent quick self-service ticket-supplementing querying system
WO2016015454A1 (en) * 2014-07-29 2016-02-04 刘健 Automatic ticket selling and checking system for railway train
CN105321211A (en) * 2014-07-16 2016-02-10 夏小叶 Real-time train capacity query method and system
WO2017006006A1 (en) * 2015-07-03 2017-01-12 Metrolab Method and system for managing the traffic of a line of vehicles travelling between several station stops

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101635045A (en) * 2009-08-05 2010-01-27 郝晓谷 Railway ticket system and work method thereof
EP2835767A1 (en) * 2013-08-06 2015-02-11 Skidata Ag Customer medium for detecting the use of services
CN105321211A (en) * 2014-07-16 2016-02-10 夏小叶 Real-time train capacity query method and system
WO2016015454A1 (en) * 2014-07-29 2016-02-04 刘健 Automatic ticket selling and checking system for railway train
CN104463656A (en) * 2014-12-09 2015-03-25 北海和思科技有限公司 Timely information updating method for railway station ticketing system
CN104765799A (en) * 2015-03-27 2015-07-08 王鸿宾 Intelligent quick self-service ticket-supplementing querying system
WO2017006006A1 (en) * 2015-07-03 2017-01-12 Metrolab Method and system for managing the traffic of a line of vehicles travelling between several station stops

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Microscopic simulation on ticket office of large scale railway passenger station;Jitao Li;《7th Advanced Forum on Transportation of China (AFTC 2011)》;20120705;参见第41-47页 *
航空客运舱位控制和超售综合动态建模研究;朱金福 等;《系统工程学报》;20071031;第22卷(第5期);参见第525-530页 *

Also Published As

Publication number Publication date
CN110135721A (en) 2019-08-16

Similar Documents

Publication Publication Date Title
CN112319557B (en) Operation adjusting method and system for subway train under late condition
CN112793631B (en) Subway running adjusting method and system under condition that train exits main line operation
CN107704950A (en) A kind of city rail train figure optimization method based on trip requirements and energy saving of system
CN113306605B (en) Dynamic operation diagram adjusting method and system
CN112214873B (en) Passenger flow distribution simulation evaluation method and system under rail transit fault
CN112819316B (en) Hub transportation energy identification method of comprehensive passenger transport hub rail transit system
WO2019148764A1 (en) Dynamic bus scheduling method, storage medium, and apparatus
CN103793760A (en) Multi-mode optimization method for comprehensive transportation junction interior passenger flow transfer distribution ratio
CN111178697B (en) Method and system for calculating passing capacity of high-speed railway
Jiang et al. A simulation model for estimating train and passenger delays in large-scale rail transit networks
Wang et al. Real-time scheduling for single lines in urban rail transit systems
CN110135721B (en) Train passenger ticket supplementing scheduling method based on overload limitation of dynamic reverse calculation
CN111047138A (en) Taxi waiting aid decision-making method and system based on passenger carrying benefit analysis
Yang et al. Multi-mode public transit OD prediction and scheduling model
CN105679076A (en) City bus transfer coordination scheduling method
Muller et al. Transfer scheduling and control to reduce passenger waiting time
CN111079986B (en) Matching method and system for transport capacity of transfer station
CN105128893B (en) The generation method and system of a kind of whole time of running information of train
CN110930079A (en) High-speed railway train running diagram comprehensive evaluation method based on actual performance diagram
van Oort et al. Impact of rail terminal design on transit service reliability
Tundulyasaree et al. Improving service quality by integrating passenger and freight train transportation
Alwadood et al. Rail passenger service delays: An overview
Zheng et al. Flex-route transit service with different degree of dynamism
RU2511742C1 (en) Dispatch control over train motion at its approach to occupied track section and system to this end
CN116674613B (en) Locomotive turnover control method, device, equipment and medium for railway small-running locomotive

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant