Intelligent rail and bus transfer optimization-oriented timetable collaborative compilation method

Through the coordinated compilation method of timetables for intelligent rail and bus, the timetables for intelligent rail and bus are optimized, and the poor transfer experience and waste of resources caused by single-line operation of intelligent rail are solved, thus improving operational efficiency and convenient passenger travel sex.

CN119067374AActive Publication Date: 2024-12-03YIBIN SOUTHWEST JIAOTONG UNIV RES INST +1
View PDF 6 Cites 0 Cited by

Patent Information

Application Number
CN202411109601.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-13
Publication Date
2024-12-03
Estimated Expiration
2044-08-13

AI Technical Summary

Technical Problem

The existing smart rail route adopts a single-line independent operation model, resulting in poor passenger transfer experience and inability to fully share capacity resources, resulting in increased operating costs and reduced efficiency, and competition and inconsistency with bus routes, wasted resources and inconvenience to passengers.

Method used

Adopt the timetable collaborative compilation method for intelligent rail and buses, and build a dual-mode public transportation network, determine the transfer station, establish an integer planning model to maximize the number of successful transfer passengers and minimize the total transfer waiting time, and optimize the timetable , calculate the optimal first bus departure time and departure time window of each route, and realize the coordinated compilation of timetables.

Benefits of technology

It improves the success rate of passenger transfer and travel convenience, reduces operating costs, optimizes the coordinated operation of smart rails and buses, reduces resource waste, and improves transportation efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119067374A_ABST
    Figure CN119067374A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of intelligent rail traffic, and discloses an intelligent rail and bus transfer optimization-oriented timetable collaborative compilation method. The method comprises the following steps: constructing a dual-mode public transport network, and determining all transfer stations for transfer between intelligent rails and buses; calculating the departure number of each route in the planning time; estimating the transfer passenger flow volume between the shifts of each line in the planning time range; respectively constructing two single-target integer programming models; calculating a departure time window of each regular bus of each line at the transfer station, and performing optimization solution on the first single-target integer programming model and the second single-target integer programming model to obtain the optimal departure time of the first regular bus of each line; and calculating the optimal departure time of each regular bus of each line to obtain a timetable of each line of the dual-mode public transport network. According to the method, the two single-target integer programming models are constructed, so that dual optimization of the timetable on the passenger transfer success number and the total transfer waiting time is realized.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of smart rail transportation technology, and in particular to a method for collaboratively compiling a timetable for optimizing transfers between smart rail and buses. Background Art

[0002] With the rapid growth of urban population and the number of private cars, many large cities are facing serious traffic congestion, traffic accidents and traffic exhaust emissions. The sustainable development of urban transportation systems faces severe challenges. Especially during the morning and evening rush hours on weekdays, roads are seriously congested, resulting in longer commuting time and reduced travel efficiency. At the same time, environmental problems such as vehicle exhaust emissions and air pollution are becoming increasingly serious, threatening the health of urban residents and environmental quality.

[0003] As a low-cost and high-efficiency mode of transportation, public transportation has become the key to solving these problems. Compared with private cars, public transportation has a greater transportation capacity, can effectively alleviate urban traffic pressure, improve environmental quality, and promote the sustainable development of urban transportation systems.

[0004] The intelligent rail rapid transit system, also known as Autonomous Rail Rapid Transit (ART), is an emerging medium- and low-capacity rail transit system with unique advantages. Compared with traditional rail transit systems, ART has the characteristics of low investment cost, short construction period, and flexible operation. It is a powerful supplement to urban public transportation. The rapid development and popularization of ART has achieved certain achievements at home and abroad, and more and more cities have begun to introduce and operate ART lines.

[0005] However, at present, the vast majority of smart rail lines still adopt a single-line independent operation mode, which leads to a series of problems. First, passengers have a poor transfer experience because they usually need to use the "exit first, then enter" method to achieve transfers, which increases the pressure on transfer stations and reduces the convenience of travel. Secondly, the capacity resources of the smart rail cannot be fully shared, and the equipment utilization rate is not high, which leads to increased operating costs and reduced efficiency. In addition, there is competition and incoordination between the smart rail lines and conventional bus lines, resulting in waste of resources and inconvenience for passengers. Summary of the invention

[0006] In view of the above-mentioned deficiencies in the prior art, the present invention provides a method for collaboratively compiling a timetable for optimizing transfers between smart rail and buses.

[0007] In order to achieve the above-mentioned object of the invention, the technical solution adopted by the present invention is:

[0008] A method for collaboratively compiling a timetable for optimizing transfer between smart rail and bus, comprising the following steps:

