Robust management and control method for multi-line cooperation of double-source trolley bus

By building a robust optimization model for dual-source trolleybus, the congestion problems caused by vehicle coordination and spatial correlation are solved, and a robust timetable is generated, which improves operational stability and efficiency and reduces the risk of vehicle series.

CN118982135AActive Publication Date: 2024-11-19NORTHEAST FORESTRY UNIV

Patent Information

Application Number
CN202410966492.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-18
Publication Date
2024-11-19
Estimated Expiration
2044-07-18

AI Technical Summary

Technical Problem

The local space or even larger congestion caused by the actual site space correlation and vehicle coordination of the vehicle are not considered during the operation of the dual-source trolleybus.

Method used

Using a robust management and control method of multi-line collaboration between dual-source trolley cars, the automatic vehicle positioning data and passenger data are collected by building a line network and vehicle operation status set, and a robust optimization model is built to maximize the number of vehicle collaborations, minimize fleet size and The timing deviation of the front of the car generates a robust timetable.

Benefits of technology

Even in a dynamic environment, it can maintain stable operation status, improve passenger transfer efficiency, reduce vehicle traffic risks, improve the regularity of operation services, and realize the robustness of static scheduling plans.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118982135A_ABST
    Figure CN118982135A_ABST
Patent Text Reader

Abstract

The invention discloses a robust management and control method for multi-line cooperation of a double-source trolley bus, and relates to a management and control method of the double-source trolley bus. The method aims at solving the problem that in the running process of an existing double-source trolley bus, due to the fact that spatial relevance of stations where vehicles are actually located and vehicle collaboration are not considered, local space or even larger-range congestion is caused. The model established by the method is a mixed integer nonlinear programming model, belongs to a minimum-maximum optimization problem, and aims to find a solution which is good in performance in a worst scene. The robust management and control method for the multi-line cooperation of the double-source trolley bus is provided by considering the uncertainty of the driving time and the stopping time in the dynamic environment and focusing on the operation characteristics of the double-source trolley bus, the operation state can be kept stable even under the poor condition, the transfer efficiency of passengers in a line network is improved, and the transfer efficiency of the passengers in the line network is improved. The risk of vehicle bunching is reduced, the regularity of double-source trolley bus line operation service is improved, and the robustness of a static scheduling plan is achieved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to a control method for a dual-source trolleybus. Background Art

[0002] New energy for public transportation has become a development trend for urban buses. As a green travel tool, trolleybuses have served urban public transportation for more than a hundred years and have made important contributions to urban transportation and environmental protection. With the development of science and technology, dual-source trolleybuses have been upgraded on the basis of traditional trolleybuses, connecting the contact wire network with collector poles and equipped with lithium-ion batteries to form a dual-source power drive. In view of its high efficiency, low pollution, low cost and good mobility, many cities are building dual-source trolleybus line networks. Therefore, the research on the operation planning and scheduling of dual-source trolleybuses has important practical significance for energy conservation and emission reduction and the realization of green transportation.

[0003] The convenience of transfer within the bus network is a key service quality factor that residents consider when choosing buses. Untimely transfers will lead to longer waiting times for passengers to transfer, causing serious troubles to residents' travel. However, due to the different locations of each station, the traffic conditions of the corresponding physical space vary greatly, such as the road conditions between the current station and other stations, whether they are unobstructed, and the road conditions between a station and a station with vehicle traffic connectivity, whether they have accessibility conditions; at the same time, in an open road environment, affected by uncertain factors such as road conditions, fluctuating passenger flow, and extreme weather, the driving time and stop time corresponding to a certain spatial station of the dual-source trolleybus show huge fluctuations, which not only seriously affects the synergy of the vehicle, but may also cause congestion in the local space (stations or roads), and also leads to technical problems with high risk of vehicle stringing. More importantly, the early arrival and delay of vehicles may affect downstream stations and even other lines, causing a chain reaction between nodes with spatial connectivity, causing congestion in a larger area. In addition, the congestion of stations / roads in a larger area not only reduces traffic efficiency, but also makes it impossible for passengers to transfer in time, and even further aggravates the congestion.

[0004] The uniqueness of the dual-source trolleybus operation mode brings greater challenges to the realization of coordinated dispatching. The traffic nodes of the dual-source trolleybus line network include not only common stations, but also line combiners, automatic catchers, and power supply network segments. Figure 1 As shown, the closer is a device that connects the original four contact wires into two contact wires when two tram lines intersect. Figure 2 The automatic catcher is a device for raising and lowering the collector pole of a trolleybus. Under this device, the dual-source trolleybus needs to stop to complete the pole raising operation. When passing through the above-mentioned operating device, the dual-source trolleybus needs to slow down or stop, which makes it more susceptible to dynamic environmental interference. Figure 3The power supply network segment in the system is the basic contact line unit for studying vehicle energy consumption, and adjacent segments are in an electrically isolated insulation state. Due to the limited power of the contact line, the number of dual-source trolleybuses in a segment cannot exceed the carrying capacity of the power supply network segment, otherwise there will be power outages such as protection and tripping, which will affect the stable operation of the vehicle and even cause the vehicle to break down.

[0005] At present, dynamic control methods are mainly used to deal with disturbances in dynamic environments. For example, strategies such as stationing, skipping, speed control, and spare vehicle replacement are proposed to reduce bus operation deviations. However, the implementation of dynamic control depends on the construction of a complete intelligent road infrastructure, which requires a large amount of capital investment. In addition, these methods may harm the interests of passengers. For example, the stationing strategy will increase the waiting time of passengers in the car, and the skipping and spare vehicle replacement strategies may disrupt passengers' travel plans. Compared with dynamic control, it is a more economical and effective method to use static scheduling strategies to generate robust timetables to achieve collaborative scheduling. Robust timetables can resist the volatility of travel time and stop time to a certain extent, and can maintain the stability of the operating status even under poor conditions. Summary of the invention

[0006] The present invention aims to solve the problem of local space or even larger-scale congestion caused by failure to consider the spatial correlation of the actual stations and vehicle coordination during the operation of dual-source trolleybuses, and to provide a robust control method for multi-line coordination of dual-source trolleybuses.

[0007] The robust control method for multi-line coordination of dual-source trolleybuses of the present invention is carried out in the following steps:

[0008] Step 1: Select the dual-source trolleybus line to build a line network, and establish the attribute set of each traffic node in the network to store the line and traffic node information;

[0009] The attribute set of each traffic node includes the starting station, the terminal station, the common station, the non-common station, the automatic catcher, the line closeer, the number and location of the power supply network segments, and the distribution and length of the disconnected line segments; the common station includes the transfer station and the non-transfer station;

[0010] Step 2: According to the control period, establish a train operation status set to store train operation information;

[0011] The train operation status includes the number of up and down train departures on each line during the control period, the vehicle travel path, the departure frequency range, the planned departure interval, the initial departure schedule and the arrival time;

[0012] Step 3: Collect the AVL data within the control period of a certain period, calculate the travel time of the adjacent stations, round it off in minutes, and include it in the travel time set of the adjacent stations, and obtain an integer set of the travel time of the adjacent stations with upper and lower bounds;

