A bus network design optimization method considering vehicle capacity and station capacity
Through the space-time bus network model and Lagrangian slack algorithm, the bus network design is optimized, and the problem of unconsidered vehicle capacity and site capacity is solved, the passenger travel time is reduced and the bus network layout is optimized, and the bus system is improved. Efficiency and reliability.
Patent Information
- Application Number
- CN202210541529.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-05-17
- Publication Date
- 2024-12-03
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
The existing bus network design fails to effectively consider the on-board capacity and station capacity, resulting in long travel time for passengers and uneven bus route layout, affecting the reliability and selectivity of passengers for bus travel.
The space-time bus network model is adopted, combined with the Lagrangian slack algorithm and the general algebraic modeling system GAMS, and is decomposed into the shortest passenger time path problem and the 0-1 backpack problem, optimize the bus network design, consider the on-board capacity and site capacity, and arrange the passengers most Optimize travel plans and reduce the total travel time.
Under the conditions of meeting passenger travel needs and construction budget, optimize the bus network, improve the strategy of passenger travel path selection and the selection of potential construction sections, significantly reduce the total travel time of passengers, and provide a more reasonable bus network layout.
Smart Images

Figure CN115081153B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to a bus network design optimization method taking vehicle capacity and station capacity into consideration, and belongs to the technical field of public transportation network design. Background Art
[0002] As an important part of the urban transportation system, urban public transportation has the advantages of strong carrying capacity, low transportation cost and low energy consumption. It is an important and effective tool for users when traveling. It is closely related to the lives of the majority of urban residents and plays an important role in urban economic development and providing convenience for urban residents' travel.
[0003] The main problems in the current public transportation system are that passengers need to transfer when taking buses. At the same time, due to the long waiting time when passengers take buses, the passengers' trust in the reliability of whether buses can reach their destinations on time is reduced, which hinders passengers from choosing buses. At the same time, the bus network layout of some bus networks is unreasonable, and the setting of bus routes in different areas of the city is uneven. In some areas, the bus routes are too concentrated, while in some areas, they are obviously insufficient. As the basic part of the bus system, how to design a well-structured and reasonable bus network to address the above problems, consider the vehicle capacity limit and station capacity limit when designing the bus network, and consider the potential construction sections in the network, and reasonably optimize the bus network design, has a strong practical significance and importance.
[0004] At present, the research on bus network design is basically limited to bus network flow distribution and bus network facility configuration issues, and there are relatively few bus network design studies that consider vehicle capacity and station capacity. Therefore, it is necessary to design a bus network optimization method that considers vehicle capacity and station capacity to provide a reference guide for the reasonable design of bus network solutions. Summary of the invention
[0005] The technical problem to be solved by the present invention is to provide a bus network design optimization method taking into account vehicle capacity and station capacity, which can minimize the total travel time of passengers in the bus network under the premise of meeting the travel needs of passengers.
[0006] The present invention adopts the following technical solutions to solve the above technical problems:
[0007] A bus network design optimization method considering vehicle capacity and station capacity includes the following steps:
[0008] Step 1: Based on the bus network in geographic space, consider the potential construction sections, add discrete time dimensions, and construct a spatiotemporal bus network corresponding to the bus network in geographic space;
[0009] Step 2: In the spatiotemporal bus network, the parameters required for constructing the spatiotemporal bus network are converted into data in the form of a time network, and the service process of the bus network in geographic space is represented on the arcs in the spatiotemporal bus network;
[0010] Step 3, based on the relevant parameters of the spatiotemporal bus network, the relevant parameters of the geographic space bus network, the relevant parameters of the passenger travel demand and the relevant parameters of the potential construction section, a bus network design optimization problem considering vehicle capacity and station capacity is constructed as the original problem;
[0011] Step 4: Use the Lagrangian relaxation algorithm to construct a dual model of the bus network design optimization problem considering vehicle capacity and station capacity. Decompose the dual model into two sub-problems, namely, sub-problem 1 of the time-dependent shortest path problem for passengers and sub-problem 2 of the 0-1 knapsack problem for road section construction variables. Use the general algebraic modeling system GAMS to obtain the values of the two sub-problems and obtain the lower bound of the original problem.
[0012] Step 5: Consider potential construction sections, arrange the best travel plan for passengers in the current network according to the travel demand between stations, the shortest path between stations, vehicle capacity and station capacity, and find the minimum total travel time of all passengers in the current network, that is, the optimal value;
[0013] Step 6, set the maximum number of iterations, use the subgradient method to update the Lagrange multiplier, return to step 4 for a loop iteration, and after the iteration is completed, output the lower bound value generated after each iteration, as well as the path chosen by each passenger in the system when traveling.
[0014] As a preferred embodiment of the present invention, the specific process of step 1 is as follows:
[0015] Step 11, consider the potential construction sections of the bus network, as well as the starting and ending stations corresponding to the potential construction sections; discretize the continuous optimization time range;
[0016] Step 12, determining the parameters required for constructing the spatiotemporal bus network, including: nodes, sections and section travel time in the geographic space bus network, potential construction sections and potential construction section travel time, vehicle capacity, station capacity, the shortest travel time between bus stations, the maximum travel time of the bus network, and the starting station and the ending station where the passenger travel demand occurs; the node is the bus station;
[0017] Step 13, construct a space-time bus network with spatial position as the X-axis and time as the Y-axis.
[0018] As a preferred solution of the present invention, in step 2, at time t, the passenger at station i is represented as a node (i, t) in the space-time bus network; the passenger travels from station i to station j, and the travel time is (st), which is represented as a service arc (i, j, t, s) in the space-time bus network; the passenger waits at station i, and the waiting time is (t′-t), which is represented as a waiting arc (i, i, t, t′) in the space-time bus network; the waiting time of the passenger at the terminal is not included in the waiting cost, that is, the waiting cost of the passenger at the terminal is 0.
[0019] As a preferred solution of the present invention, the specific process of step 3 is as follows:
[0020] Step 31, define the binary decision variables of arcs and road segments: Indicates whether passenger a chooses arc (i, j, t, s). 1 means passenger a passes through arc (i, j, t, s), and 0 means passenger a passes through arc (i, j, t, s). i,j ={0,1} indicates whether the road section (i,j) is constructed. 1 represents construction of the road section (i,j), and 0 represents the opposite;
[0021] Step 32, establish the flow balance constraint, that is, passenger inflow = outflow:
[0022]
[0023] Where E is the set of arcs in the spatiotemporal bus network, o(a) is the starting station of passenger a, and DT a is the departure time, d(a) is the final stop of passenger a, and T is the final time; Indicates whether passenger a chooses arc (j,i,s,t);
[0024] Step 33, establish the construction section constraints of the bus network, that is, the construction section cost cannot exceed the total construction budget, ∑ (i,j)∈L f i,j ×y i,j ≤B, f i,j =0for(i,j)∈L C , where f i,j is the construction cost of the road section (i, j), B is the total construction budget, L is the set of bus network sections, L C It is a set of existing road segments in the bus network;
[0025] Step 34, establish capacity constraints, that is, the number of passengers cannot exceed the vehicle capacity and station capacity, y i,j =1for(i,j)∈L C , Cap i,j,t,s is the vehicle capacity, and the site capacity is Cap i,i,t,t′ express;
[0026] Step 35, establish the objective function of minimizing the total travel time of all passengers in the bus network:
[0027]
[0028] Among them, C i,j,t,s is the travel cost parameter of the road segment, which indicates the time it takes for passengers to pass through the road segment.
[0029] As a preferred solution of the present invention, the specific process of step 4 is as follows:
[0030] Step 41, introduce the Lagrange multiplier μ i,j,t,s , relax the capacity constraint into the objective function to form the relaxed objective function:
[0031]
[0032] Decompose the relaxed objective function into subproblem 1 and subproblem 2 by decomposition;
[0033] Subproblem 1 is the time-dependent shortest path problem for passengers:
[0034]
[0035] Subproblem 2 is the 0-1 knapsack problem:
[0036]
[0037] Step 42, using the general algebraic modeling system GAMS to solve subproblems 1 and 2, obtain the values of subproblems 1 and 2, and add the value of subproblem 1 to the value of subproblem 2 to obtain the lower bound of the original problem.
[0038] As a preferred solution of the present invention, the specific process of step 6 is as follows:
[0039] Step 61, determine whether the current number of iterations n exceeds the set maximum number of iterations. If the current number of iterations n exceeds the maximum number of iterations, terminate the algorithm; otherwise, n=n+1, go to step 62 to update the Lagrange multiplier and start the next round of iterations;
[0040] Step 62, using the subgradient method to update the Lagrange multiplier;
[0041] Subgradient of capacity constraint: represents the subgradient of the capacity constraint;
[0042] Update the Lagrange multipliers:
[0043]
[0044] are the Lagrange multipliers of the nth and n+1th iterations, α n is the step size, α n =1 / (n+1);
[0045] Step 63, after reaching the set maximum number of iterations, output the lower bounds generated in all iteration processes.
[0046] Compared with the prior art, the present invention adopts the above technical solution and has the following technical effects:
[0047] 1. The method proposed in the present invention can be solved in a real bus network, taking into account the vehicle capacity and station capacity, and optimizing the path selection strategy of passengers when traveling on the bus network and the selection strategy of the bus network for potential construction sections under the conditions of meeting the travel needs of passengers and the construction budget constraints.
[0048] 2. The present invention is based on spatiotemporal state network modeling, and the designed relaxed decomposition algorithm has high calculation accuracy, can quickly obtain a lower bound of good quality, and can more realistically simulate the actual situation.
[0049] 3. The present invention can provide a reference for optimizing the overall layout of a bus network within a region for bus companies. BRIEF DESCRIPTION OF THE DRAWINGS
[0050] Figure 1 It is a flow chart of a method for optimizing bus network design considering vehicle capacity and station capacity according to the present invention;
[0051] Figure 2 is a physical bus network topology diagram of the present invention;
[0052] Figure 3 is the travel demand table between the stations in the present invention;
[0053] Figure 4 is the information table of the network service arc in the present invention;
[0054] Figure 5 (a) and (b) are the travel route diagrams selected by passengers between station 1-station 8 and station 1-station 9 in the present invention respectively;
[0055] Figure 6 (a) and (b) are the travel route diagrams selected by passengers between station 2-station 8 and station 2-station 9 in the present invention respectively;
[0056] Figure 7 (a) and (b) are the travel route diagrams chosen by passengers between station 5-station 8 and station 3-station 8 in the present invention respectively. DETAILED DESCRIPTION
[0057] The embodiments of the present invention are described in detail below, and examples of the embodiments are shown in the accompanying drawings. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and cannot be interpreted as limiting the present invention.
[0058] like Figure 1 As shown, it is a flow chart of the method of the present invention, and the specific steps are as follows:
[0059] (1) Based on the bus network in geographic space, potential construction sections are considered and a discrete time dimension is added to form a spatiotemporal bus network corresponding to the bus network in geographic space. The specific steps are as follows:
[0060] (11) Consider the potential construction sections of the bus network. The construction of potential construction sections will form a new path between the corresponding starting station and the ending station. Discretize the continuous optimization time range. T * =(t0,t1,t2,…t N ), t0 represents time 0, t N represents time N;
[0061] (12) Determine the parameters needed to construct the spatiotemporal network: nodes and sections in the bus physical network, section travel time, potential construction sections and their section travel time, vehicle capacity and station capacity, the shortest travel time between stations, the maximum travel time of the bus network, and the starting and ending stations where passenger travel demand occurs;
[0062] (13) A spatiotemporal state network is constructed with spatial position as the X-axis and time as the Y-axis. The input parameters in step (12) are converted into data in the spatiotemporal network state: Generate a node (i, t), which means that the passenger is at station i at time t. Generate a service arc (i, j, t, s), which means that the passenger travels from station i to station j with a travel time of (st). Generate a waiting arc (i, i, t, t′), which means that the passenger waits at station i with a waiting time of (t′-t).
[0063] (2) In the spatiotemporal state network, the service process of the bus network is represented on the arcs in the network. The arcs in the spatiotemporal network include two types of sections: service arcs and waiting arcs.
[0064] The specific classification steps of the arcs formed by each road segment are:
[0065] (21) The arc set E includes the service arc E T With waiting arc E W . That is E=E T ∪E W .
[0066] (22) A service arc (i, j, t, s) satisfies the following conditions. The service arc is extended from the link (i, j), and each service arc is from vertex (i, t) to vertex (j, s) based on a given time, where (st) is the travel time of link (i, j), the travel time is an integer multiple of 1 time unit, and the capacity is the capacity of the bus.
[0067] (23) The waiting arc (i,i,t,t′) satisfies the following conditions: the passenger waits at station i, and the process from state (i,t) to (i,t+1) can be regarded as the process of waiting on the waiting arc. The waiting time is 1 time unit, and the travel cost also increases by 1 time unit. At this time, the capacity constraint to be considered is the station capacity. It should be noted that the waiting time of the passenger at the terminal is not included in the travel cost, that is, the waiting cost of the passenger at the destination is 0.
[0068] (3) Based on the relevant parameters of the spatiotemporal network, the relevant parameters of the bus network, the relevant parameters of passenger travel demand, and the relevant parameters of the potential construction sections, a bus network design optimization model considering vehicle capacity and station capacity is constructed for the initial problem; the specific steps are as follows:
[0069] (31) Define binary decision variables for arcs and road segments: whether passenger a chooses this arc 1 means passenger a passes through arc (i, j, t, s), 0 means the opposite. Whether to build this section: y i,j ={0,1}, 1 represents the construction of the road section, and 0 represents the opposite.
[0070] (32) Establish the flow balance constraint condition, that is, passenger inflow = outflow:
[0071]
[0072] Where E is the set of arcs in the space-time network, o(a) is the starting station of passenger a, and DT a is the departure time, d(a) is the terminal station of passenger a, and T is the terminal time.
[0073] (33) Establish the construction section constraints of the bus network, that is, the construction section cost cannot exceed the total construction budget, ∑ (i,j)∈L f i,j ×y i,j ≤B, f i,j =0for(i,j)∈L C , where f i,j is the cost of road construction, B is the total construction budget, L is the set of bus network sections, L C It is a set of existing road segments in the bus network.
[0074] (34) Establish capacity constraints, i.e. the number of passengers cannot exceed the vehicle capacity and station capacity. y i,j =1for(i,j)∈L C ;
[0075] Among them, Cap i,j,t,s It is the vehicle capacity. It should be noted that the site capacity can also be used i,j,t,s To represent, specifically expressed as Cap i,i,t,t′ .
[0076] (35) Establish the objective function of minimizing the total travel time of all passengers in the bus network:
[0077]
[0078] Among them, C i,j,t,s is the travel cost parameter of the corresponding road section, which expresses the time it takes for passengers to pass through the road section.
[0079] (4) Lagrange multipliers are introduced to perform Lagrange relaxation on the bus network design problem considering vehicle capacity and station capacity. The original problem is then decomposed into two sub-problems, namely sub-problem 1 about the shortest path problem and sub-problem 2 about the 0-1 knapsack problem of road section construction variables. The GAMS solver is used to obtain the values of the two sub-problems and the lower bound of the original problem. The specific steps are as follows:
[0080] (41) Introduce the Lagrange multiplier μ i,j,t,s , relax the capacity constraint into the objective function to form the relaxed objective function:
[0081]
[0082] Among them, based on the decision variables and i,j , the above binary problem can be decomposed into two sub-problems 1 and 2, that is, the relaxed objective function can be decomposed into sub-problem 1 and sub-problem 2 by decomposition.
[0083] Subproblem 1 is the time-dependent shortest path problem for passengers:
[0084]
[0085] Subproblem 2 is the 0-1 knapsack problem:
[0086]
[0087] (42) GAMS (General Algebraic Modeling System) is used to solve subproblems 1 and 2, and the lower bound of the original problem is obtained. The value of the lower bound is the sum of the value of subproblem 1 and the value of subproblem 2.
[0088] (5) Considering the potential construction sections in the current network, after the construction of the new section, it means that there are new travel routes for passengers in the current bus network to choose from. At the same time, according to the travel demand between each station and the shortest path for each passenger in the bus network after the construction of the new section, the shortest travel time for passengers in the bus network after the construction of the potential construction section can be obtained, that is, the optimal value;
[0089] Consider potential road construction sections, based on fixed travel demand between stations and the shortest path between stations, consider vehicle capacity and station capacity (the optimal travel plan for some passengers will be waiting for the next vehicle at an intermediate station), arrange the optimal travel plan for passengers in the current network, and find the minimum total travel time for all passengers in the current network, that is, the optimal value of the objective function.
[0090] (6) Use the subgradient method to update the multiplier, set the maximum number of iterations, iterate repeatedly, and output the lower bound value generated after each iteration after the iteration is completed, as well as the path selected by each passenger in the system when traveling; the specific steps are:
[0091] (61) According to the set maximum number of iterations, determine whether the current number of iterations n exceeds the preset maximum number of iterations. If the number of iterations n exceeds the maximum number of iterations, terminate the algorithm; otherwise, n = n + 1, update the μ value, and start the next round of iterations.
[0092] (62) The Lagrange multipliers are updated using the subgradient method.
[0093] Subgradient of capacity constraint: represents the subgradient of the capacity constraint.
[0094] Update the Lagrange multipliers:
[0095] Capacity constraint multiplier:
[0096] α n is the step size, α n =1 / (n+1).
[0097] (63) After the number of iterations reaches the maximum, the lower bounds generated during all iterations are output.
[0098] Example
[0099] (1) This embodiment is based on Figure 2Take the bus network shown in the figure as an example. The network contains 9 nodes, 12 sections, of which 3 sections are potential construction sections, and 9 paths, of which 3 paths are new paths after the construction of potential sections. Among them, Station 1, Station 2, Station 3, and Station 5 are the starting nodes of passenger travel demand, and Station 8 and Station 9 are the ending nodes of passenger travel demand. There are 9 paths in total. There are 6 paths in the network before the construction of potential sections, namely Station 1 to Station 8, Station 1 to Station 9, Station 5 to Station 8, Station 2 to Station 8, Station 2 to Station 9, and Station 3 to Station 8. After the construction of potential sections, 3 new paths are added, namely 2 new paths from Station 1 to Station 8 and 1 new path from Station 2 to Station 8. The vehicle capacity is 20, the station capacity is 40 for Station 1 and Station 2, 30 for Station 3, Station 4, Station 5, Station 6, and Station 7, and 1000 for Station 8 and Station 9.
[0100] (2) Potential construction sections are station 5 to station 4, station 6 to station 5, and station 7 to station 8. The construction cost of each construction section is 300, and the total budget for bus network construction is 1000. Passengers with the same starting station, ending station, and departure time are grouped into one group. During the trip, due to vehicle capacity restrictions or station capacity restrictions, when passengers need to wait at intermediate stations, the travel order of passengers in the same group is out of order. The travel demand of each station is as follows: Figure 3 As shown, the service arc information table in the network is as follows Figure 4 shown.
[0101] (3) Considering potential construction sections, time is discretized and a set of time state points is constructed. The time discretization is set to T = (0, 1, 2…, 62). Based on the physical network topology of the graph, the time-space state arcs are established, including service arcs and waiting arcs. During the travel process, the waiting time of passengers at intermediate stations is included in the travel time, while the waiting time at the terminal station is not included in the travel time.
[0102] (4) Establishing a mathematical optimization model
[0103]
[0104] y i,j ={0,1}
[0105] (5) Initialize the Lagrange multiplier μ i,j,t,s =0.1, and the number of iterations is set to 10. The optimal value of the total travel time of passengers in the network after considering the construction of the road section is obtained by using step (5) of the present invention. The mathematical optimization model is solved by using the algorithm designed in steps (4) and (6) of the present invention, and finally the lower bound value and the travel path selected by passengers between each station are obtained, as shown in Tables 1 and 2 below. Figure 5(a) and (b) in the figure show the travel paths chosen by passengers between station 1-station 8 and station 1-station 9 respectively; Figure 6 (a) and (b) in the figure show the travel paths chosen by passengers between station 2-station 8 and station 2-station 9 respectively; Figure 7 (a) and (b) in the figure show the travel paths chosen by passengers between station 5 and station 8 and station 3 and station 8 respectively.
[0106] Table 1
[0107]
[0108] Table 2
[0109]
[0110] The above embodiments are only for illustrating the technical idea of the present invention, and cannot be used to limit the protection scope of the present invention. Any changes made on the basis of the technical solution in accordance with the technical idea proposed by the present invention shall fall within the protection scope of the present invention.
Claims
1. A bus network design optimization method considering vehicle capacity and station capacity, It is characterized in that The steps include: Step 1: Based on the bus network in geographic space, consider the potential construction sections, add discrete time dimensions, and construct a spatiotemporal bus network corresponding to the bus network in geographic space; Step 2: In the spatiotemporal bus network, the parameters required for constructing the spatiotemporal bus network are converted into data in the form of a time network, and the service process of the bus network in geographic space is represented on the arcs in the spatiotemporal bus network; Step 3, based on the relevant parameters of the spatiotemporal bus network, the relevant parameters of the geographic space bus network, the relevant parameters of the passenger travel demand and the relevant parameters of the potential construction section, a bus network design optimization problem considering vehicle capacity and station capacity is constructed as the original problem; The specific process is as follows: Step 31, define the binary decision variables of arcs and road segments: Indicates whether passenger a chooses arc (i, j, t, s). 1 means passenger a passes through arc (i, j, t, s), and 0 means passenger a passes through arc (i, j, t, s). i,j ={0,1} indicates whether the road section (i,j) is constructed. 1 represents construction of the road section (i,j), and 0 represents the opposite; Step 32, establish the flow balance constraint, that is, passenger inflow = outflow: Where E is the set of arcs in the spatiotemporal bus network, o(a) is the starting station of passenger a, and DT a is the departure time, d(a) is the final stop of passenger a, and T is the final time; Indicates whether passenger a chooses arc (j,i,s,t); Step 33, establish the construction section constraints of the bus network, that is, the construction section cost cannot exceed the total construction budget, where f i,j is the construction cost of the road section (i, j), B is the total construction budget, L is the set of bus network sections, L C It is a set of existing road segments in the bus network; Step 34, establish capacity constraints, that is, the number of passengers cannot exceed the vehicle capacity and station capacity, Cap i,j,t,s is the vehicle capacity, and the site capacity is Cap i,i,t,t′ express; Step 35, establish the objective function of minimizing the total travel time of all passengers in the bus network: Among them, C i,j,t,s is the travel cost parameter of the road segment, which indicates the time it takes for passengers to pass through the road segment; Step 4: Use the Lagrangian relaxation algorithm to construct a dual model of the bus network design optimization problem considering vehicle capacity and station capacity. Decompose the dual model into two sub-problems, namely, sub-problem 1 of the time-dependent shortest path problem for passengers and sub-problem 2 of the 0-1 knapsack problem for road section construction variables. Use the general algebraic modeling system GAMS to obtain the values of the two sub-problems and the lower bound of the original problem. The specific process is as follows: Step 41, introduce the Lagrange multiplier μ i,j,t,s , relax the capacity constraint into the objective function to form the relaxed objective function: Decompose the relaxed objective function into subproblem 1 and subproblem 2 by decomposition; Subproblem 1 is the time-dependent shortest path problem for passengers: Subproblem 2 is the 0-1 knapsack problem: Step 42, using the general algebraic modeling system GAMS to solve subproblems 1 and 2, obtain the values of subproblems 1 and 2, and add the value of subproblem 1 to the value of subproblem 2 to obtain the lower bound of the original problem; Step 5: Consider potential construction sections, arrange the best travel plan for passengers in the current network according to the travel demand between stations, the shortest path between stations, vehicle capacity and station capacity, and find the minimum total travel time of all passengers in the current network, that is, the optimal value; Step 6, set the maximum number of iterations, use the subgradient method to update the Lagrange multiplier, return to step 4 for a loop iteration, and after the iteration is completed, output the lower bound value generated after each iteration, as well as the path chosen by each passenger in the system when traveling.
2. The bus network design optimization method considering vehicle capacity and station capacity according to claim 1, It is characterized in that The specific process of step 1 is as follows: Step 11, consider the potential construction sections of the bus network, as well as the starting and ending stations corresponding to the potential construction sections; discretize the continuous optimization time range; Step 12, determining the parameters required for constructing the spatiotemporal bus network, including: nodes, sections and section travel time in the geographic space bus network, potential construction sections and potential construction section travel time, vehicle capacity, station capacity, the shortest travel time between bus stations, the maximum travel time of the bus network, and the starting station and the ending station where the passenger travel demand occurs; the node is the bus station; Step 13, construct a space-time bus network with spatial position as the X-axis and time as the Y-axis.
3. The bus network design optimization method considering vehicle capacity and station capacity according to claim 1, It is characterized in that In step 2, at time t, the passenger at station i is represented as a node (i, t) in the space-time bus network; the passenger travels from station i to station j, and the travel time is (st), which is represented as a service arc (i, j, t, s) in the space-time bus network; the passenger waits at station i, and the waiting time is (t′-t), which is represented as a waiting arc (i, i, t, t′) in the space-time bus network; the waiting time of the passenger at the terminal is not included in the waiting cost, that is, the waiting cost of the passenger at the terminal is 0.
4. The bus network design optimization method considering vehicle capacity and station capacity according to claim 1, It is characterized in that The specific process of step 6 is as follows: Step 61, determine whether the current number of iterations n exceeds the set maximum number of iterations. If the current number of iterations n exceeds the maximum number of iterations, terminate the algorithm; otherwise, n=n+1, go to step 62 to update the Lagrange multiplier and start the next round of iterations; Step 62, using the subgradient method to update the Lagrange multiplier; Subgradient of capacity constraint: represents the subgradient of the capacity constraint; Update the Lagrange multipliers: are the Lagrange multipliers of the nth and n+1th iterations, α n is the step size, α n =1 / (n+1); Step 63, after reaching the set maximum number of iterations, output the lower bounds generated in all iteration processes.