[0009] Construct a dual-mode public transportation network based on smart rail lines and bus lines, and identify all transfer stations where smart rail and bus lines interchange;

[0010] According to the planning time and the operation time of the smart rail and bus, determine the departure intervals of each smart rail and bus line within the planning time, and calculate the number of departures of each line within the planning time;

[0011] Based on the historical passenger flow data of transfers between lines, estimate the transfer passenger flow between each line and each service within the planning time range;

[0012] A first single-objective integer programming model is constructed with the departure time of the first bus of each line as the decision variable and maximizing the number of passengers who successfully transfer as the optimization goal. Based on the optimization results of the first single-objective integer programming model, a parameter is introduced to characterize the transfer waiting time, and a second single-objective integer programming model is constructed with minimizing the total transfer waiting time as the optimization goal.

[0013] According to the departure intervals, departure frequencies and travel time to each transfer station of each line, the departure time window of each bus on each line at the transfer station is calculated, and the first single-objective integer programming model and the second single-objective integer programming model are optimized and solved respectively to obtain the optimal departure time of the first bus on each line;

[0014] The optimal departure time of each bus on each line is calculated according to the optimal first bus departure time of each line, the departure interval and the number of buses on each line, and the timetable of each line in the dual-mode public transportation network is obtained.

[0015] As a preferred method, the number of departures of each line within the planned time is calculated as follows:

[0016]

[0017] Among them, n l is the number of departures of line l within the planned time T, h l is the departure interval of line l, is the rounding up function.

[0018] As a preferred method, the transfer passenger flow between each line and each service within the planning time range is estimated, specifically:

[0019]

[0020] Among them, u piqjs is the number of passengers who transfer from the i-th bus of line p to the j-th bus of line q at the transfer station s; pqs is the total number of passengers transferring from line p to line q at transfer station s within the planning time T; n pis the number of departures of route p within the planned time T.

[0021] As a preferred embodiment, a first single-objective integer programming model is constructed with the departure time of the first bus of each line as the decision variable and maximizing the number of successfully transferred passengers as the optimization goal, specifically:

[0022]

[0023]

[0024] c piqjs ∈{0,1}

[0025] Among them, max is the maximum value function; F1 is the first objective function; c piqjs u is a 0-1 variable indicating whether the difference between the departure time of the j-th bus of the transferred line q at the transfer station s minus the arrival time of the i-th bus of the line p from which the transfer passenger comes is within the time window; piqjs is the number of passengers who transfer from the i-th bus of line p to the j-th bus of line q at the transfer station s; L is the set of lines in the bimodal public transportation network; I p is the departure schedule of route p; J q is the departure schedule of route q; S t A collection of transfer stations for the smart rail and bus; pi is the departure time of the ith bus on route p; qj is the departure time of the jth bus on route q; t ps is the travel time of route p from the starting point to the transfer station s; t qs is the travel time of route q from the starting point to the transfer station s; M is a set positive integer; W is the upper limit of the transfer waiting time; h p is the departure interval of line p; h q is the departure interval of line q; For line p n p The departure time of the shuttle bus; For line q n q The departure time of the shuttle bus; T is the planned time; x p1 is the departure time of the first bus on route p; q1 The departure time of the first bus on route q.

[0026] Preferably, based on the optimization result of the first single-objective integer programming model, a parameter is introduced to characterize the transfer waiting time, and a second single-objective integer programming model with minimizing the total transfer waiting time as the optimization goal is constructed, specifically:

[0027]

[0028]

[0029] c piqjs ∈{0,1}

[0030] Among them, min is the minimum function; F2 is the second objective function; c piqjs u is a 0-1 variable indicating whether the difference between the departure time of the j-th bus of the transferred line q at the transfer station s minus the arrival time of the i-th bus of the line p from which the transfer passenger comes is within the time window; piqjs is the number of passengers who transfer from the i-th bus of line p to the j-th bus of line q at the transfer station s; r piqjs is the waiting time for passengers on the i-th bus of line p to transfer to the j-th bus of line q at the transfer station; L is the set of lines in the dual-mode public transportation network; I p is the departure schedule of route p; J q is the departure schedule of route q; S t is the set of transfer stations for smart rail and bus transfers; B is the maximum number of passengers who successfully transfer; x pi is the departure time of the ith bus on route p; qj is the departure time of the jth bus on route q; t ps is the travel time of route p from the starting point to the transfer station s; t qs is the travel time of route q from the starting point to the transfer station s; M is a set positive integer; W is the upper limit of the transfer waiting time; h p is the departure interval of line p; h q is the departure interval of line q; For line p n p The departure time of the shuttle bus; For line q n q The departure time of the shuttle bus; T is the planned time; x p1 is the departure time of the first bus on route p; q1 The departure time of the first bus on route q.