[0013] Step 4: Using the IC card and QR code data on the dual-source trolleybus, collect the boarding passenger data at each station during the same control period, and calculate the average passenger arrival rate at each station on each route;

[0014] Step 5: Focus on the operating characteristics of dual-source trolleybuses and build a robust optimization model for multi-line coordination of dual-source trolleybus timetables:

[0015] A few notes before building the model:

[0016] 1) The present invention considers that the departure frequency of a route is determined according to the maximum passenger flow section of the route, so the vehicle carrying capacity can meet the passenger flow demand during peak hours;

[0017] 2) It is believed that the power supply facilities and contact wire network devices of the dual-source trolleybus are operating normally and the vehicle is in good condition;

[0018] 3) It is assumed that each line is equipped with the same dual-source trolleybus model, and the vehicle will stop at every station;

[0019] 4) It is considered that the power output of the contact line network is stable and the power of each power supply network segment is the same;

[0020] 1. Vehicle motion equation part

[0021] The volatility of vehicle travel time is generally manifested as random characteristics caused by the time-varying characteristics and road conditions at different time periods;

[0022]

[0023] Formula (1) represents the time when the nth vehicle on line l arrives at station b Equal to the time of leaving station b-1 Add the travel time between stops Where r represents the direction of the route, a represents arrival, and d represents departure;

[0024]

[0025] Formula (2) represents the time when the nth vehicle on line l leaves station b Equal to the time of arrival at station b Add the time spent at the station

[0026] The stop time of a vehicle at a station is mainly affected by the number of passengers getting on and off the station and presents fluctuations. Since the time for passengers to get off the station is shorter than the time for getting on the station, it can be considered that the stop time at the station is mainly composed of the time for passengers to get on the station and the time for the vehicle to open and close the doors. Assuming that the arrival of passengers follows a uniform distribution (that is, the number of people arriving at station b per unit time is constant, and as soon as the last train leaves station b, another passenger arrives at station b. As time goes by, the number of passengers continues to accumulate until the next train arrives at station b and takes all of them on board. Therefore, the stop time is related to the interval between two adjacent trains on the line), then the stop time at the station is related to the headway time of adjacent trains, see formula (3):

[0027]

[0028] Among them, t0 is the time required for the vehicle to open and close the door, γ lb is the passenger arrival rate at station b on line l, β is the average boarding time of each passenger;

[0029] Integrating formulas (1) and (2) yields formula (4), which represents the time of arrival at station b: Equal to departure time Add the travel time of each section before station b Stop times at each station

[0030]

[0031] The calculation method of the time for the dual-source trolleybus to reach the automatic catcher, the closeer and the power supply network segment is the same as above;

[0032] 2. Objective Function

[0033] 1) Maximize the number of vehicle collaborations

[0034] Any common station in the overlapping section of the lines can be used for transfer, but in actual operation, passengers generally only choose the last transfer station for transfer, and the number of transfers at the remaining common stations is relatively small, which can be regarded as non-transfer stations; the coordination of the present invention not only includes coordinated transfer of passengers at transfer stations, but also includes coordinated entry of vehicles at non-common stations, and coordination time windows are set for transfer stations and non-transfer stations respectively, and finally the total number of coordination times is added up;

[0035] The time interval between vehicles arriving at the transfer station should not be too short or too long. The shortest interval is w b Passengers have enough time to transfer, and the longest interval W b This ensures that the waiting time for transfers will not be too long;

[0036]

[0037] In formula (5), if the time difference between train number n of line l and train number m of line j arriving at transfer station b is within the time window [w b ,W b ], the two trains are considered as coordinated transfer trains, and the binary variable It is recorded as 1, otherwise it is recorded as 0;

[0038] In order to avoid vehicle congestion at non-transfer stations, it is also necessary to set an arrival time window, with the shortest interval v b , the longest interval V b , if the time difference between train number n of line l and train number m of line j arriving at non-transfer station b is greater than v b , and is less than V b , then the two trains are regarded as coordinated trains entering the station, and the binary variable in formula (6) is used Determine whether the trains enter the station in a coordinated manner;

[0039]

[0040] Formula (7) represents the number of vehicle coordination between the upward transfer station and the non-transfer station, and the 1 on the subscript represents the upward direction; Formula (8) represents the number of vehicle coordination between the downward transfer station and the non-transfer station, and the 2 on the subscript represents the downward direction; Formula (9) represents the goal of maximizing the total number of coordination;

[0041]

[0042] maxF1=F 1 +F 2 (9)

[0043] 2) Minimize the size of the fleet

[0044] The minimum number of vehicles required to complete all train tasks is equal to the sum of the maximum deficit values ​​of each station. Based on practice, the first and last stations of the line are used as dual-source trolleybus stations. The maximum deficit function is calculated for each station and summed to obtain the minimum fleet size.

[0045] Formulas (10)-(12) represent the process of calculating the fleet size using the deficit function, where T1 and T2 are the start and end times of the control period. Indicates that at time t, the nth train of line l has departed from station d; SD l,t represents the number of vehicles dispatched from station d up to time t; Indicates that at time t, the nth train on line l has arrived at station d, ED l,t represents the number of vehicles arriving at station d by time t, max(SD l,t -ED l,t ) represents the maximum deficit function of station d;

[0046]

[0047] 3) Minimize the headway deviation

[0048] Headway is the time difference between the front ends of two vehicles passing the same place. When the headway of a line is small, more vehicles will gather in the same power supply network segment, the line network load will be high, and vehicles may be stranded. When the headway is large, fewer vehicles will gather in the same power supply network segment, causing idle power in the line network. If the deviation between the actual headway and the planned headway can be reduced and the headway can be made more uniform, it can avoid vehicle congestion and improve the utilization rate of electric energy. In addition, a smaller headway deviation can also improve the regularity of vehicle operation services.

[0049] Therefore, the present invention selects two types of nodes prone to congestion, common sites and automatic catchers, to analyze the headway deviation; the line departure frequency has been determined in the frequency setting stage, and the planned headway is calculated. h l,n,b is the headway time of the vehicle at station b, h l,n,a is the headway of the vehicle at the automatic catcher a;

[0050] Formula (13) represents the average headway deviation of all stations;

[0051]

[0052] Formula (14) represents the average headway deviation at all automatic catchers;

[0053]

[0054] Formula (15) expresses the goal of minimizing the average headway deviation.

[0055] minF3=F a +F b (15)

[0056] 3. Constraints

[0057] 1) Departure interval constraints

[0058] In order to balance the bus service level and bus company revenue, constraint formulas (16)-(18) indicate that all buses on the route must meet the departure interval requirements. and are the minimum departure interval and the maximum departure interval of line l respectively; the departure time is T1 is the start time of the control period, and T2 is the end time of the control period; is the time when the first vehicle is dispatched on route l in direction r;

[0059]

[0060] 2) Operating device constraints

[0061] Constraint (19) indicates that the dual-source trolleybus needs to stop and raise the bar under the automatic catcher a. To avoid congestion caused by the simultaneous arrival of subsequent vehicles, a minimum arrival interval w is set. a ;