[0031] Preferably, according to the departure intervals, departure frequencies and travel time to each transfer station of each line, the departure time window of each bus of each line at the transfer station is calculated, including the following steps:

[0032] Select any transfer station s and routes p and q that have transfers at the transfer station;

[0033] According to the departure interval h of line p p and the travel time t from line p to transfer station s ps , determine the time window consisting of the earliest arrival time and the latest departure time of each bus on route p to the transfer station s {[tps ,t ps +h p ],[t ps +h p ,t ps +2h p ],…,[t ps +(i-1)h p ,t ps +ih p ],…,[t ps +(n p -1)h p ,t ps +n p h p ]}, i is the bus number;

[0034] According to the departure interval h of line q q and the travel time t from line q to transfer station s qs , determine the time window consisting of the earliest arrival time and the latest departure time of each bus on route p to the transfer station s {[t qs ,t qs +h q ],[t qs +h q ,t qs +2h q ],…,[t qs +(j-1)h q ,t qs +jh q ],…,[t qs +(n q -1)h q ,t qs +n q h q ]}, j is the bus number.

[0035] Preferably, optimizing and solving the first single-objective integer programming model and the second single-objective integer programming model to obtain the optimal first bus departure time of each line includes the following steps:

[0036] For passengers transferring from route p to route q, determine whether t ps +(i-1)h p >t qs +jh q , i, j are the bus numbers; if yes, then delete the auxiliary variables representing the feasible transfer and the parameters of the transfer waiting time and related constraints; otherwise, no processing is done;

[0037] For passengers transferring from route q to route p, determine whether t qs +(j-1)hq >t ps +ih p ; If yes, delete the auxiliary variables representing the feasible transfers and the parameters of the transfer waiting time and related constraints; otherwise, no processing is done;

[0038] The optimized first single-objective integer programming model and the second single-objective integer programming model are solved respectively to obtain the optimal first bus departure time of each line.

[0039] As a preferred embodiment, the optimal departure time of each bus on each line is calculated according to the optimal departure time of the first bus on each line and the departure interval and number of buses on each line, specifically:

[0040] x pi =x p1 +(i-1)h p ,i≥2

[0041] x qj =x q1 +(j-1)h q ,j≥2

[0042] Among them, x pi is the optimal departure time of the i-th bus on route p; x qj is the optimal departure time of the jth bus on route q; p1 is the optimal first bus departure time of route p; x q1 is the optimal first bus departure time of route q; h p is the departure interval of line p; h q is the departure interval of line q.

[0043] The present invention has the following beneficial effects:

[0044] 1. This invention proposes a new method for coordinating timetables for optimizing the transfer between smart rail and buses, which comprehensively considers the optimization model of the number of successful transfers and the waiting time for transfers. Through computer optimization software, the timetable is optimized and a timetable for coordinated transfer between smart rail and buses is provided for operation dispatchers.

[0045] 2. The present invention proposes two single-objective optimization models based on maximizing the number of passengers who successfully transfer and minimizing the total transfer waiting time based on maximizing the number of passengers who successfully transfer. By introducing the constraints of feasible transfers and auxiliary variables, two single-objective integer programming models are established to achieve dual optimization of the timetable in terms of the number of passengers who successfully transfer and the total transfer waiting time.

[0046] 3. The present invention effectively solves the problem of optimizing the transfer schedule for large-scale intelligent rail and bus collaborative networks by reducing the number of constraints. By analyzing the departure intervals, departure frequencies, and transfer conditions at transfer stations, redundant constraints are eliminated, and detailed scheduling of the schedule is achieved, ensuring smooth transfers and convenience of travel. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] Figure 1 The figure is a flowchart of a method for collaboratively compiling timetables for optimizing transfers between smart rail and buses. DETAILED DESCRIPTION

[0048] The specific implementation modes of the present invention are described below so that those skilled in the art can understand the present invention. However, it should be clear that the present invention is not limited to the scope of the specific implementation modes. For those of ordinary skill in the art, as long as various changes are within the spirit and scope of the present invention as defined and determined by the attached claims, these changes are obvious, and all inventions and creations utilizing the concept of the present invention are protected.

[0049] like Figure 1 As shown, an embodiment of the present invention provides a method for collaboratively compiling a timetable for optimizing transfer between smart rail and bus, comprising the following steps S1 to S6:

[0050] S1. Construct a dual-mode public transportation network based on the smart rail lines and bus lines, and determine all the transfer stations where the smart rail and bus lines transfer;

[0051] In an optional embodiment of the present invention, the embodiment determines the optimized route through step S1. A dual-mode public transportation network consisting of smart rail and bus routes to be optimized is selected, and all stations involving transfers between smart rail and bus are determined. The obtained dual-mode public transportation network is represented as G = {L, S t}, where L is the set of bus routes included in the network (including buses and smart rail), S t It is a collection of stations where there are transfers between the smart rail and the bus.

[0052] S2. According to the planning time and the operation time of the smart rail and bus, determine the departure intervals of each smart rail and bus line within the planning time, and calculate the number of departures of each line within the planning time;

[0053] In an optional embodiment of the present invention, the present embodiment determines the planning time in step S2, that is, the time period for which the timetable needs to be optimized. According to the operation information of the smart rail and the bus, the departure interval of each smart rail and bus line within the planning time is determined, so as to further calculate the number of departures of each line within the planning time.

[0054]

[0055] Among them, n l is the number of departures of line l within the planned time T, h l is the departure interval of line l, is the rounding up function.

[0056] S3. Estimate the transfer passenger flow between each route and each service within the planning time range based on the historical passenger flow data between each route;

[0057] In an optional embodiment of the present invention, this embodiment determines the specific transfer passenger flow through step S3, specifically, firstly estimates the total transfer passenger flow between each line within the planned time range based on the historical passenger flow data of transfers between each line; then, based on the number of departures of each line within the planned time calculated in step S2, the detailed transfer passenger flow between each line and each shift can be calculated, and this passenger flow is considered to be evenly distributed.

[0058] In this embodiment, it is assumed that at the transfer station s, the number of passengers transferring from line p to line q is evenly distributed with the number of departures of line p, that is, the number of transfers of each bus of the same transfer action is the same, and the transfer passenger flow between each bus of each line within the planning time range is estimated, specifically:

[0059]

[0060] Among them, u piqjs is the number of passengers who transfer from the i-th bus of line p to the j-th bus of line q at the transfer station s; where line p and line q belong to different modes of transportation, i.e., one is from the smart rail and the other is from regular bus, I p ={1,2,…,n p}, J q ={1,2,…,n q}, represents the set of departure times of each line. Here, the value of j cannot be directly determined, that is, it is impossible to determine which specific bus the i-th bus of line p transfers to on line q. The result can only be obtained after model optimization; v pqs is the total number of passengers transferring from line p to line q at transfer station s within the planning time T; n p is the number of departures of route p within the planned time T.

[0061] S4, constructing a first single-objective integer programming model with the departure time of the first bus of each line as the decision variable and maximizing the number of passengers who successfully transfer as the optimization goal, and introducing parameters to characterize the transfer waiting time based on the optimization result of the first single-objective integer programming model, and constructing a second single-objective integer programming model with minimizing the total transfer waiting time as the optimization goal;

[0062] In an optional embodiment of the present invention, this embodiment establishes two integer programming models for schedule optimization through step S4, and the established models are as follows:

[0063] The first model introduces the departure time of the first bus on each line as a decision variable and whether it is a feasible transfer as a 0-1 auxiliary variable. The objective function is to maximize the number of passengers who successfully transfer. The objective function and constraints included in the first model are as follows:

[0064]

[0065] The constraints are as follows:

[0066]

[0067] These two constraints mean that a transfer is considered feasible when the difference between the departure time of the jth bus of the line q being transferred at the transfer station s and the departure time of the ith bus of the line p from which the transfer passenger comes is within the time window [0,W].

[0068]

[0069] This constraint states that passengers on each bus will only transfer to one bus on another line.

[0070]

[0071] These two constraints mean that the departure intervals of each line are uniform.

[0072]

[0073] These two constraints are the departure time constraints of the last bus.

[0074]

[0075] These two constraints represent the value range of the decision variables.

[0076] c piqjs ∈{0,1}

[0077] This constraint indicates the range of values ​​of the auxiliary variable.