[0062]

[0063] Constraint (20) indicates that in order to avoid the two-source trolleybuses arriving at the combiner c at the same time, a minimum arrival interval w is also required. c ;

[0064]

[0065] 3) Power supply network segment carrying capacity constraints

[0066] Constraint (21) requires that the maximum number of vehicles DK in each segment is less than the maximum number of vehicles Q1 that the segment can carry. The value of Q1 should take into account the charging and air conditioning power of the vehicle, and the ratio of the number of controlled routes to the actual number of routes in the section.

[0067] DK≤Q1 (21)

[0068] Formulas (22)-(24) use the inverse difference function to express the maximum number of vehicles DK in the power supply network segment k, where sK l,n,t =1 means that at time t, train number n on line l has left segment k, eK l,n,t =1 means that train number n of line l has arrived at segment k; SK l,t With EK l,t They represent the number of vehicles that have left and arrived at segment k by time t respectively;

[0069]

[0070] 4) Speed ​​constraints on off-line sections

[0071] The dual-source trolleybus relies on the on-board lithium battery to drive in the off-line section. If the vehicle has low energy consumption in the off-line section, it is not only economical and energy-saving, but also can reduce the battery discharge depth and extend the battery life. In addition, compared with the vehicles that have just left the factory, the battery capacity of the vehicles that have been in operation for many years has greatly decayed. Reducing energy consumption can also reduce the risk of insufficient energy supply during off-line driving. The energy consumption test of the dual-source trolleybus shows that the energy consumption is low when the average speed of the vehicle is maintained in the range of 20km / h to 30km / h. Therefore, constraint formula (25) requires that the average driving speed of the vehicle in the off-line section is within the range of 20km / h to 30km / h:

[0072]

[0073] Constraints (16) to (21) and (25) must also meet the following requirements:

[0074]

[0075] t∈[T1,T2](26);

[0076] 3. Model integration

[0077] In order to reduce the impact of fluctuations in the travel time and stop time of dual-source trolleybuses on the interests of bus companies and passengers, and to seek a timetable that can perform well even in a dynamic environment, the present invention establishes a multi-objective robust optimization model and transforms the three objective functions into the form of a minimax problem:

[0078]

[0079] Step 6: Design a multi-objective minimum-maximum differential evolution algorithm to solve the problem according to the characteristics of the model: The present invention solves the multi-objective minimum-maximum optimization problem, combines the minimum-maximum differential evolution algorithm with the fast non-dominated sorting algorithm and the crowding distance algorithm, uses the penalty function to transform the constrained problem into an unconstrained problem, improves the mutation strategy, and proposes a multi-objective minimum-maximum differential evolution algorithm. The algorithm flow chart is shown in Figure 5 ;

[0080] Step 7: The algorithm generates a Pareto solution, selects the optimal solution, and outputs a robust timetable; selecting the optimal solution is to choose a solution that is in the best interests of the bus company or passengers.

[0081] The model established by the present invention is a mixed integer nonlinear programming model, which belongs to the minimum maximum optimization problem and aims to find a solution with good performance in the worst scenario. As an emerging algorithm improved from the differential evolution algorithm, the minimum maximum differential evolution algorithm avoids excessive search for the worst objective function of uncertain variables. In a single evolutionary algebra, the bottom lifting strategy and partial regeneration strategy are respectively used for the decision variables (only one group, that is, the departure time) and the uncertain variables (driving time and stop time), so that they evolve in the direction that meets their optimization goals at the same time.

[0082] Advantages of the present invention:

[0083] The present invention takes the correlation of station space into account in the travel time set of adjacent stations, and by considering the uncertainty of travel time and stop time in a dynamic environment, focuses on the operating characteristics of dual-source trolleybuses, and proposes a robust control method for multi-line coordination of dual-source trolleybuses, which can maintain the stability of the operating state even under poor conditions, improve the transfer efficiency of passengers in the line network, reduce the risk of vehicle stringing, and improve the regularity of dual-source trolleybus line operation services, and realize the robustness of static scheduling plans. The present invention provides a new idea for bus companies to compile dual-source trolleybus multi-line coordinated timetables, which is of great significance to promoting the large-scale operation of urban green buses. BRIEF DESCRIPTION OF THE DRAWINGS

[0084] Figure 1 It is a schematic diagram of the operation of a double-source trolleybus at the combiner;

[0085] Figure 2 It is a schematic diagram of the operation of a double-source trolleybus at an automatic catcher;

[0086] Figure 3 A schematic diagram of the segmented power supply network for dual-source trolleybuses;

[0087] Figure 4 It is the overall framework diagram of the method of the present invention;

[0088] Figure 5 This is the flow chart of the multi-objective minimum-maximum differential evolution algorithm;

[0089] Figure 6 This is a schematic diagram of the upward direction of the dual-source trolleybus line in Test 1;

[0090] Figure 7 This is a schematic diagram of the downward direction of the double-source trolleybus line in Test 1;

[0091] Figure 8 This is the Pareto optimal frontier graph in Experiment 1;

[0092] Fig. 9 This is the data encoding structure diagram in the algorithm of Experiment 1;

[0093] Fig.10 is the number of coordination times of each site in the uplink and downlink directions in Test 1;

[0094] Fig.11 Output results for the three objectives of the two schedules under the Monte Carlo simulation in Experiment 1;

[0095] Fig.12 is the maximum number of vehicles in the power supply network segment under the Monte Carlo simulation in Experiment 1. DETAILED DESCRIPTION

[0096] Specific implementation method 1: This implementation method is a robust control method for multi-line coordination of dual-source trolleybuses, which is specifically carried out in the following steps:

[0097] Step 1: Select the dual-source trolleybus line to build a line network, and establish the attribute set of each traffic node in the network to store the line and traffic node information;

[0098] The attribute set of each traffic node includes the starting station, the terminal station, the common station, the non-common station, the number and location of automatic catchers, the number and location of closing devices, the number and location of power supply network segments, and the distribution and length of disconnected lines.

[0099] Step 2: According to the control period, establish a train operation status set to store train operation information;

[0100] The train operation status includes the number of up and down train departures on each line during the control period, the vehicle travel path, the departure frequency range, the planned departure interval, the initial departure schedule and the arrival time;

[0101] Step 3: Collect the AVL data within the control period of a certain period, calculate the travel time of the adjacent stations, round it off in minutes, and include it in the travel time set of the adjacent stations, and obtain an integer set of the travel time of the adjacent stations with upper and lower bounds;

[0102] Step 4: Using the IC card and QR code data on the dual-source trolleybus, collect the boarding passenger data at each station during the same control period, and calculate the average passenger arrival rate at each station on each route;

[0103] Step 5: Focus on the operating characteristics of dual-source trolleybuses and build a robust optimization model for multi-line coordination of dual-source trolleybus timetables:

[0104] A few notes before building the model:

[0105] 1) The present invention considers that the departure frequency of a route is determined according to the maximum passenger flow section of the route, so the vehicle carrying capacity can meet the passenger flow demand during peak hours;