[0078] Among them, max is the maximum value function; F1 is the first objective function; c piqjs u is a 0-1 variable indicating whether the difference between the departure time of the j-th bus of the transferred line q at the transfer station s minus the arrival time of the i-th bus of the line p from which the transfer passenger comes is within the time window [0, W]. If so, it is considered a feasible transfer and the value is 1. Otherwise, the value is 0.piqjs is the number of passengers who transfer from the i-th bus of line p to the j-th bus of line q at the transfer station s; L is the set of lines in the bimodal public transportation network; I p is the departure schedule of route p; J q is the departure schedule of route q; S t A collection of transfer stations for the smart rail and bus; pi is the departure time of the ith bus on route p; qj is the departure time of the jth bus on route q; t ps is the travel time of route p from the starting point to the transfer station s; t qs is the travel time of route q from the starting point to the transfer station s; M is a set positive integer; W is the upper limit of the transfer waiting time, which depends on whether the transferred vehicle is the first bus of the corresponding route. If it is the first bus, the value is t qs , otherwise the value is h q -1;h p is the departure interval of line p; h q is the departure interval of line q; For line p n p The departure time of the shuttle bus; For line q n q The departure time of the shuttle bus; T is the planned time; x p1 is the departure time of the first bus on route p; q1 The departure time of the first bus on route q.

[0079] The second model is based on the maximum number of successfully transferred passengers obtained by the first model, and introduces the transfer waiting time parameter on the basis of the first model. The objective function is to minimize the total transfer waiting time. The objective function and constraints included in the second model are as follows:

[0080]

[0081] The constraints are as follows:

[0082]

[0083] This constraint means that the model is constrained by the optimization result of the first model (maximizing the number of passengers who successfully transfer).

[0084]

[0085] This constraint indicates how the transfer waiting time is calculated. The corresponding transfer waiting time will only be calculated when the transfer is feasible.

[0086] In addition, the second model includes all the constraints of the first model as follows:

[0087]

[0088]

[0089] c piqjs ∈{0,1}

[0090] Among them, min is the minimum function; F2 is the second objective function; c piqjs is a 0-1 variable indicating whether the difference between the departure time of the j-th bus of the transferred line q at the transfer station s minus the arrival time of the i-th bus of the line p from which the transfer passenger comes is within the time window [0,W]; u piqjs is the number of passengers who transfer from the i-th bus of line p to the j-th bus of line q at the transfer station s; r piqjs is the waiting time for passengers on the i-th bus of line p to transfer to the j-th bus of line q at the transfer station, only when the corresponding transfer is feasible, that is, c piqjs =1, the constraint condition for calculating the transfer waiting time will take effect, and the corresponding transfer waiting time will be calculated; L is the line set of the dual-mode public transportation network; I p is the departure schedule of route p; J q is the departure schedule of route q; S t is the set of transfer stations for the smart rail and bus; B is the maximum number of successful transfer passengers, and is the optimization result of the first single-objective integer programming model; x pi is the departure time of the ith bus on route p; qj is the departure time of the jth bus on route q; t ps is the travel time of route p from the starting point to the transfer station s; t qs is the travel time of route q from the starting point to the transfer station s; M is a set positive integer; W is the upper limit of the transfer waiting time; h p is the departure interval of line p; h q is the departure interval of line q; For line p n p The departure time of the shuttle bus; For line q n q The departure time of the shuttle bus; T is the planned time; x p1 is the departure time of the first bus on route p; q1 The departure time of the first bus on route q.

[0091] S5. According to the departure intervals, departure frequencies and travel time to each transfer station of each line, the departure time window of each bus of each line at the transfer station is calculated, and the first single-objective integer programming model and the second single-objective integer programming model are optimized and solved respectively to obtain the optimal departure time of the first bus of each line;

[0092] In an optional embodiment of the present invention, this embodiment determines the situation where transfer is impossible through step S5, that is, removes redundant constraints, so that the model is applicable to large-scale timetable optimization problems. Specifically, it includes: first, according to the departure intervals and departure schedules of each line and the transfer situation of each transfer station, the departure time window of each bus of each line at the transfer station is derived (the earliest arrival time and the latest departure time, since it is assumed that the vehicle dwell time is 0, the departure time and the arrival time are consistent), thereby determining the detailed situation where transfer is impossible, and further eliminating the corresponding related constraints, so that the number of constraints in the model can be greatly reduced, and large-scale problems can be efficiently solved through optimization software.

[0093] This embodiment calculates the departure time window of each bus of each line at the transfer station according to the departure interval, departure frequency and travel time to each transfer station of each line, including the following steps:

[0094] Select any transfer station s and the routes p and q that can be transferred to at the transfer station;

[0095] According to the departure interval h of line p p and the travel time t from line p to transfer station s ps , determine the time window consisting of the earliest arrival time and the latest departure time of each bus on route p to the transfer station s {[t ps ,t ps +h p ],[t ps +h p ,t ps +2h p ],…,[t ps +(i-1)h p ,t ps +ih p ],…,[t ps +(n p -1)h p ,t ps +n p h p ]}, that is, the first bus is: [t ps ,t ps +h p ], the second bus is: [t ps +h p ,t ps+2h p ], ... the i-th bus is: [t ps +(i-1)h p ,t ps +ih p ], ... the last bus is [t ps +(n p -1)h p ,t ps +n p h p ];