[0106] 2) It is believed that the power supply facilities and contact wire network devices of the dual-source trolleybus are operating normally and the vehicle is in good condition;

[0107] 3) It is assumed that each line is equipped with the same dual-source trolleybus model, and the vehicle will stop at every station;

[0108] 4) It is considered that the power output of the contact line network is stable and the power of each power supply network segment is the same;

[0109] 1. Vehicle motion equation part

[0110] The volatility of vehicle travel time is generally manifested as random characteristics caused by the time-varying characteristics and road conditions at different time periods;

[0111]

[0112] Formula (1) represents the time when the nth vehicle on line l arrives at station b Equal to the time of leaving station b-1 Add the travel time between stops Where r represents the direction of the route, a represents arrival, and d represents departure;

[0113]

[0114] Formula (2) represents the time when the nth vehicle on line l leaves station b Equal to the time of arrival at station b Add the time spent at the station

[0115] The stop time of a vehicle at a station is mainly affected by the number of passengers getting on and off the station and presents fluctuations. Since the time for passengers to get off the station is shorter than the time for getting on the station, it can be considered that the stop time at the station is mainly composed of the time for passengers to get on the station and the time for the vehicle to open and close the doors. Assuming that the arrival of passengers follows a uniform distribution (that is, the number of people arriving at station b per unit time is constant, and as soon as the last train leaves station b, another passenger arrives at station b. As time goes by, the number of passengers continues to accumulate until the next train arrives at station b and takes all of them on board. Therefore, the stop time is related to the interval between two adjacent trains on the line), then the stop time at the station is related to the headway time of adjacent trains, see formula (3):

[0116]

[0117] Among them, t0 is the time required for the vehicle to open and close the door, γ lb is the passenger arrival rate at station b on line l, β is the average boarding time of each passenger;

[0118] Integrating formulas (1) and (2) yields formula (4), which represents the time of arrival at station b: Equal to departure time Add the travel time of each section before station b Stop times at each station

[0119]

[0120] The calculation method of the time for the dual-source trolleybus to reach the automatic catcher, the closeer and the power supply network segment is the same as above;

[0121] 2. Objective Function

[0122] 1) Maximize the number of vehicle collaborations

[0123] Any common station in the overlapping section of the lines can be used for transfer, but in actual operation, passengers generally only choose the last transfer station for transfer, and the number of transfers at the remaining common stations is relatively small, which can be regarded as non-transfer stations; the coordination of the present invention not only includes coordinated transfer of passengers at transfer stations, but also includes coordinated entry of vehicles at non-common stations, and coordination time windows are set for transfer stations and non-transfer stations respectively, and finally the total number of coordination times is added up;

[0124] The time interval between vehicles arriving at the transfer station should not be too short or too long. The shortest interval is w b Passengers have enough time to transfer, and the longest interval W b This ensures that the waiting time for transfers will not be too long;

[0125]

[0126] In formula (5), if the time difference between train number n of line l and train number m of line j arriving at transfer station b is within the time window [w b ,W b ], the two trains are considered as coordinated transfer trains, and the binary variable It is recorded as 1, otherwise it is recorded as 0;

[0127] In order to avoid vehicle congestion at non-transfer stations, it is also necessary to set an arrival time window, with the shortest interval v b , the longest interval V b , if the time difference between train number n of line l and train number m of line j arriving at non-transfer station b is greater than v b , and is less than V b , then the two trains are regarded as coordinated trains entering the station, and the binary variable in formula (6) is used Determine whether the trains enter the station in a coordinated manner;

[0128]

[0129] Formula (7) represents the number of vehicle coordination between the upward transfer station and the non-transfer station, and the 1 on the subscript represents the upward direction; Formula (8) represents the number of vehicle coordination between the downward transfer station and the non-transfer station, and the 2 on the subscript represents the downward direction; Formula (9) represents the goal of maximizing the total number of coordination;

[0130]

[0131] maxF1=F 1 +F 2 (33)

[0132] 2) Minimize the size of the fleet

[0133] The minimum number of vehicles required to complete all train tasks is equal to the sum of the maximum deficit values ​​of each station. Based on practice, the first and last stations of the line are used as dual-source trolleybus stations. The maximum deficit function is calculated for each station and summed to obtain the minimum fleet size.

[0134] Formulas (10)-(12) represent the process of calculating the fleet size using the deficit function, where T1 and T2 are the start and end times of the control period. Indicates that at time t, the nth train of line l has departed from station d; SD l,t represents the number of vehicles dispatched from station d up to time t; Indicates that at time t, the nth train on line l has arrived at station d, ED l,t represents the number of vehicles arriving at station d by time t, max(SD l,t -ED l,t ) represents the maximum deficit function of station d;

[0135]

[0136] 3) Minimize the headway deviation

[0137] Headway is the time difference between the front ends of two vehicles passing the same place. When the headway of a line is small, more vehicles will gather in the same power supply network segment, the line network load will be high, and vehicles may be stranded. When the headway is large, fewer vehicles will gather in the same power supply network segment, causing idle power in the line network. If the deviation between the actual headway and the planned headway can be reduced and the headway can be made more uniform, it can avoid vehicle congestion and improve the utilization rate of electric energy. In addition, a smaller headway deviation can also improve the regularity of vehicle operation services.

[0138] Therefore, the present invention selects two types of nodes prone to congestion, common sites and automatic catchers, to analyze the headway deviation; the line departure frequency has been determined in the frequency setting stage, and the planned headway is calculated. h l,n,b is the headway time of the vehicle at station b, h l,n,a is the headway of the vehicle at the automatic catcher a;

[0139] Formula (13) represents the average headway deviation of all stations;

[0140]

[0141] Formula (14) represents the average headway deviation at all automatic catchers;

[0142]

[0143] Formula (15) expresses the goal of minimizing the average headway deviation.

[0144] minF3=F a +F b (39)

[0145] 3. Constraints

[0146] 1) Departure interval constraints

[0147] In order to balance the bus service level and bus company revenue, constraint formulas (16)-(18) indicate that all buses on the route must meet the departure interval requirements. and are the minimum departure interval and the maximum departure interval of line l respectively; the departure time is T1 is the start time of the control period, and T2 is the end time of the control period; is the time when the first vehicle is dispatched on route l in direction r;

[0148]

[0149] 2) Operating device constraints

[0150] Constraint (19) indicates that the dual-source trolleybus needs to stop and raise the bar under the automatic catcher a. To avoid congestion caused by the simultaneous arrival of subsequent vehicles, a minimum arrival interval w is set. a ;

[0151]

[0152] Constraint (20) indicates that in order to avoid the two-source trolleybuses arriving at the combiner c at the same time, a minimum arrival interval w is also required. c ;

[0153]

[0154] 3) Power supply network segment carrying capacity constraints

[0155] Constraint (21) requires that the maximum number of vehicles DK in each segment is less than the maximum number of vehicles Q1 that the segment can carry. The value of Q1 should take into account the charging and air conditioning power of the vehicle, and the ratio of the number of controlled routes to the actual number of routes in the section.

[0156] DK≤Q1 (45)

[0157] Formulas (22)-(24) use the inverse difference function to express the maximum number of vehicles DK in the power supply network segment k, where sK l,n,t =1 means that at time t, train number n on line l has left segment k, eK l,n,t =1 means that train number n of line l has arrived at segment k; SK l,t With EK l,t They represent the number of vehicles that have left and arrived at segment k by time t respectively;

[0158]

[0159] 4) Speed ​​constraints on off-line sections

[0160] The dual-source trolleybus is driven by the on-board lithium battery in the off-line section. If the vehicle has low energy consumption in the off-line section, it is not only economical and energy-saving, but also can reduce the battery discharge depth and extend the battery life. In addition, compared with the vehicles that have just left the factory, the battery capacity of the vehicles that have been in operation for many years has greatly decayed. Reducing energy consumption can also reduce the risk of insufficient energy supply during off-line driving. The energy consumption test of the dual-source trolleybus shows that the energy consumption is low when the average speed of the vehicle is maintained in the range of 20km / h to 30km / h. Therefore, constraint formula (25) requires that the average driving speed of the vehicle in the off-line section is In the range of 20km / h to 30km / h:

[0161]

[0162] 3. Model integration

[0163] In order to reduce the impact of fluctuations in the travel time and stop time of dual-source trolleybuses on the interests of bus companies and passengers, and to seek a timetable that can perform well even in a dynamic environment, the present invention establishes a multi-objective robust optimization model and transforms the three objective functions into the form of a minimax problem:

[0164]

[0165] Step 6: Design a multi-objective minimum-maximum differential evolution algorithm to solve the problem according to the characteristics of the model: The present invention solves the multi-objective minimum-maximum optimization problem, combines the minimum-maximum differential evolution algorithm with the fast non-dominated sorting algorithm and the crowding distance algorithm, uses the penalty function to transform the constrained problem into an unconstrained problem, improves the mutation strategy, and proposes a multi-objective minimum-maximum differential evolution algorithm. The algorithm flow chart is shown in Figure 5 ;

[0166] Step 7: The algorithm generates Pareto solutions, selects the optimal solution, and outputs a robust schedule.

[0167] Specific implementation method 2: This implementation method is different from specific implementation method 1 in that the common site described in step 1 includes a transfer site and a non-transfer site. The rest is the same as specific implementation method 1.

[0168] Specific implementation method three: This implementation method is different from specific implementation method one or two in that the method for calculating the average passenger arrival rate at each station of each route in step four is to screen the card and code swiping data of passengers boarding at each station during the control period, and add up and take the average value to obtain the average passenger arrival rate at the station. Others are the same as specific implementation method one or two.

[0169] Specific implementation method 4: This implementation method is different from the specific implementation methods 1 to 3 in that the constraint formulas (16) to (21) and formula (25) in the constraint part also meet the following requirements:

[0170]

[0171] t∈[T1,T2](26).

[0172] The rest is the same as one of the specific implementation modes 1 to 3.

[0173] Specific implementation method 5: This implementation method is different from specific implementation method 4 in that the best solution is selected in step 7, which is to select a solution that is in line with the interests of the bus company or the passenger. The rest is the same as specific implementation method 4.

[0174] The present invention is verified by the following tests:

[0175] Experiment 1: This experiment is a robust control method for multi-line coordination of dual-source trolleybuses, which is carried out in the following steps:

[0176] The network is formed by Beijing's dual-source trolleybus routes 101, 102, 103 and 106. Figure 6 This is a schematic diagram of the upward direction of the dual-source trolleybus line. Figure 7The following is a schematic diagram of the down direction of the dual-source trolleybus line. There are 37 common stations on the four lines, 13 of which are located on three lines and 24 on two lines. Taking the morning peak of 7:00am-9:00am on December 20, 2021 as the control period, the initial timetable in Table 1 is optimized. The departure interval range and planned departure interval of the line are shown in Table 2. The number of trains in the original departure plan remains unchanged during the optimization process.

[0177] Table 1 Initial timetable

[0178]

[0179] Table 2 Range of departure intervals for lines during control period

[0180]

[0181] In order to obtain the travel time of the dual-source trolleybus between each station, 43,079 automatic vehicle positioning (AVL) data were collected during the 7:00am-9:00am period of 23 working days in the previous month. After rounding, the uncertain data set of the travel time between each station was obtained, as shown in Table 3. The upper and lower limits of the travel time in the table are integers, and the step size of the fluctuation is 1 minute. The unit in the bracket is minute, the left side of the bracket is the minimum travel time between two adjacent stations, and the right side of the bracket is the maximum travel time between two stations.

[0182] Table 3 Travel data between stations on each line

[0183]

[0184] The dual-source trolleybus is equipped with a GPS device and an automatic ticketing system. Passengers need to swipe an integrated circuit card or scan a QR code when getting on or off the bus in order to record the number of passengers and the time when the passengers arrive at or leave the station. The passenger boarding data during the control period on weekdays in the previous month was obtained through the IC card and QR code data, and the average passenger arrival rate at each station (excluding the first and last stations) on each route was calculated, see Table 4.

[0185] Table 4 Passenger arrival rate γ (pax / min) at each line station during the control period

[0186]

[0187] Apply the algorithm to optimize the model and obtain the Pareto optimal frontier such as Figure 8As shown. Decision makers need to select the final solution from multiple Pareto optimal solutions. From the perspective of the bus company, the fleet size determines the vehicle purchase cost. Therefore, the fleet size target takes precedence over the coordination times and headway deviation targets. Comparing the Pareto optimal solutions, the solution with the smallest fleet size is selected as the optimal solution, and the robust schedule in Table 5 is obtained. The specific algorithm process is as follows:

[0188] Algorithm Design

[0189] The established model is a mixed integer nonlinear programming model, which belongs to the Minimax optimization problem. It aims to find a solution with good performance in the worst scenario, which is difficult to solve using mathematical analytical methods. Minimax Differential Evolution (MMDE) algorithm is an emerging algorithm improved from the differential evolution algorithm. It avoids excessive search for the worst objective function of uncertain variables. In a single evolutionary algebra, the bottom lifting strategy and partial regeneration strategy are respectively adopted for decision variables and uncertain variables, so that they evolve in the direction that meets their optimization goals at the same time. The present invention aims to solve the multi-objective minimum and maximum optimization problem. Therefore, the MMDE algorithm is combined with the fast non-dominated sorting algorithm and the crowding distance algorithm, and the penalty function is used to transform the constrained problem into an unconstrained problem. The mutation strategy is improved, and a multi-objective minimum and maximum differential evolution algorithm (MO-MMDE) is proposed.

[0190] 1Encoding and initialization

[0191] like Fig. 9 As shown in Figure 1, the individuals in the population include a pair of solutions and operating scenarios. Therefore, the encoding of individuals is divided into the encoding of decision variables and the encoding of uncertain variables, both of which are encoded using integers. In order to reduce constraints, the decision variables are changed from departure time to Convert to departure interval As the individual genetic information, the departure interval constraints (16) and (17) are satisfied at the initialization stage. It should be noted that this paper only encodes the travel time among the uncertain variables, because the stop time in formula (3) changes with the headway of the station and cannot be directly encoded, but the stop time in the algorithm can be calculated by formula (3).