[0096] According to the departure interval h of line q q and the travel time t from line q to transfer station s qs , determine the time window consisting of the earliest arrival time and the latest departure time of each bus on route p to the transfer station s {[t qs ,t qs +h q ],[t qs +h q ,t qs +2h q ],…,[t qs +(j-1)h q ,t qs +jh q ],…,[t qs +(n q -1)h q ,t qs +n q h q ]}, that is, the first bus is: [t qs ,t qs +h q ], the second bus is: [t qs +h q ,t qs +2h q ], …the jth bus is: [t qs +(j-1)h q ,t qs +jh q ], ... the last bus is [t qs +(n q -1)h q ,t qs +n q h q ].

[0097] This embodiment optimizes and solves the first single-objective integer programming model and the second single-objective integer programming model respectively to obtain the departure time of the first bus of each line, including the following steps:

[0098] For passengers transferring from route p to route q, determine whether t ps +(i-1)h p >t qs +jh q , i, j are bus numbers; if so, delete the corresponding variables and constraints, that is, if the earliest arrival time of the i-th bus on route p is later than the latest departure time of the j-th bus on route q, then it is impossible for passengers to transfer from the i-th bus on route p to the j-th bus on route q, corresponding to the auxiliary variable c representing feasible transfers in the first integer programming model piqjs Delete, and delete the variable c piqjs The constraints related to whether the transfer is feasible are also deleted, corresponding to the auxiliary variable c representing the feasible transfer in the second integer programming model piqjs and the parameter r representing the transfer waiting time piqjs Delete, and delete the variable c piqjs Related constraints for determining whether a transfer is feasible and calculating the transfer waiting time r piqjs The constraint condition is deleted; otherwise, no processing is performed;

[0099] For passengers transferring from route q to route p, determine whether t qs +(j-1)h q >t ps +ih p ; If so, delete the corresponding variables and constraints, that is, the earliest arrival time of the j-th bus of route q is later than the latest departure time of the i-th bus of route p. Then it is impossible for passengers to transfer from the j-th bus of route q to the i-th bus of route p, corresponding to the auxiliary variable c representing feasible transfers in the first integer programming model qjpis Delete, and delete the variable c qjpis The constraints related to determining whether the transfer is feasible are also deleted, corresponding to the auxiliary variable c representing the feasible transfer in the second integer programming model qjpis and the parameter r representing the transfer waiting time qjpis Delete, and delete the variable c qjpis Related constraints for determining whether a transfer is feasible and calculating the transfer waiting time r qjpis The constraint condition is deleted; otherwise, no processing is performed;

[0100] The optimized first single-objective integer programming model and the second single-objective integer programming model are solved respectively to obtain the departure time of the first bus of each line; specifically, the first single-objective integer programming model and the second single-objective integer programming model are solved respectively after deleting the variables and constraints corresponding to the impossible transfer situations; firstly, the first single-objective integer programming model is calculated to obtain the maximized number of successful transfers and the corresponding departure time of the first bus; then, the maximized number of successful transfers is brought into the second single-objective integer programming model to obtain the minimized total transfer waiting time based on the maximized number of successful transfers and the corresponding departure time of the first bus.

[0101] This embodiment preprocesses the model to reduce the number of constraints, thereby accelerating the solution speed and achieving rapid solution of the two mathematical models.

[0102] In this embodiment, Excel pre-processing is used to reduce redundant constraints, find out situations where transfer is impossible, and the model of maximizing the number of successful transfers and minimizing the total transfer waiting time is efficiently solved using the commercial optimization solver Gurobi.

[0103] S6. Calculate the optimal departure time of each bus on each line according to the optimal first bus departure time of each line and the departure interval and number of buses on each line, and obtain the timetable of each line in the dual-mode public transportation network.

[0104] In an optional embodiment of the present invention, this embodiment calculates the optimal departure time of each bus of each line according to the optimization result through step S6, that is, the complete timetable of each line in the entire network. Specifically, it includes: firstly, the two pre-processed models are solved by the optimization software, and the optimal solution obtained is the optimal first bus departure time of each line; then, the complete timetable of each line in the network can be determined by the departure interval and the number of departures of each line.

[0105] This embodiment calculates the optimal departure time of each bus on each route based on the optimal first bus departure time of each route and the departure interval and number of buses on each route, specifically:

[0106] x pi =x p1 +(i-1)h p ,i≥2

[0107] x qj =x q1 +(j-1)h q ,j≥2

[0108] Among them, x pi is the optimal departure time of the i-th bus on route p; x qjis the optimal departure time of the jth bus on route q; p1 is the optimal first bus departure time of route p; x q1 is the optimal first bus departure time of route q; h p is the departure interval of line p; h q is the departure interval of line q.

[0109] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0110] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0111] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0112] The present invention uses specific embodiments to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea. At the same time, for those skilled in the art, according to the idea of ​​the present invention, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.

[0113] Those skilled in the art will appreciate that the embodiments described herein are intended to help readers understand the principles of the present invention, and should be understood that the protection scope of the present invention is not limited to such specific statements and embodiments. Those skilled in the art can make various other specific variations and combinations that do not deviate from the essence of the present invention based on the technical revelations disclosed by the present invention, and these variations and combinations are still within the protection scope of the present invention.

Claims

1. A method for collaboratively compiling a timetable for optimizing transfers between smart rail and buses, characterized in that: The following steps are involved: Construct a dual-mode public transportation network based on smart rail lines and bus lines, and identify all transfer stations where smart rail and bus lines interchange; According to the planning time and the operation time of the smart rail and bus, determine the departure intervals of each smart rail and bus line within the planning time, and calculate the number of departures of each line within the planning time; Based on the historical passenger flow data of transfers between lines, estimate the transfer passenger flow between each line and each service within the planning time range; A first single-objective integer programming model is constructed with the departure time of the first bus of each line as the decision variable and maximizing the number of passengers who successfully transfer as the optimization goal. Based on the optimization results of the first single-objective integer programming model, a parameter is introduced to characterize the transfer waiting time, and a second single-objective integer programming model is constructed with minimizing the total transfer waiting time as the optimization goal. According to the departure intervals, departure frequencies and travel time to each transfer station of each line, the departure time window of each bus on each line at the transfer station is calculated, and the first single-objective integer programming model and the second single-objective integer programming model are optimized and solved respectively to obtain the optimal departure time of the first bus on each line; The optimal departure time of each bus on each line is calculated according to the optimal first bus departure time of each line, the departure interval and the number of buses on each line, and the timetable of each line in the dual-mode public transportation network is obtained.

2. The method for collaboratively compiling a timetable for optimizing transfers between smart rail and buses according to claim 1, characterized in that: Calculate the number of departures for each line within the planned time, specifically: Among them, n l is the number of departures of line l within the planned time T, h l is the departure interval of line l, is the rounding up function.

3. The method for collaboratively compiling a timetable for optimizing transfers between smart rail and buses according to claim 1, characterized in that: Estimate the transfer passenger flow between each line and each service within the planning time range, specifically: Among them, u piqjs is the number of passengers who transfer from the i-th bus of line p to the j-th bus of line q at the transfer station s; pqs is the total number of passengers transferring from line p to line q at transfer station s within the planning time T; n p is the number of departures of route p within the planned time T.

4. The method for collaboratively compiling a timetable for optimizing transfers between smart rail and buses according to claim 1, characterized in that: The first single objective integer programming model is constructed with the departure time of the first bus of each line as the decision variable and maximizing the number of successful transfer passengers as the optimization goal. Specifically, it is as follows: Among them, max is the maximum value function; F1 is the first objective function; c piqjs u is a 0-1 variable indicating whether the difference between the departure time of the j-th bus of the transferred line q at the transfer station s minus the arrival time of the i-th bus of the line p from which the transfer passenger comes is within the time window; piqjs is the number of passengers who transfer from the i-th bus of line p to the j-th bus of line q at the transfer station s; L is the set of lines in the bimodal public transportation network; I p is the departure schedule of route p; J q is the departure schedule of route q; S t A collection of transfer stations for the smart rail and bus; pi is the departure time of the ith bus on route p; qj is the departure time of the jth bus on route q; t ps is the travel time of route p from the starting point to the transfer station s; t qs is the travel time of route q from the starting point to the transfer station s; M is a set positive integer; W is the upper limit of the transfer waiting time; h p is the departure interval of line p; h q is the departure interval of line q; For line p n p The departure time of the shuttle bus; For line q n q The departure time of the shuttle bus; T is the planned time; x p1 is the departure time of the first bus on route p; q1 The departure time of the first bus on route q.