[0192] Each individual is divided into two directions, up and down, which are composed of the departure intervals of all trains on each line during the control period. When the final solution is obtained, the departure schedule can be obtained by adding the starting time to the obtained departure interval plan. The decision variables and uncertain variables are arbitrarily encoded within their value range, thereby completing the initialization of individuals in the population.

[0193] 2 Fitness Function and Fast Non-Dominated Sorting

[0194] Under the combination of driving time and stop time, the individuals in the population calculate the inverse of the number of coordinated operation of the dual-source trolleybus fleet, the fleet size, and the vehicle headway deviation as the individual fitness function, see formula (27). The smaller the fitness value, the better the individual performance.

[0195]

[0196] The present invention incorporates the penalty function into the fast non-dominated sorting algorithm, and sorts the individuals according to the size of the individual fitness value in the population and the number of violations of the constraint (see the next part). First, based on the fitness value of the individual, the preliminary sorting of the individual is obtained, and the individual violating the constraint is punished, and its sorting is increased to obtain the final sorting of the individual, and the Pareto minimum heap (PMH) is constructed. The Pareto minimum heap is improved from the minimum heap (MH) in the MMDE algorithm, and the sorted solution set is arranged according to the Pareto front level. Assuming that there are M Pareto front levels, the solution set with a Pareto front level of 1 is placed at the root node of the Pareto minimum heap, and after being placed in turn, the last node corresponds to the Pareto front solution set with a Pareto front level of M. The main feature of the Pareto minimum heap is that the individuals in the population are arranged from high to low according to the non-dominated sorting, and each individual is located in a node, and the individual with the highest non-dominated sorting is placed on the root node.

[0197] 3 Penalty Function

[0198] The present invention adopts the penalty function method to convert the constrained problem into an unconstrained problem, and penalizes the infeasible solution by increasing its non-dominated sorting, thereby realizing intelligent search of the solution space. The penalty function of the departure interval constraint is formula (28) and (29), the penalty function of the contact line network operation device constraint is formula (30) and (31), the penalty function of the power supply network segment carrying capacity constraint is formula (32), and the penalty function of the off-line section energy consumption constraint is shown in formula (33) and (34). It should be noted that the departure interval constraints (16) and (17) have been satisfied in the population initialization stage, and the role of the coordination constraints (19) and (20) is to count the number of coordination times, so the constraints of these two types are not considered. Assuming that the penalty intensity of the above three types of constraints is the same during the calculation process, formula (35) uses the parameter P r represents the penalty state of the constraint condition. Therefore, the final non-dominated sorting p' rank See formula (36).

[0199]

[0200] Pe3=DK-Q1 (32)

[0201] Pe4=2s off -t off (33)

[0202] Pe5=t off -3s off (34)

[0203]

[0204] 4Multi-target bottom-up strategy

[0205] The core idea of ​​the multi-objective bottom-up strategy is to adaptively mutate, crossover, and comprehensively select uncertain variables so that they evolve toward the maximum direction of the objective function and seek the worst operating condition. In each bottom-up, K NF1 individuals in the root node are subjected to s NF1 update of uncertain variables. If the newly generated uncertain variables make the individual objective function evolve in the direction of increase, then this uncertain variable replaces the root node uncertain variable. The pseudo code of the multi-objective bottom lifting strategy is shown in Algorithm 3. The improved differential evolution operation is as follows.

[0206] (1) Improved DE / rand / 1 mutation strategy. In formula (37), the individual with the largest crowding distance in the root node is used as the optimal individual to guide the search direction, which accelerates the convergence of the algorithm. Each parent generation has the opportunity to enter the offspring generation, and different non-parent individuals are randomly selected from the population to calculate the difference vector to maintain the diversity of the population. Among them, r∈[0,1] is the greedy factor.

[0207] (2) Adaptive parameters are set. Formula (38) indicates that the adaptive parameters are adjusted with the evolutionary generations. In the early stage, the convergence speed should be accelerated, global search should be emphasized, the mutation operator F and the crossover operator CR should be large, and the greed factor r should be small. In the later stage, better distribution should be obtained, local search should be performed at the optimal point to avoid the destruction of the optimal solution. The values ​​of F and CR should be reduced, and the value of r should be increased. Among them, G represents the maximum evolutionary generation, and g represents the current evolutionary generation.

[0208] (3) A comprehensive selection strategy is proposed to comprehensively compare the advantages and disadvantages of the two individuals based on their fitness, penalty function, and crowding distance priority, which is conducive to screening out potential optimal solutions when the two individuals do not dominate each other.

[0209]

[0210]

[0211] Algorithm 3

[0212] Pseudocode for the multi-objective bottom-lifting strategy

[0213]

[0214] 5 Multi-objective partial regeneration strategy

[0215] The core idea of ​​the multi-objective partial regeneration strategy is to optimize the decision variables under the worst operating conditions formed by the bottom lifting strategy to find the optimal solution. First, the decision variable values ​​of the first T individuals with small fitness values ​​in the Pareto minimum heap are assigned to the last T individuals in the population, so that they inherit the elite decision variables, and the elite decision variables are mutated and crossed. The uncertain variables in the last T individuals are randomly generated to increase the diversity of uncertain variables. This strategy performs DE / current / 1 mutation and binomial crossover on the decision variables. The setting of the adaptive parameters is shown in formula (38). The pseudo code of the multi-objective bottom lifting strategy is shown in Algorithm 4.

[0216] Algorithm 4

[0217] Pseudocode for the multi-objective partial regeneration strategy

[0218]

[0219]

[0220] 6 Overall algorithm process

[0221] The pseudo code of the MO-MMDE algorithm is shown in Algorithm 2. First, the parameters are set and the population is initialized, and the individual fitness and penalty function are calculated. At the beginning of each generation, the current population is quickly non-dominated sorted to construct a Pareto minimum heap. Based on the constructed minimum heap, a multi-objective bottom-lifting scheme is executed to update the uncertain variables, and the individuals in the root node are continuously extracted from the Pareto minimum heap as the Pareto optimal solution. Finally, the partial regeneration strategy is used to update the decision variables, and then the next generation of evolution is continued. When the maximum evolutionary generation G is reached, the optimization process is terminated, the Pareto optimal optimal solution set is output, and the algorithm ends.

[0222] Algorithm 2

[0223] Pseudocode of MO-MMME algorithm

[0224]

[0225] Table 5 Robust schedule

[0226]

[0227] In order to explore the performance of the original planned schedule and the robust schedule under the worst operating conditions, the two schedules are input as fixed parameters of the algorithm, and the other parameters remain unchanged. Only the bottom-up strategy is implemented for the uncertain variables. When the decision variables are determined, the uncertain variables are updated to find the worst operating condition of the schedule, so as to compare the robustness of the two schedules in adapting to the worst operating conditions.

[0228] Fig.10The coordination times of stations under the worst operating conditions when using the initial schedule and the robust schedule are given. Fig.10 (a) shows that when the robust schedule is used in the uplink direction, the number of coordinations of each site is higher than that in the initial schedule, and the total number of coordinations increases from 142 to 168, an increase of 18.31%. Among them, the optimization effect of the common sites b6-b11 located on the three lines is more significant. Fig.10 (b) shows that when the robust schedule is used in the downlink direction, the number of cooperations of most sites is significantly higher than that in the initial schedule, and the total number of cooperations increases from 147 to 158, an increase of 7.49%.

[0229] Table 6 lists the headway deviations of each station in the up and down directions under the worst operating conditions. Compared with the original timetable, the headway deviation under the robust timetable changes more smoothly and is always smaller than the deviation of the original timetable. After applying the robust timetable, the average deviation in the up direction decreased from 2.531min to 2.287min, an improvement of 9.64%; the average deviation in the down direction decreased from 1.478min to 1.218min, an improvement of 17.59%.

[0230] Table 6 Headway deviation of each station in the up and down directions

[0231]

[0232] Combined with the coordination performance and headway deviation performance under the worst operating conditions, we continue to explore the congestion of vehicles at common stations, automatic catchers, and combiners. Car stringing includes single-line stringing and multi-line stringing, which not only affects the regularity of dual-source trolleybus service, but also causes the contact network to trigger power outages, increasing the risk of vehicle breakdown. The reason for the stringing is that the headway of vehicles in the line network at the traffic nodes is very small. After actual observation, it is easy for dual-source trolleybuses to string together when the interval at which they arrive at the station is less than 30s. Therefore, the present invention assumes that if the arrival interval of the vehicle at the station is less than 30s, it can be regarded as a stringing phenomenon, and the arrival interval at the combiner is less than 10s and the arrival interval at the automatic catcher is less than 20s, which is also considered a stringing phenomenon.

[0233] Table 7 lists the number of vehicle crossovers at stations, automatic catchers, and combiners under the worst operating conditions. Under the robust schedule, the number of vehicle crossovers at the three types of traffic nodes is less than that under the initial schedule, which reduces the risk of queuing congestion and vehicle parking to a certain extent. This is also an indirect reflection of the robust schedule to achieve vehicle operation regularity and operation coordination. Specifically, the optimization effect of the upward and downward directions is roughly the same. The number of vehicle crossovers at common stations, automatic catchers, and combiners in the upward direction is reduced by 14.41%, 35.42%, and 29.51%, respectively; the number of vehicle crossovers at common stations, automatic catchers, and combiners in the downward direction is reduced by 11.58%, 29.09%, and 33.33%, respectively.

[0234] Table 7 Number of vehicles in series at each traffic node

[0235]

[0236] To verify that the robust schedule also has good performance in practice, the two types of schedules are placed under uncertain parameters and the target output range and constraint violation degree are compared. Based on the driving time dataset, the Monte Carlo method is used to randomly sample the driving time 3000 times, and the output sets of the three targets are obtained, which are displayed in turn. Fig.11 In each box, the red line is the median, the edges of the box are the 25th and 75th percentiles, the whiskers extend to the largest and smallest data points, and outliers are marked with single points. Fig.11 In (a), the median value of the coordination number target under the robust schedule is improved by 6.43% compared with the initial schedule, and the maximum value is improved by 7.94%. Fig.11 In (b), the median and maximum values ​​of the fleet size target are reduced by 2.67% and 7.59% respectively compared with the initial schedule. Fig.11 The median and maximum values ​​of the headway deviation in (c) are reduced by 4.65% and 7.18% respectively. It can be seen that the robust schedule has a more obvious advantage than the initial schedule in terms of both average and worst performance under the condition of driving time fluctuations. Moreover, in some extreme cases, the robust schedule can obtain extremely good minimum values. For example, the maximum number of coordination times in the first goal reaches 432 times, and the minimum fleet size in the second goal is only 70. In addition, Fig.11 (b) shows that the output of the fleet size is more concentrated under the robust schedule, which verifies that the robust schedule can make the output of the target more stable in a dynamic environment.

[0237] Taking the power supply network segment carrying capacity constraint as an example to analyze the degree of constraint violation, when the number of vehicles in the segment is greater than 6, there may be a risk of vehicle stalling. The k1 segment in the upward direction and the k2 segment in the downward direction at the intersection of the lines are selected as the control objects, because there are more vehicles concentrated in the segment after the line intersection, and the risk of stalling increases. The Monte Carlo method is used to simulate 3000 times, and the frequency distribution histogram of the maximum number of vehicles in the power supply network segment of the two timetables is obtained, see Fig.12 . Fig.12 The maximum number of vehicles in the k1 segment under both timetables in (a) does not exceed 6. This may be because the fluctuation range of the arrival time of vehicles in the upward direction is large, and the possibility of a large number of vehicles gathering in the k1 segment at the same time is small. Fig.12 In (b), there are 129 scenarios with more than 6 vehicles in the k2 segment under the initial schedule, and the percentage of scenarios violating the constraints is 4.3%. However, there are only 43 scenarios with more than 6 vehicles under the robust schedule, and the percentage of scenarios violating the constraints is 1.43%. This indicates that the violation of the segment carrying capacity constraints is less under the robust schedule, and the vehicle operation is safer and more reliable.

[0238] The present invention can help bus companies compile highly robust coordinated timetables under the conditions of fluctuations in travel time and stop time. Compared with the initial timetable, the robust timetable output by the model has a more stable target output under the worst operating conditions, reducing the risk of vehicle congestion. Using the Monte Carlo method to simulate the simulation environment, the number of coordinated times, fleet size, and headway deviation achieved optimization effects of 6.43%, 2.67%, and 4.65%, respectively. Therefore, the present invention can effectively reduce the impact of the dynamic environment on the coordination and service regularity of vehicle operation, and improve the robustness of the static scheduling plan.

Claims

1. A robust control method for multi-line coordination of dual-source trolleybuses, characterized in that The robust control method for multi-line coordination of dual-source trolleybuses is carried out in the following steps: Step 1: Select the dual-source trolleybus line to build a line network, and establish the attribute set of each traffic node in the network to store the line and traffic node information; The attribute set of each traffic node includes the starting station, the terminal station, the common station, the non-common station, the number and location of automatic catchers, the number and location of closing devices, the number and location of power supply network segments, and the distribution and length of disconnected lines. Common sites include transfer sites and non-transfer sites; Step 2: According to the time period to be controlled, establish a train operation status set to store train operation information; The train operation status includes the number of up and down train departures on each line during the control period, the vehicle travel path, the departure frequency range, the planned departure interval, the initial departure schedule and the arrival time; Step 3: Collect the AVL data during the control period in the previous month, calculate the travel time of the adjacent sites, round it off to the nearest integer in minutes, and include it in the travel time set of the adjacent sites, thus obtaining an integer set of the travel time of the adjacent sites with upper and lower bounds; Step 4: Using the IC card and QR code data on the dual-source trolleybus, collect the boarding passenger data of each station during the control period in the previous month, and calculate the average passenger arrival rate of each station on each route; Step 5: Focus on the operating characteristics of dual-source trolleybuses and build a robust optimization model for multi-line coordination of dual-source trolleybus timetables:

1. Determine the objective function 1) Maximize the number of vehicle collaborations Passengers choose to transfer at the last transferable station, and the remaining common stations are regarded as non-transfer stations; coordination time windows are set for transfer stations and non-transfer stations respectively, and the total number of coordination times is finally added up; The shortest interval w between vehicles arriving at the transfer station b Passengers have enough time to transfer, and the longest interval W b The waiting time for transfer is not too long. If the time difference between train number n of line l and train number m of line j at transfer station b is within the time window [w b ,W b ], the two trains are considered as coordinated transfer trains, and the binary variable It is recorded as 1, otherwise it is recorded as 0; represents the time when the nth vehicle on line l arrives at station b, represents the time when the mth vehicle on route j arrives at station b; In order to avoid vehicle congestion at non-transfer stations, it is also necessary to set an arrival time window, with the shortest interval v b , the longest interval V b , if the time difference between train number n of line l and train number m of line j arriving at non-transfer station b is greater than v b , and is less than V b , then the two trains are regarded as coordinated trains entering the station, and the binary variable in formula (2) is used Determine whether the trains enter the station in a coordinated manner; Formula (3) represents the number of vehicle coordination between the upward transfer station and the non-transfer station, and the 1 on the superscript represents the upward direction; Formula (4) represents the number of vehicle coordination between the downward transfer station and the non-transfer station, and the 2 on the superscript represents the downward direction; Formula (5) represents the goal of maximizing the total number of coordination; maxF1=F 1 +F 2 (5) 2) Minimize the size of the fleet The minimum number of vehicles required to complete all trips is equal to the sum of the maximum deficit values ​​of each station. The first and last stations of the line are taken as the dual-source trolleybus stations. The maximum deficit function is calculated for each station and summed to obtain the minimum fleet size. Formulas (6)-(8) represent the process of calculating the fleet size using the deficit function, where T1 and T2 are the start and end times of the control period. Indicates that at time t, the nth train of line l has departed from station d; SD l,t represents the number of vehicles dispatched from station d up to time t; Indicates that at time t, the nth train on line l has arrived at station d, ED l,t represents the number of vehicles arriving at station d by time t, max(SD l,t -ED l,t ) represents the maximum deficit function of station d; 3) Minimize the headway deviation The present invention selects two types of nodes prone to congestion, common sites and automatic catchers, to analyze the headway deviation; the line departure frequency is determined in the frequency setting stage, and the planned headway is calculated. h l,n,b is the headway time of the vehicle at station b, h l,n,a is the headway of the vehicle at the automatic catcher a; Formula (9) represents the average headway deviation of all stations; Formula (10) represents the average headway deviation at all automatic catchers; Formula (11) expresses the goal of minimizing the average headway deviation. minF3=F a +F b (11) 2. The constraints include departure interval constraints, operating device constraints, power supply network segment carrying capacity constraints and off-line section speed constraints; 3. Determine the integration model In order to reduce the impact of the fluctuation of the travel time and stop time of dual-source trolleybuses on the interests of bus companies and passengers, a timetable that can perform well even in a dynamic environment is sought, a multi-objective robust optimization model is established, and the three objective functions are transformed into the form of a minimum-maximum problem: Step 6: Based on the vehicle driving constraints, the multi-objective minimum-maximum differential evolution algorithm is used to solve the minimum-maximum problem of the objective function transformation: it is required to solve the multi-objective minimum-maximum optimization problem, combine the minimum-maximum differential evolution algorithm with the fast non-dominated sorting algorithm and the crowding distance algorithm, use the penalty function to transform the constrained problem into an unconstrained problem, improve the mutation strategy, and propose a multi-objective minimum-maximum differential evolution algorithm; Step 7: The algorithm generates Pareto solutions, selects the optimal solution, and outputs a robust schedule.

2. A method for robust control of dual-source trolleybus multi-line coordination according to claim 1, characterized in that The method for calculating the average passenger arrival rate at each station on each route in step 4 is to screen the card and code swiping data of passengers boarding the bus at each station during the control period, add them up and take the average value to obtain the average passenger arrival rate of the station.

3. A method for robust control of dual-source trolleybus multi-line coordination according to claim 1, characterized in that In the robust optimization model of multi-line coordination of dual-source trolleybus timetable constructed in step 5, the time when the nth vehicle on line l arrives at station b is as follows: in The stop time at the station.

4. A method for robust control of dual-source trolleybus multi-line coordination according to claim 3, characterized in that The stop time at the station is shown in formula (12): Among them, t0 is the time required for the vehicle to open and close the door, γ lb is the passenger arrival rate at station b on line l, β is the average boarding time of each passenger; is the stop time at station b.

5. A method for robust control of dual-source trolleybus multi-line coordination according to claim 4, characterized in that The departure interval constraint is: and are the minimum departure interval and the maximum departure interval of line l respectively; the departure time is T1 is the start time of the control period, and T2 is the end time of the control period; is the time when the first vehicle is dispatched on route l in direction r.

6. A method for robust control of dual-source trolleybus multi-line coordination according to claim 5, characterized in that The operating device constraints are: Constraint (16) indicates that the dual-source trolleybus needs to stop and raise the bar under the automatic catcher a. To avoid congestion caused by the simultaneous arrival of subsequent vehicles, a minimum arrival interval w is set. a ; Constraint (17) indicates that in order to avoid the two-source trolleybuses arriving at the combiner c at the same time, a minimum arrival interval w is also required. c ; 7. A method for robust control of dual-source trolleybus multi-line coordination according to claim 6, characterized in that The power supply network segment carrying capacity constraint is: Constraint (18) requires that the maximum number of vehicles DK in each segment is less than the maximum number of vehicles Q1 that the segment can carry. The value of Q1 should take into account the charging and air conditioning power of the vehicle, and the ratio of the number of controlled routes to the actual number of routes in the section. DK≤Q1 (18) Formulas (19)-(21) use the inverse difference function to express the maximum number of vehicles DK in the power supply network segment k, where sK l,n,t =1 means that at time t, train number n on line l has left segment k, eK l,n,t =1 means that train number n of line l has arrived at segment k; SK l,t With EK l,t They represent the number of vehicles that have left and arrived at segment k by time t respectively; 8. A method for robust control of dual-source trolleybus multi-line coordination according to claim 7, characterized in that The speed constraint of the off-line section is: Average speed of vehicles on the off-line section In the range of 20km / h to 30km / h, see formula (22):

9. A method for robust control of dual-source trolleybus multi-line coordination according to claim 8, characterized in that In the constraint part, the constraint equations (13) to (18) and equation (22) must also meet the following requirements: t∈[T1,T2](23).

Citation Information

Patent Citations

  • A ground bus two-stage optimization scheduling method driven by mass operation data

    CN109886491A

  • Method for comprehensively optimizing urban and rural bus time table compiling and vehicle scheduling in districts

    CN110135755A

  • Method for designing routine urban public transit network

    WO2017045294A1

Cited By

  • Whole-flow logistics-energy combined dispatching method and system for seaport comprehensive energy system

    CN120746242A