5. The method for collaboratively compiling a timetable for optimizing transfers between smart rail and buses according to claim 1, characterized in that: Based on the optimization results of the first single-objective integer programming model, a parameter is introduced to characterize the transfer waiting time, and a second single-objective integer programming model is constructed with minimizing the total transfer waiting time as the optimization goal, specifically: Among them, min is the minimum function; F2 is the second objective function; c piqjs u is a 0-1 variable indicating whether the difference between the departure time of the j-th bus of the transferred line q at the transfer station s minus the arrival time of the i-th bus of the line p from which the transfer passenger comes is within the time window; piqjs is the number of passengers who transfer from the i-th bus of line p to the j-th bus of line q at the transfer station s; r piqjs is the waiting time for passengers on the i-th bus of line p to transfer to the j-th bus of line q at the transfer station; L is the set of lines in the dual-mode public transportation network; I p is the departure schedule of route p; J q is the departure schedule of route q; S t is the set of transfer stations for smart rail and bus transfers; B is the maximum number of passengers who successfully transfer; x pi is the departure time of the ith bus on route p; qj is the departure time of the jth bus on route q; t ps is the travel time of route p from the starting point to the transfer station s; t qs is the travel time of route q from the starting point to the transfer station s; M is a set positive integer; W is the upper limit of the transfer waiting time; h p is the departure interval of line p; h q is the departure interval of line q; For line p n p The departure time of the shuttle bus; For line q n q The departure time of the shuttle bus; T is the planned time; x p1 is the departure time of the first bus on route p; q1 The departure time of the first bus on route q.

6. The method for collaboratively compiling a timetable for optimizing transfers between smart rail and buses according to claim 1, characterized in that: According to the departure intervals, departure frequencies and travel time to each transfer station of each line, the departure time window of each bus of each line at the transfer station is calculated, including the following steps: Select any transfer station s and routes p and q that have transfers at the transfer station; According to the departure interval h of line p p and the travel time t from line p to transfer station s ps , determine the time window consisting of the earliest arrival time and the latest departure time of each bus on route p to the transfer station s {[t ps ,t ps +h p ],[t ps +h p ,t ps +2h p ],…,[t ps +(i-1)h p ,t ps +ih p ],…,[t ps +(n p -1)h p ,t ps +n p h p ]}, i is the bus number; According to the departure interval h of line q q and the travel time t from line q to transfer station s qs , determine the time window consisting of the earliest arrival time and the latest departure time of each bus on route p to the transfer station s {[t qs ,t qs +h q ],[t qs +h q ,t qs +2h q ],…,[t qs +(j-1)h q ,t qs +jh q ],…,[t qs +(n q -1)h q ,t qs +n q h q ]}, j is the bus number.

7. The method for collaboratively compiling a timetable for optimizing transfers between smart rail and buses according to claim 1, characterized in that: The first single-objective integer programming model and the second single-objective integer programming model are optimized and solved to obtain the optimal first bus departure time of each line, including the following steps: For passengers transferring from route p to route q, determine whether t ps +(i-1)h p >t qs +jh q , i, j are the bus numbers; if yes, then delete the auxiliary variables representing the feasible transfer and the parameters of the transfer waiting time and related constraints; otherwise, no processing is done; For passengers transferring from route q to route p, determine whether t qs +(j-1)h q >t ps +ih p ; If yes, delete the auxiliary variables representing the feasible transfers and the parameters of the transfer waiting time and related constraints; otherwise, no processing is done; The optimized first single-objective integer programming model and the second single-objective integer programming model are solved respectively to obtain the optimal first bus departure time of each line.

8. The method for collaboratively compiling a timetable for optimizing transfers between smart rail and buses according to claim 1, characterized in that: The optimal departure time of each bus on each line is calculated based on the optimal first bus departure time of each line and the departure interval and number of buses on each line. Specifically, it is: x pi =x p1 +(i-1)h p ,i≥2 x qj =x q1 +(j-1)h q ,j≥2 Among them, x pi is the optimal departure time of the i-th bus on route p; x qj is the optimal departure time of the jth bus on route q; p1 is the optimal first bus departure time of route p; x q1 is the optimal first bus departure time of route q; h p is the departure interval of line p; h q is the departure interval of line q.

Citation Information

Patent Citations

  • Operation coordination optimizing method of common public transit connecting with urban rail transit and system thereof

    CN101630440A

  • Urban rail transit receiving and transporting public transportation scheduled departing time generation method

    CN107016633A

  • Method for designing bus synchronous transfer timetable of transfer subway hub

    CN113077086A

  • Intelligent bus combination scheduling method and device and storage medium

    CN114154801A

  • Track connection optimization method, electronic equipment and storage medium

    CN114997545A