A method for planning energy-saving bus speed and deploying dynamic wireless charging facilities

Through the collaborative optimization method of bus energy-saving speed planning and dynamic wireless charging facilities layout, the hybrid multi-objective artificial hummingbird algorithm is used to optimize the operating speed and charging facilities layout of bus fleets, which solves the problems of high energy consumption and high operating costs of the bus system, and realizes the problem of high energy consumption and high operational costs. Lower power consumption and layout costs.

CN118552008BActive Publication Date: 2024-11-12JILIN UNIVERSITY

Patent Information

Application Number
CN202411009076.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-07-26
Publication Date
2024-11-12
Estimated Expiration
2044-07-26

AI Technical Summary

Technical Problem

The existing method ignores the mutual influence between the energy-saving speed planning of bus fleets and the layout of dynamic wireless charging facilities, resulting in high energy consumption and high operating costs of bus systems.

Method used

A method of coordinated optimization of bus energy-saving speed planning and dynamic wireless charging facilities layout is adopted. Through the hybrid multi-objective artificial hummingbird algorithm, the location and length of dynamic wireless charging facilities, the number of inverters, the driving speed and stay of buses on bus lines are optimized. Time forms a better dynamic wireless charging facility layout plan and energy-saving speed curve.

Benefits of technology

It reduces the cost of laying dynamic wireless charging facilities in the bus system, saves the total daily power consumption of the bus fleet, and improves the operational efficiency and energy-saving performance of the bus system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118552008B_ABST
    Figure CN118552008B_ABST
Patent Text Reader

Abstract

A method for energy-saving speed planning and dynamic wireless charging facility layout of public transportation. The present invention belongs to the field of urban public transportation operation management, and specifically, a method for energy-saving speed planning and dynamic wireless charging facility layout of public transportation. The purpose of the present invention is to solve the problem that the existing method ignores the deficiency of mutual influence between energy-saving speed planning of bus fleets and dynamic wireless charging facility layout, resulting in high energy consumption and high operating costs of public transportation systems. The process is: basic data collection; definition of optimization variables of the model; construction of a collaborative optimization model of dynamic wireless charging facility layout and energy-saving speed curve of bus fleets; solving the collaborative optimization model of dynamic wireless charging facility layout and energy-saving speed curve of bus fleets based on a hybrid multi-objective artificial hummingbird algorithm, and outputting the speed matrix, travel time matrix, residence time matrix of the food source with the highest dominance level in the external archive, and the layout matrix of dynamic wireless charging facilities on the bus route as a Pareto solution set.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the field of urban public transportation operation management, and specifically relates to a method for public transportation energy-saving speed planning and dynamic wireless charging facility deployment. Background Art

[0002] In recent years, with the development of 5G networks, vehicle-to-vehicle wireless communications, and autonomous driving technologies, many cities have begun deploying autonomous electric buses (hereinafter referred to as "buses") to further enhance the service quality of public transportation systems. However, due to the limitations of onboard battery capacity, buses have a limited range, and frequent charging can significantly impact the normal operation of routes. There are generally two approaches to address this issue: one is to deploy dynamic wireless charging facilities on certain roads along which buses pass, enabling them to charge while driving, thereby increasing their range; the other is to implement optimized energy-saving speed profiles during operation to reduce operating energy consumption, which can also increase their range.

[0003] Existing methods for deploying dynamic wireless charging facilities typically use historical bus travel times as input to optimization models. However, when dynamic wireless charging facilities are deployed on bus routes, the bus's operating speed profile and travel time will change. For example, the bus's operating speed will be slowed down on sections with dynamic wireless charging facilities to obtain more charging capacity, while the bus's operating speed will be increased on sections without dynamic wireless charging facilities to ensure punctuality. There are significant differences in the operating status of buses before and after the deployment of dynamic wireless charging facilities. In this case, a dynamic wireless charging facility deployment plan based on historical travel times cannot achieve optimal operational efficiency and energy-saving performance for the bus system.

[0004] In fact, the layout of dynamic wireless charging facilities and the planning of bus speed curves have a mutual impact. On the one hand, the dynamic wireless charging facility layout plan will affect the operating speed of the bus on the route; on the other hand, changes in the speed curve will affect the battery state of charge and operating energy consumption of the bus, thereby affecting the layout plan of the dynamic wireless charging facilities. Only by co-optimizing the two can a more reasonable dynamic wireless charging facility layout plan and bus energy-saving speed curve be generated, thereby reducing the operating energy consumption of the bus system and reducing operating costs. To this end, the present invention proposes a method for co-optimizing the energy-saving speed planning of autonomous electric buses and the layout of dynamic wireless charging facilities. Summary of the Invention

[0005] The purpose of the present invention is to solve the problem that the existing methods ignore the mutual influence between the energy-saving speed planning of bus fleets and the layout of dynamic wireless charging facilities, resulting in high energy consumption and high operating costs of the bus system, and propose a method for energy-saving speed planning of buses and dynamic wireless charging facility layout.

[0006] A method for planning energy-saving bus speed and deploying dynamic wireless charging facilities is as follows:

[0007] Step 1. Basic data collection; the specific process is as follows:

[0008] Step 1.1. Divide the bus route into H segments according to the end location of the bus station and the location of the intersection stop line. Record the distance from the starting location of each segment to the departure station, which is recorded as , in meters, ;

[0009] Step 1.2. Let Characterizes the attributes of the start node of segment h;

[0010] when When , it means that the starting node of segment h is the site;

[0011] when When , it means that the starting node of segment h is an intersection;

[0012] Step 1.3. Measure the average road slope in each section of the bus route and record it as , The unit is degree;

[0013] Step 1.4. Use b to represent the bus number, and B to represent the total number of bus trips during the daily operating hours. ;

[0014] Query the departure timetable and record the scheduled departure time of all buses at the starting station during the bus line's full-day operation time. The scheduled departure time of bus B at the starting station is recorded as ;

[0015] Step 1.5. Query the driving schedule to determine the matching relationship between the bus fleet and the bus schedule, denoted as ;

[0016] when When , bus trip b is operated by bus k;

[0017] when When bus k takes the bus route b, ;

[0018] Where K represents the number of buses in the bus fleet;

[0019] Step 1.6. Count the boarding and alighting times of passengers at each stop for each bus during the whole day’s operation. The boarding and alighting times of passengers at section h for bus b are calculated as follows: Indicates that the unit is seconds;

[0020] Step 1.7. Record the cycle duration (in seconds) of each signalized intersection along the bus route during the entire day's operating hours; the bus phase green light onset time and green light duration (in seconds) for each cycle;

[0021] Step 1.8. Query bus model information; the specific process is as follows:

[0022] make Indicates the rated battery capacity of bus k, in kilowatt-hours; Indicates the upper limit of battery charging for bus k, in %; Indicates the lower limit of battery discharge for bus k, in %; Indicates the curb mass of bus k, in kilograms; Indicates the front windshield area of ​​the vehicle in square meters; Indicates the efficiency of the transmission system, unit is %; Indicates battery efficiency, unit is %; and They represent the driving efficiency and braking efficiency of the motor respectively, and the unit is %;

[0023] Step 1.9. Query dynamic wireless charging facility parameters;

[0024] make represents the charging power of bus k, in watts; Indicates the purchase cost of the transmitting coil per unit length, in yuan / meter. Indicates the purchase cost of a single inverter, in RMB per unit;

[0025] Step 2. Define the optimization variables of the collaborative optimization model of dynamic wireless charging facility deployment and bus fleet energy-saving speed curve;

[0026] Step 3. Construct a collaborative optimization model for dynamic wireless charging facility deployment and bus fleet energy-saving speed curve;

[0027] Step 4. Solve the collaborative optimization model of dynamic wireless charging facility layout and bus fleet energy-saving speed curve based on the hybrid multi-objective artificial hummingbird algorithm. Output the speed matrix, travel time matrix, and dwell time matrix of the food source with the highest dominance in the external archive, as well as the layout matrix of dynamic wireless charging facilities on the bus route as the Pareto solution set.

[0028] The beneficial effects of the present invention are:

[0029] This invention takes an autonomous driving electric bus system with a dedicated bus lane as the research object;

[0030] Based on the premise of ensuring the normal operation of the bus route, this paper establishes a dual-objective mixed-integer nonlinear programming model to collaboratively optimize the location and length of the transmitting coils of dynamic wireless charging facilities along the bus route, the number of inverters, the initial speed, final speed, travel time of each bus in each driving phase, and the dwell time at each station and intersection. A hybrid multi-objective artificial hummingbird algorithm is also proposed to solve the collaborative optimization model. Based on the application of the traditional multi-objective artificial hummingbird algorithm to search and update the bus driving speed curve, an alternative pool update strategy is mixed to find a more optimal dynamic wireless charging facility deployment plan. This can not only reduce the cost of deploying dynamic wireless charging facilities within the bus system, but also save the total daily power consumption of the bus fleet. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] Figure 1 It is a flow chart of the present invention. DETAILED DESCRIPTION

[0032] Specific embodiment 1: This embodiment is a method for planning energy-saving bus speed and deploying dynamic wireless charging facilities

[0033] The specific process is:

[0034] This invention takes an autonomous driving electric bus system with a dedicated bus lane as the research object;

[0035] Step 1. Basic data collection; the specific process is as follows:

[0036] Step 1.1. Divide the bus route (differentiated between up and down) into H segments based on the end locations of the stops and the stop lines at the intersections. (If there are 5 stops and 5 intersections on the up route, there are 9 segments between them. The up and down routes are considered different stops, as are the intersections. There is also a segment between the up route terminal and the down route starting station, for a total of 19 segments. Stops and intersections cannot be completely considered as a single point. They have a certain spatial length, so the end location of the stop and the stop line at the intersection are used as the actual dividing points.) Record the distance from the starting point of each segment to the starting station, recorded as , in meters, ;

[0037] Step 1.2. Let Characterizes the attributes of the start node of segment h;

[0038] when When , it means that the starting node of segment h is the site;

[0039] when When , it means that the starting node of segment h is an intersection;

[0040] Step 1.3. Measure the average road slope in each section of the bus route and record it as , The unit is degree;

[0041] Step 1.4. Use b to represent the bus number, and B to represent the total number of bus trips during the daily operating hours. ;

[0042] Query the departure timetable and record the scheduled departure time of all buses at the starting station during the bus line's full-day operation time. The scheduled departure time of bus B at the starting station is recorded as ;

[0043] Step 1.5. Query the driving schedule to determine the matching relationship between the bus fleet and the bus schedule, denoted as ;

[0044] when When , bus trip b is operated by bus k;

[0045] when When bus k takes the bus route b, ;

[0046] Where K represents the number of buses in the bus fleet;

[0047] Step 1.6. Count the number of stations for each shift during the entire day's operation (when The time for passengers to get on and off the bus (including the time required for the doors to open and close) is 1 hour. The time for passengers to get on and off the bus of bus number b in section h is 1 hour. Indicates that the unit is seconds;

[0048] Step 1.7. Record the cycle duration (in seconds) of each signalized intersection along the bus route during the entire day's operating hours; the bus phase green light onset time and green light duration (in seconds) for each cycle;

[0049] Step 1.8. Query bus model information; the specific process is as follows:

[0050] make Indicates the rated battery capacity of bus k, in kilowatt-hours; Indicates the upper limit of battery charging for bus k, in %; Indicates the lower limit of battery discharge for bus k, in %; Indicates the curb mass of bus k, in kilograms; Indicates the front windshield area of ​​the vehicle in square meters; Indicates the efficiency of the transmission system, unit is %; Indicates battery efficiency, unit is %; and They represent the driving efficiency and braking efficiency of the motor respectively, and the unit is %;

[0051] Step 1.9. Query dynamic wireless charging facility parameters;

[0052] make represents the charging power of bus k, in watts; Indicates the purchase cost of the transmitting coil per unit length, in yuan / meter. Indicates the purchase cost of a single inverter, in RMB per unit;

[0053] Step 2. Define the optimization variables of the collaborative optimization model of dynamic wireless charging facility deployment and bus fleet energy-saving speed curve;

[0054] Step 3. Construct a collaborative optimization model for the dynamic wireless charging facility deployment and the bus fleet energy-saving speed curve (the collaborative optimization model is a dual-objective mixed-integer nonlinear programming model).

[0055] Step 4. Solve the collaborative optimization model of dynamic wireless charging facility layout and bus fleet energy-saving speed curve based on the hybrid multi-objective artificial hummingbird algorithm. Output the speed matrix, travel time matrix, and dwell time matrix of the food source with the highest dominance in the external archive, as well as the layout matrix of dynamic wireless charging facilities on the bus route as the Pareto solution set.

[0056] Specific embodiment 2: This embodiment differs from specific embodiment 1 in that the optimization variables of the collaborative optimization model of dynamic wireless charging facility deployment and bus fleet energy-saving speed curve are defined in step 2;

[0057] The specific process is:

[0058] The bus operation process in each section is divided into J driving stages;

[0059] Let the variable represents the initial speed of bus k of service b in segment h during travel phase j, , The unit is meter / second;

[0060] represents the final speed of bus k of service b during travel phase j on segment h, in meters per second;

[0061] represents the travel time of bus k of service b in segment h during travel phase j, in seconds;

[0062] The dwell time of bus k of service b at station or intersection h (the number of sections and stations or intersections corresponds one to one, and the bus stops at stations and intersections, so it cannot be written as the dwell time of section h), in seconds;

[0063] Let the variable Indicates whether dynamic wireless charging facilities are deployed in driving stage j on segment h; if , dynamic wireless charging facilities are deployed in segment h during driving phase j; otherwise, dynamic wireless charging facilities are not deployed in segment h during driving phase j;

[0064] When dynamic wireless charging facilities are required in multiple consecutive driving phases, one inverter can be shared;

[0065] The number of inverters that can be used It is calculated indirectly without the need for additional design optimization variables.

[0066] Other steps and parameters are the same as those in the first embodiment.

[0067] Specific embodiment three: This embodiment differs from specific embodiment one or two in that, in step 3, a collaborative optimization model of dynamic wireless charging facility deployment and bus fleet energy-saving speed curve is constructed (the collaborative optimization model belongs to a dual-objective mixed integer nonlinear programming model, as shown in formulas (14)-(28));

[0068] The specific process is:

[0069] Step 3.1: Calculate the distance traveled by bus k of service b in segment h during the travel phase j, denoted as , in meters;

[0070] For buses serving any bus schedule, the distance traveled in segment h during stage j is equal, i.e. , is the length of travel phase j on segment h of each shift;

[0071] (1)

[0072] (2)

[0073] Where, The speed of bus k serving bus schedule b at time t during the speed change phase j in segment h, in meters per second; binary parameter Indicates whether bus k of service b travels at a constant speed in segment h during the travel phase j. If , the bus travels at a constant speed, =1; if or , the bus changes speed, =0; represents the time number within the speed change driving stage j;

[0074] Step 3.2: Calculate the departure time of bus k of service b in segment h during travel phase j, denoted as ; The expression is:

[0075] (3)

[0076] Step 3.3: Combine the departure time of bus k of service b in the last travel phase of section h Determine the travel time window of bus k at intersection h+1[ , ], Greater than but closest to The green light of the bus phase ends at the moment, for The time when the green light of the bus phase is turned on;

[0077] Segment h satisfies ;

[0078] Step 3.4: Calculate the power consumption of bus k of service b during travel period j on segment h , in kilowatt-hours;

[0079] The expressions are shown in formulas (4) to (7):

[0080] (4)

[0081] (5)

[0082] (6)

[0083] (7)

[0084] Where, is the driving force of bus k of service schedule b during the jth phase of uniform speed travel on segment h, in Newtons; is the driving force of bus k serving service b at time t during the speed change phase j in segment h, in Newtons; is the inverse of the maximum recoverable energy of bus k serving service b during travel period j on segment h, in kilojoules; The battery SOC of bus k serving service b at the start of travel phase j in section h, unit: % is the wheel rolling resistance coefficient; is the air resistance coefficient; g is the acceleration due to gravity, which is 9.8 m / s 2 ; is the air density, which is 1.29 kg / m 3 ;

[0085] Step 3.5: Calculate the charge of bus k of service b during segment h during travel period j and the charge amount of bus k with service schedule b when it stops at station or intersection h ;

[0086] The unit is kilojoule, The unit is kilojoule;

[0087] and The expressions are shown in formulas (8) to (10):

[0088] (8)

[0089] (9)

[0090] (10)

[0091] Where, The maximum recoverable energy of bus k serving bus schedule b when arriving at stop or intersection h, in kilojoules; The battery SOC of bus k serving bus schedule b in the last driving phase on section h-1, %; The power consumption of bus k serving bus number b during the last driving phase on segment h-1, in kilojoules; The charge capacity of bus k serving bus schedule b during the last driving phase on segment h-1, in kilojoules; The departure time of bus k of service number b in segment h during travel phase j+1; The departure time of bus k of service number b in segment h during phase 1; The departure time of bus k of service number b in segment h-1 during travel phase J; is the travel time of bus k of service schedule b in segment h-1 during travel phase J, in seconds;

[0092] Step 3.6: Iteratively calculate the battery state of charge of bus k at the start of any driving phase based on formulas (11) to (13);

[0093] (11)

[0094] (12)

[0095] (13)

[0096] Where, The battery state of charge of bus k of service schedule b at the start of travel phase j+1 in segment h, in %; The battery state of charge of bus k of service schedule b at the start of the first driving phase in segment h+1, in %; The battery state of charge of bus k of service schedule b at the start of the last driving phase in section h, in %; Execute the next bus trip for bus k The battery state of charge at the start of the first driving phase in the first section, in %; The battery state of charge of bus k of service schedule b at the start of the last driving phase of the last section, in %; and are the power consumption and charging amount of bus k of service schedule b in the last driving phase of segment h, in kilojoules; and are the power consumption and charging amount of bus k of service schedule b in the last driving phase of the last section, in kilojoules; The charge amount of bus k serving bus schedule b when it stops at station or intersection h+1, in kilojoules; The charge amount of bus k of service schedule b when it stops at stop H+1, in kilojoules;

[0097] Step 3.7: Based on steps 3.1 to 3.6, a collaborative optimization model for the deployment of dynamic wireless charging facilities and the energy-saving speed curve of the bus fleet is constructed (the collaborative optimization model belongs to a dual-objective mixed integer nonlinear programming model, as shown in formulas (14)-(28)).

[0098] The deployment cost of dynamic wireless charging facilities Minimum (as shown in formula (14)) and the total daily power consumption of the bus fleet Minimum (as shown in formula (15)) is the optimization goal;

[0099] The constraints of the collaborative optimization model of dynamic wireless charging facility deployment and bus fleet energy-saving speed curve are shown in formulas (16) to (28):

[0100] (14)

[0101] (15)

[0102] (16)

[0103] (17)

[0104] (18)

[0105] (19)

[0106] (20)

[0107] (twenty one)

[0108] (twenty two)

[0109] (twenty three)

[0110] (twenty four)

[0111] (25)

[0112] (26)

[0113] (27)

[0114] (28)

[0115] Where, Indicates whether dynamic wireless charging facilities are deployed in driving stage j+1 on segment h. If =1, then deploy, if =0 means no layout;

[0116] Indicates whether dynamic wireless charging facilities are deployed in the last driving stage of section h. If =1, then deploy, if =0 means no layout;

[0117] Indicates whether dynamic wireless charging facilities are deployed in the first driving phase of segment h+1. If =1, then deploy, if =0 means no layout;

[0118] represents the initial speed of bus k of service b in segment h during travel phase j+1, in meters per second;

[0119] represents the final speed of bus k of service b in the last travel phase on segment h, in meters per second;

[0120] represents the initial speed of bus k of service b in the first travel phase on segment h+1, in meters per second;

[0121] Indicates the speed limit of the bus in section h, in meters per second;

[0122] Indicates bus service number b-1 The distance traveled in segment h during driving phase j, in meters;

[0123] Indicates whether the b-1 is operated by bus to execute; Indicates the distance from the starting position of section h-1 to the departure station, in meters;

[0124] and is the minimum and maximum acceleration of the bus in section h, in meters per second 2 ;

[0125] is the dwell time of bus k of service schedule b at stop h+1, in seconds;

[0126] The departure time of bus k of service number b in the last travel phase on section H;

[0127] represents the travel time of the last travel phase of bus k of service b on segment H, in seconds;

[0128] is the dwelling time of bus k of service schedule b at station H+1, in seconds;

[0129] The departure times specified in the timetable Departure time at the departure station;

[0130] Indicates the shift Is it the next bus k after bus k completes bus b? If yes, it is 1, otherwise it is 0;

[0131] The departure time of bus k of service number b in the last travel phase on section h;

[0132] represents the travel time of the last travel phase of bus k of service b on segment h, in seconds;

[0133] Indicates the maximum stay time of the bus at each station;

[0134] Characterizes the attributes of the starting node of segment h+1; when When , it means that the starting node of segment h+1 is the site; when When , it means that the starting node of segment h+1 is an intersection.

[0135] Other steps and parameters are the same as those in the first or second embodiment.

[0136] Specific embodiment 4: This embodiment differs from any one of specific embodiments 1 to 3 in that, in step 4, a hybrid multi-objective artificial hummingbird algorithm is used to solve the collaborative optimization model of dynamic wireless charging facility layout and bus fleet energy-saving speed curve, and the speed matrix, travel time matrix, and dwell time matrix of the food source with the highest dominance in the external archive, as well as the layout matrix of dynamic wireless charging facilities on the bus route, are output as the Pareto solution set. The specific process is as follows:

[0137] Step 4.1. Encoding; the specific process is as follows:

[0138] Let the maximum number of driving stages in each segment be J;

[0139] The solution of the collaborative optimization model of dynamic wireless charging facility layout and bus fleet energy-saving speed curve is regarded as the food source of hummingbirds. The location of the food source is It consists of four parts, namely X = [ V , U , D , R ] T , the superscript T means to find the transpose;

[0140] Velocity Matrix is the set of initial and final velocities of all buses in all sections during their travel phases:

[0141] (29)

[0142] Drive time matrix It is the set of travel times of all buses in all sectors of all routes they serve:

[0143] (30)

[0144] Dwell time matrix The set of the stay time of all buses after all sections in all shifts (the default stay time at the starting station of each shift is 0):

[0145] (31)

[0146] Layout Matrix A collection of dynamic wireless charging facility deployment conditions in all driving phases within all sections;

[0147] (32)

[0148] Step 4.2. Set the hummingbird population to , the maximum number of iterations is , the outer set size is ;

[0149] Step 4.3. Let the number of iterations , initialize the access levels on the diagonal of the access table to NULL, initialize the remaining access levels on the access table to 0, and the external archive to empty;

[0150] The visit table is a matrix where the rows represent the locations of food sources and the columns represent the locations of hummingbirds;

[0151] Step 4.4. Population initialization; the specific process is as follows:

[0152] Step 4.4.1.

[0153] For hummingbirds Randomly generate an initial velocity matrix that satisfies constraints (16) to (19) , ;

[0154] based on Randomly generate an initial travel time matrix that satisfies constraints (20) to (22) ;

[0155] based on and Generate an initial residence time matrix that satisfies constraints (23) to (27) ;

[0156] Step 4.4.2. Random Generation A 0-1 (elements in the matrix are either 0 or 1) matrix is ​​used to represent the deployment of dynamic wireless charging facilities in each driving stage; a 1 matrix (elements in the matrix are 1) represents the deployment of dynamic wireless charging facilities during the driving stage, and a 0 matrix (elements in the matrix are 0) represents the non-deployment of dynamic wireless charging facilities during the driving stage;

[0157] make Indicates the The first iteration Alternative matrices, , represents the total number of candidate matrices;

[0158] Statistics Hummingbird of 、 and (Hummingbird of 、 and as a whole) with each alternative matrix The number of feasible solutions of individuals under the combination that satisfy the constraint (28);

[0159] If exists A feasible solution, , calculate and retain the candidate matrix with the minimum cost based on formula (14) , the candidate matrix with the minimum cost Denoted as the initial layout matrix , go to step 4.5;

[0160] If there is no feasible solution, return to step 4.4.1;

[0161] Step 4.5. 、 、 and Substitute into formula (14) and (15) to calculate the The nectar filling rate of the food source of each hummingbird in the population at the iteration is recorded as ;

[0162] The food source locations of all individuals in the initialized population are stored in an external archive according to the dominance relationship;

[0163] Step 4.6. Update the location of the hummingbird's food source (the location of the hummingbird's food source was determined by step 4.4).

[0164] Step 4.7. Update the access table;

[0165] Step 4.8. The updated food source locations are stored in the external archive according to the dominance relationship. The specific process is as follows:

[0166] Determine whether the size of the external archive set is greater than If it is less than the new food source, directly deposit it and go to step 4.10; if it is greater than or equal to it, go to step 4.9;

[0167] Step 4.9. Calculate the crowding distance of each individual in the external archive, remove the solution with the smallest crowding distance, and store it in the new food source;

[0168] Step 4.10. Judgment Can it be If divisible, go to step 4.11, otherwise go directly to step 4.15;

[0169] Step 4.11. Execute the migration foraging strategy. After the migration foraging strategy is executed, proceed to step 4.12.

[0170] The migration foraging strategy is shown in formula (40):

[0171] (40)

[0172] Where, For hummingbirds at the worst dominance level The rate matrix of new food sources found; is the migration factor matrix, and each element in the migration factor matrix is ​​a random number between [0, 1];

[0173] Step 4.12. Judgment Do constraints (16) to (19) meet? If so, continue with step 4.13. Otherwise, use formula (40) to forage again.

[0174] Step 4.13. Based on Generate a set that satisfies constraints (20)~(22), (23)~(27) and ;

[0175] in, Represents a hummingbird at the worst dominance level The travel time matrix of the new food source found, Represents a hummingbird at the worst dominance level Residence time matrix of new food sources found;

[0176] Statistics Hummingbird of 、 and (Hummingbird of 、 and as a whole) with each alternative matrix The number of feasible solutions of individuals under the combination that satisfy the constraint (28);

[0177] If exists A feasible solution, , calculate and retain the candidate matrix with the minimum cost based on formula (14) , the lowest cost feasible Denoted as the initial layout matrix , go to step 4.14;

[0178] If there is no feasible solution, return to step 4.11;

[0179] Step 4.14. Except for the hummingbird at the worst dominance level, the velocity matrix, travel time matrix, and residence time matrix of the remaining hummingbirds in the population remain unchanged.

[0180] Let the velocity matrix of the remaining hummingbirds in the group be ;

[0181] Let the travel time matrix of the remaining hummingbirds in the population be ;

[0182] Let the residence time matrix of the remaining hummingbirds in the population be ;

[0183] Step 4.15. Update the position of the hummingbirds in the population using formula (38);

[0184] Update the visit table based on the updated location of the hummingbirds within the population and the rules described in step 4.7;

[0185] Add the updated positions of hummingbirds within the population to the external archive according to dominance relationships based on the rules described in steps 4.8 and 4.9;

[0186] Follow step 4.16.

[0187] Step 4.16. Update the candidate dynamic wireless charging facility deployment set; proceed to step 4.17.

[0188] Step 4.17. Determine the termination condition; the specific process is as follows:

[0189] Determine whether If so, then let And return to step 4.6; otherwise, end and output the speed matrix, travel time matrix, stay time matrix of the food source with the highest dominance level in the external archive and the layout matrix of dynamic wireless charging facilities on the bus route as the Pareto solution set.

[0190] The other steps and parameters are the same as those in the first to third embodiments.

[0191] Specific embodiment 5: This embodiment differs from any one of specific embodiments 1 to 4 in that the location of the food source where the hummingbird is located is updated in step 4.6 (the location of the food source where the hummingbird is located is determined by step 4.4 for the first time);

[0192] The specific process is:

[0193] Step 4.6.1. Use a random number between [0, 1] Choose a flying skill for each hummingbird in the population; if , select axial flight, as shown in formula (33); if , select omnidirectional flight, as shown in formula (34); otherwise, select diagonal flight, as shown in formula (35);

[0194] (33)

[0195] (34)

[0196] (35)

[0197] Where, For the Hummingbird The velocity matrix Elemental flying skills; is a random integer between [1,n], where n is the number of elements in the velocity matrix; Any element of a row of non-repeating integer groups;

[0198] Step 4.6.2. Determine a random number between [0, 1] Is it greater than 0.5? If it is greater than or equal to 0.5, go to step 4.6.3; if it is less than 0.5, go to step 4.6.5;

[0199] First determine the flight skills and then the foraging strategy. Formulas (36) and (37) use the results of step 4.6.1;

[0200] Step 4.6.3. Hummingbird To implement the guided foraging strategy, follow step 4.6.4;

[0201] Step 4.6.4. Judgment Do constraints (16) to (19) satisfy? If so, proceed to step 4.6.7; otherwise, return to step 4.6.1.

[0202] Step 4.6.5. Hummingbird To implement the territorial foraging strategy, proceed to step 4.6.6;

[0203] Step 4.6.6. Judgment Do constraints (16) to (19) satisfy? If so, proceed to step 4.6.7; otherwise, return to step 4.6.1.

[0204] Step 4.6.7. Based on Generate a set that satisfies constraints (20)~(22), (23)~(27) and ;

[0205] Indicates the Hummingbird The travel time matrix of the new food source found, Indicates the Hummingbird Residence time matrix of new food sources found;

[0206] Statistics Hummingbird of 、 and (Hummingbird of 、 and as a whole) with each alternative matrix The number of feasible solutions of the individuals under the combination that satisfy the constraint (28);

[0207] If exists A feasible solution, , calculate and retain the candidate matrix with the minimum cost based on formula (14) , the lowest cost feasible Denoted as the initial layout matrix , proceed to step 4.6.8;

[0208] If there is no feasible solution, return to step 4.6;

[0209] Step 4.6.8. Use formula (38) to update the location of the hummingbird's food source.

[0210] The other steps and parameters are the same as those in the first to fourth embodiments.

[0211] Specific embodiment 6: This embodiment is different from the specific embodiments 1 to 5 in that the hummingbird in step 4.6.3 The guided foraging strategy is shown in formula (36):

[0212] (36)

[0213] in, For the Hummingbird The rate matrix of new food sources found; For the Hummingbird The velocity matrix of the moving target food source, i.e., the food source with the highest access level in the access table during the current iteration; is the guiding factor, and each element in the matrix is ​​a random number that obeys the standard normal distribution; For the Hummingbird The flight skill matrix consists of multiple Composition; Operator is the Hadamard product, which multiplies the corresponding elements of the matrices;

[0214] Hummingbird as described in step 4.6.5 The territory foraging strategy is shown in formula (37):

[0215] (37)

[0216] Where, is the regional factor, which is a random array that obeys the standard normal distribution.

[0217] The other steps and parameters are the same as those in the first to fifth embodiments.

[0218] Specific embodiment seven: This embodiment differs from any one of specific embodiments one to six in that the position of the food source where the hummingbird is located is updated using formula (38) in step 4.6.8;

[0219] The specific process is:

[0220] (38)

[0221] Where, For the Hummingbird The location of the food source, For the Hummingbird location of food sources;

[0222] and Respectively Hummingbird The first and second objective function values ​​at the food source location;

[0223] For the Hummingbird The location of the new food source found, X ˜ α l = [ V ˜ α l , U ˜ α l , D ˜ α l , R ˜ α l ] T , the superscript T means to find the transpose;

[0224] and Respectively Hummingbird The location of the new food source found (determined using formula (36) , determined using step 4.6.7 , together forming )’s first and second objective function values.

[0225] The other steps and parameters are the same as those in the first to sixth embodiments.

[0226] Specific embodiment eight: This embodiment differs from any one of specific embodiments one to seven in that the process of obtaining the congestion distance in step 4.9 is as follows:

[0227] The crowding degree of marginal individuals is set to infinity;

[0228] The marginal individuals are the individuals whose objective functions (14) and (15) are both maximized and minimized at the same time;

[0229] The calculation method of the crowding distance of non-marginal individuals (all marginal individuals except marginal individuals) is shown in formula (39);

[0230] (39)

[0231] Where, For external archives crowding distance to a food source; and For the Hedi The first objective function value corresponding to the food source; and For the Hedi The second objective function value corresponding to each food source.

[0232] The other steps and parameters are the same as those in the first to seventh embodiments.

[0233] Specific embodiment 9: This embodiment differs from any one of specific embodiments 1 to 8 in that the access table is updated in step 4.7; the specific process is as follows:

[0234] If the hummingbird Use formula (36) or (37) to access the target food source, and visit the hummingbirds in the table The (row) access level to the target food source is set to 0, hummingbird The (row) access level to other food sources is increased by 1;

[0235] At the same time, if the hummingbird The position of the hummingbird is updated and the other hummingbird pairs in the table will be visited. The access level of the (column) is set to the highest access level of the same peer plus 1;

[0236] If the hummingbird The position of the hummingbird is not updated, access the other hummingbird pairs in the table The (column) access level remains unchanged.

[0237] The other steps and parameters are the same as those in Specific Embodiments 1 to 8.

[0238] Specific embodiment ten: This embodiment differs from any one of specific embodiments one to nine in that in step 4.16, the candidate dynamic wireless charging facility layout set is updated; and step 4.17 is executed;

[0239] The specific process is:

[0240] statistics With all hummingbirds 、 、 The number of feasible individuals that satisfy constraint (28) after combination (step 4.14) is the number of feasible individuals with the largest number of Keep and record ;

[0241] Update the remaining (other than the reserved) alternative dynamic wireless charging facility deployment matrix, as shown in formula (41):

[0242] (41)

[0243] Where, For the The first iteration The first candidate matrix The value of an element; For the The first iteration The first candidate matrix The value of an element; For the The maximum number of feasible individuals (statistical With all hummingbirds 、 、 The number of feasible individuals that satisfy the complex constraint (28) after combination is the largest) of the alternative matrices The value of an element; and is a random number between [0, 1].

[0244] The other steps and parameters are the same as those in Specific Embodiments 1 to 9.

[0245] The present invention may have many other embodiments. Without departing from the spirit and essence of the present invention, those skilled in the art may make various corresponding changes and modifications based on the present invention, but these corresponding changes and modifications should all fall within the scope of protection of the claims attached to the present invention.

Claims

1. A method for planning energy-saving bus speed and deploying dynamic wireless charging facilities, characterized in that: The specific process of the method is: Step 1. Basic data collection; the specific process is: Step 1.

1. Divide the bus route into H sections according to the end position of the station and the stop line position of the intersection, and record the distance from the starting position of each section to the departure station, denoted as The unit is meter, h = 1, 2, ..., H; Step 1.

2. Let ε h ∈{0,1} represents the attribute of the starting node of segment h; When ε h =0, it means that the starting node of segment h is the station; When ε h =1, it means that the starting node of segment h is an intersection; Step 1.

3. Measure the average road slope in each section of the bus line, denoted as θ h ,θ h The unit is degree; Step 1.

4. Let b represent the bus number, B represents the total number of bus trips during the daily operating hours, b = 1, 2, ..., B; Query the departure timetable and record the scheduled departure time of all bus routes at the departure station during the whole day's operation. The scheduled departure time of bus route B at the departure station is recorded as Step 1.

5. Query the driving schedule to determine the matching relationship between the bus fleet and the shift, denoted as σ k,b ; When σ k,b =1, bus k will be used for bus trip b; When σ k,b = 0, bus trip b is not executed by bus k, k = 1, 2, ..., K; Where K represents the number of buses in the bus fleet; Step 1.

6. Count the boarding and alighting times of passengers at each stop of each bus during the whole day's operation. The boarding and alighting times of passengers of bus of bus b in section h are calculated as follows: Indicates that the unit is seconds; Step 1.

7. Record the cycle duration of each signalized intersection along the bus line during the whole day's operation, in seconds; the bus phase green light on time and green light duration of each cycle, in seconds; Step 1.

8. Query bus model information; The specific process is: make represents the rated battery capacity of bus k, in kilowatt-hours; Indicates the battery charging limit of bus k, in %; Indicates the lower limit of battery discharge of bus k, in %; m k represents the curb weight of bus k, in kilograms; A fro Represents the front windshield area of ​​the vehicle, in square meters; η drl Indicates the efficiency of the transmission system in %; η bat Indicates battery efficiency in %; and Respectively represent the motor driving efficiency and braking efficiency, the unit is %; Step 1.

9. Query dynamic wireless charging facility parameters; Let P k represents the charging power of bus k, in watts; c1 represents the purchase cost of the transmitting coil per unit length, in yuan / meter; c2 represents the purchase cost of a single inverter, in yuan / unit; Step 2. Define the optimization variables of the collaborative optimization model of dynamic wireless charging facility deployment and bus fleet energy-saving speed curve; Step 3. Construct a collaborative optimization model of dynamic wireless charging facility deployment and bus fleet energy-saving speed curve; Step 4. Solve the collaborative optimization model of dynamic wireless charging facility layout and bus fleet energy-saving speed curve based on the hybrid multi-objective artificial hummingbird algorithm, and output the speed matrix, travel time matrix, and stay time matrix of the food source with the highest dominance level in the external archives as well as the layout matrix of dynamic wireless charging facilities on the bus route as the Pareto solution set; In the step 2, optimization variables of the collaborative optimization model of dynamic wireless charging facility deployment and bus fleet energy-saving speed curve are defined; The specific process is: The operation process of the bus in each section is divided into J driving stages; Let the variable represents the initial speed of bus k of service b in segment h during travel phase j, j = 1, 2, ..., J, The unit is meter / second; v′ k,b,h,j represents the final speed of bus k of service b in segment h during travel phase j, in meters per second; D k,b,h,j represents the travel time of bus k of service b in segment h during travel phase j, in seconds; represents the dwelling time of bus k of service schedule b in segment h, in seconds; Let variable x h,j ∈{0,1} indicates whether dynamic wireless charging facilities are deployed in driving stage j on segment h; if x h,j = 1, dynamic wireless charging facilities are deployed in segment h during driving phase j; Otherwise, no dynamic wireless charging facilities are deployed in driving phase j on segment h; When dynamic wireless charging facilities are required in multiple consecutive driving stages, one inverter can be shared; In step 3, a collaborative optimization model of dynamic wireless charging facility deployment and bus fleet energy-saving speed curve is constructed; The specific process is: Step 3.1: Calculate the travel distance of bus k of service schedule b in segment h during travel phase j, denoted as L k,b,h,j , in meters; For buses serving any bus schedule, the distance traveled in segment h during the travel phase j is equal, that is, L h,j =L k,b,h,j , L h,j is the length of travel phase j on segment h of each shift; In the formula, is the speed of bus k of service schedule b at time t in segment h during travel phase j, in meters per second; binary parameter Indicates whether bus k of service b travels at a constant speed in segment h during driving phase j. If The bus is travelling at a constant speed. if or The bus changes speed. t represents the time number within driving phase j; Step 3.2: Calculate the departure time of bus k of service b in segment h during travel phase j, denoted as The expression is: Step 3.3: Combine the departure time of bus k of service b in the last driving phase of section h Determine the travel time window of bus k in section h+1 is greater than The green light end time of the bus phase, for The time when the green light of the bus phase is turned on; Segment h satisfies ε h =1; Step 3.4: Calculate the power consumption of bus k of service schedule b during travel phase j on segment h The unit is kilowatt-hour; The expressions are shown in formulas (4) to (7): In the formula, is the uniform driving force of bus k of service schedule b during travel stage j on segment h, in Newtons; is the speed-changing driving force of bus k of service schedule b at time t in segment h during driving phase j, in Newtons; is the inverse of the maximum recoverable energy of bus k of service schedule b during driving stage j on segment h, in kilojoules; S k,b,h,j The battery SOC of bus k of service schedule b at the start of driving phase j in segment h, in %; C1 is the wheel rolling resistance coefficient; C2 is the air resistance coefficient; g is the acceleration of gravity, which is 9.8 m / s 2 ; ρ is the air density, which is 1.29 kg / m 3 ; Step 3.5: Calculate the charge amount of bus k of service schedule b during driving phase j on segment h and the charge amount of bus k with service number b when it stops in section h The unit is kilojoule. The unit is kilojoule; and The expressions are shown in formulas (8) to (10): In the formula, The maximum recoverable energy of bus k serving service b when arriving at section h, kJ; S k,b,h-1,J The battery SOC of bus k serving shift b in the last driving phase on segment h-1, %; The power consumption of bus k serving bus number b in the last driving stage on section h-1, kJ; The charge amount of bus k serving service b during the last driving phase on segment h-1, kJ; The departure time of bus k of service schedule b in segment h during travel phase j+1; The departure time of bus k of service schedule b in segment h during travel phase 1; D is the departure time of bus k of service schedule b in segment h-1 during travel phase J; k,b,h-1,J is the travel time of bus k of service schedule b in segment h-1 during travel phase J, in seconds; Step 3.6: Iteratively calculate the battery state of charge of bus k at the start of any driving phase based on formulas (11) to (13); In the formula, S k,b,h,j+1 S is the battery charge state of bus k of service schedule b at the start time of driving phase j+1 in segment h, in %; k,b,h+1,1 S is the battery charge state of bus k of service shift b at the beginning of the first driving phase in segment h+1, in %; k,b,h,J S is the battery charge state of bus k of service schedule b at the start of the last driving phase in segment h, in %; k,b′,1,1 S is the battery charge state at the beginning of the first driving phase in the first section when bus k executes the next trip b′, in %; k,b,H,J The battery state of charge of bus k of service schedule b at the start of the last driving phase of the last section, in %; and are the power consumption and charging amount of bus k of service schedule b in the last driving stage on segment h, in kilojoules; and are the power consumption and charging amount of bus k of service schedule b in the last driving stage of the last section, in kilojoules; The charge amount of bus k serving service b when it stops at section h+1, in kilojoules; The charge amount of bus k of service schedule b when it stops at section H+1, in kilojoules; Step 3.7: Based on steps 3.1 to 3.6, a collaborative optimization model of dynamic wireless charging facility deployment and bus fleet energy-saving speed curve is constructed; The optimization objectives are to minimize the deployment cost Z1 of dynamic wireless charging facilities and the total daily power consumption Z2 of the bus fleet; The constraints of the collaborative optimization model of dynamic wireless charging facility deployment and bus fleet energy-saving speed curve are shown in formulas (16) to (28): In the formula, x h,j+1 Indicates whether dynamic wireless charging facilities are deployed in driving stage j+1 on segment h. If x h,j+1 = 1, then set, if x h,j+1 =0 means no deployment; x h,J Indicates whether dynamic wireless charging facilities are deployed in the last driving stage of segment h. If x h,J = 1, then set, if x h,J =0 means no deployment; x h+1,1 Indicates whether dynamic wireless charging facilities are deployed in the first driving phase of segment h+1. If x h+1,1 = 1, then set, if x h+1,1 =0 means no deployment; represents the initial speed of bus k of service b in segment h during the travel phase j+1, in meters per second; v′ k,b,h,J represents the final speed of bus k of service b in the last driving phase on segment h, in meters per second; represents the initial speed of bus k of service b in the first driving phase on segment h+1, in meters per second; Indicates the speed limit of the bus in section h, in meters per second; L k′,b-1,h,j represents the travel distance of bus k′ of service b-1 in segment h during travel phase j, in meters; σ k′,b-1 Indicates whether the trip b-1 is performed by bus k′; Indicates the distance from the starting position of section h-1 to the departure station, in meters; and is the minimum and maximum acceleration of the bus in section h, in meters per second 2 ; is the stay time of bus k of service schedule b in section h+1, in seconds; The departure time of bus k of service schedule b in the last travel phase on section H; D k,b,H,J represents the travel time of the last travel phase of bus k of service schedule b on segment H, in seconds; is the stay time of bus k of service schedule b in section H+1, in seconds; The departure time of train b' at the departure station specified in the departure timetable; σ k,b′ Indicates whether bus k is the next bus after bus k completes bus b. If yes, it is 1, otherwise it is 0; The departure time of bus k of service schedule b in the last travel phase on section h; D k,b,h,J represents the travel time of the last travel phase of bus k of service schedule b on segment h, in seconds; Indicates the maximum stay time of the bus at each station; ε h+1 ∈{0,1} represents the attribute of the starting node of segment h+1; when ε h+1 = 0, it means that the starting node of segment h+1 is the station; when ε h+1 When =1, it means that the starting node of segment h+1 is an intersection.

2. A method for planning energy-saving bus speed and deploying dynamic wireless charging facilities according to claim 1, characterized in that: In step 4, the dynamic wireless charging facility layout and bus fleet energy-saving speed curve collaborative optimization model is solved based on the hybrid multi-objective artificial hummingbird algorithm, and the speed matrix, travel time matrix, and stay time matrix of the food source with the highest dominance level in the external archive and the layout matrix of the dynamic wireless charging facilities on the bus route are output as the Pareto solution set; the specific process is: Step 4.

1. Encoding; the specific process is: Let the maximum number of driving stages in each segment be J; The solution of the collaborative optimization model of dynamic wireless charging facility deployment and bus fleet energy-saving speed curve is regarded as the food source of hummingbirds. The location X of the food source consists of four parts, namely X = [V, U, D, R] Τ , the superscript T means to find the transpose; The speed matrix V is the set of initial and final speeds of all buses in all sections: The travel time matrix U is the set of travel times of all buses in all sectors of all buses’ services: U={Dk,b,h,j|k=1, 2, ..., K; σk,b=1; h=1, 2, ..., H; j=1, 2, ..., J}(30) The dwell time matrix D is the set of dwell times of all buses after all sections in all shifts: The layout matrix R is a collection of dynamic wireless charging facility layout conditions in all driving stages in all sections; R={xh,j|h=1, 2, ..., H; j=1, 2, ..., J} (32) Step 4.

2. Set the hummingbird population to φ and the maximum number of iterations to The outer set size is Step 4.

3. Set the number of iterations λ = 1, initialize the access levels on the diagonal of the access table to NULL, initialize the remaining access levels on the access table to 0, and the external archive to be empty; The visit table is a matrix, where the rows of the matrix represent the locations of food sources and the columns of the matrix represent the locations of hummingbirds; Step 4.

4. Population initialization; the specific process is: Step 4.4.

1. Randomly generate an initial velocity matrix for hummingbird α that satisfies constraints (16) to (19) based on Randomly generate an initial travel time matrix that satisfies constraints (20) to (22) based on and Generate an initial residence time matrix that satisfies constraints (23) to (27) Step 4.4.

2. Random Generation A 0-1 matrix is ​​used to represent the deployment of dynamic wireless charging facilities in each driving stage; a 1 matrix represents the deployment of dynamic wireless charging facilities during the driving stage, and a 0 matrix represents the deployment of dynamic wireless charging facilities during the driving stage; make represents the βth candidate matrix at the λth iteration, represents the total number of candidate matrices; Statistics of Hummingbird α and With each alternative matrix The number of feasible solutions of individuals under the combination that satisfy constraint (28); If there are ω′ feasible solutions, Based on formula (14), calculate and retain the candidate matrix with the minimum cost The candidate matrix with the minimum cost The initial layout matrix Go to step 4.5; If there is no feasible solution, return to step 4.4.1; Step 4.

5. and Substitute into formulas (14) and (15) to calculate the nectar filling rate of each hummingbird's food source in the population at the λth iteration, denoted as The food source locations of all individuals in the initialized population are stored in an external archive according to the dominance relationship; Step 4.

6. Update the location of the food source where the hummingbird is located; Step 4.

7. Update the access table; Step 4.

8. Store the updated food source locations of the hummingbird population in the external archive in sequence according to the dominance relationship. The specific process is as follows: Determine whether the size of the external archive set is greater than If it is less than the new food source, directly deposit it and go to step 4.10; if it is greater than or equal to it, go to step 4.9; Step 4.

9. Calculate the crowding distance of each individual in the external archive set, remove the solution with the smallest crowding distance and store it in the new food source; Step 4.

10. Judgment Is it divisible by λ? If yes, proceed to step 4.11; otherwise, proceed directly to step 4.

15. Step 4.

11. Execute the migration foraging strategy. After the migration foraging strategy is executed, execute step 4.12; The migration foraging strategy is shown in equation (40): In the formula, is the speed matrix of the new food source found by hummingbird α at the worst dominance level; ζ3 is the migration factor matrix, and each element in the migration factor matrix is ​​a random number between [0,1]; Step 4.

12. Judgment Whether constraints (16) to (19) are satisfied, if so, continue with step 4.13, otherwise use formula (40) to forage again; Step 4.

13. Based on Generate a set of constraints (20) to (22), (23) to (27) and in, represents the travel time matrix of the new food source found by hummingbird α at the worst dominance level, represents the residence time matrix of the new food source found by hummingbird α at the worst dominance level; Statistics of Hummingbird α and With each alternative matrix The number of feasible solutions of individuals under the combination that satisfy constraint (28); If there are ω′ feasible solutions, Based on formula (14), calculate and retain the candidate matrix with the minimum cost Minimize the cost The initial layout matrix Go to step 4.14; If there is no feasible solution, return to step 4.11; Step 4.

14. Except for the hummingbird at the worst dominance level, the speed matrix, travel time matrix and stay time matrix of the remaining hummingbirds in the population remain unchanged; Let the velocity matrix of the remaining hummingbirds in the group be Let the travel time matrix of the remaining hummingbirds in the population be Let the residence time matrix of the remaining hummingbirds in the population be Step 4.

15. Update the position of hummingbirds in the population; Update the visit table based on the updated location of the hummingbirds within the population and step 4.7; Based on steps 4.8 and 4.9, the updated positions of hummingbirds in the population are added to the external archive according to the dominance relationship; Execute step 4.16; Step 4.

16. Update the candidate dynamic wireless charging facility deployment set; execute step 4.17; Step 4.

17. Determine the termination condition; the specific process is: Determine whether If yes, set λ=λ+1 and return to step 4.6; otherwise, end and output the speed matrix, travel time matrix, stay time matrix of the food source with the highest dominance level in the external archive and the layout matrix of dynamic wireless charging facilities on the bus route as the Pareto solution set.

3. A method for planning energy-saving bus speed and deploying dynamic wireless charging facilities according to claim 2, characterized in that: In step 4.6, the location of the food source where the hummingbird is located is updated; The specific process is: Step 4.6.

1. Use a random number ξ2 between [0,1] to select a flight skill for each hummingbird in the population; if ξ2 < 1 / 3, select axial flight, as shown in formula (33); if ξ2 > 2 / 3, select omnidirectional flight, as shown in formula (34); Otherwise, choose diagonal flight, as shown in formula (35); In the formula, is the flight skill of the τth element of the velocity matrix of hummingbird α at the λth iteration; ξ3 is a random integer between [1,n], where n is the number of elements in the velocity matrix; ξ4 is any element of a row of non-repeating integers; Step 4.6.

2. Determine whether the random number ξ1 between [0,1] is greater than 0.

5. If it is greater than or equal to 0.5, execute step 4.6.3; if it is less than 0.5, execute step 4.6.5; Step 4.6.

3. Hummingbird α executes the guided foraging strategy and executes step 4.6.4; Step 4.6.

4. Judgment Check whether constraints (16) to (19) are satisfied. If so, proceed to step 4.6.

7. Otherwise, return to step 4.6.

1. Step 4.6.

5. Hummingbird α executes the territory foraging strategy and executes step 4.6.6; Step 4.6.

6. Judgment Check whether constraints (16) to (19) are satisfied. If so, proceed to step 4.6.

7. Otherwise, return to step 4.6.

1. Step 4.6.

7. Based on Generate a set of constraints (20) to (22), (23) to (27) and represents the travel time matrix of the new food source found by hummingbird α at the λth iteration, represents the residence time matrix of the new food source found by hummingbird α at the λth iteration; Statistics of Hummingbird α and With each alternative matrix The number of feasible solutions of individuals under the combination that satisfy constraint (28); If there are ω′ feasible solutions, Based on formula (14), calculate and retain the candidate matrix with the minimum cost Minimize the cost The initial layout matrix Go to step 4.6.8; If there is no feasible solution, return to step 4.6; Step 4.6.

8. Update the location of the hummingbird's food source.

4. A method for planning energy-saving bus speed and deploying dynamic wireless charging facilities according to claim 3, characterized in that: In step 4.6.3, the guided foraging strategy performed by hummingbird α is shown in formula (36): in, is the velocity matrix of the new food source found by hummingbird α at the λth iteration; is the velocity matrix of the target food source that hummingbird α moves to during the λth iteration, that is, the food source with the highest access level in the access table during the current iteration; ζ1 is the guiding factor; is the flight skill matrix of hummingbird α at the λth iteration, The operator ⊙ is the Hadamard product; In step 4.6.5, the territorial foraging strategy performed by hummingbird α is shown in formula (37): In the formula, ζ2 is the regional factor, which is a random array that obeys the standard normal distribution.

5. A method for planning energy-saving bus speed and deploying dynamic wireless charging facilities according to claim 4, characterized in that: In step 4.6.8, the position of the food source where the hummingbird is located is updated using formula (38); The specific process is: In the formula, is the location of the food source of hummingbird α at the λ+1th iteration, is the location of the food source of hummingbird α at the λth iteration; and are the first and second objective function values ​​of the food source where hummingbird α is located at the λth iteration; is the location of the new food source found by hummingbird α in the λth iteration, The superscript T means to find the transpose; and are the first and second objective function values ​​of the new food source location found by hummingbird α at the λth iteration.

6. A method for planning energy-saving bus speed and deploying dynamic wireless charging facilities according to claim 5, characterized in that: The process of obtaining the crowding distance in step 4.9 is as follows: The crowding degree for marginal individuals is set to infinity; The marginal individuals are individuals whose objective functions (14) and (15) are both maximized and minimized at the same time; The calculation method of the crowding distance of non-marginal individuals is shown in formula (39); In the formula, is the crowding distance of the α′th food source in the external archive set; and is the first objective function value corresponding to the α′+1th and α′-1th food sources; and is the second objective function value corresponding to the α′+1th and α′-1th food sources.

7. A method for planning energy-saving bus speed and deploying dynamic wireless charging facilities according to claim 6, characterized in that: In step 4.7, the access table is updated; the specific process is: If hummingbird α uses formula (36) or (37) to visit the target food source, set the visit level of hummingbird α to the target food source in the visit table to 0, and increase the visit level of hummingbird α to other food sources by 1; At the same time, if the position of hummingbird α is updated, the access level of other hummingbirds in the access table to hummingbird α is set to the highest access level of the same peer plus 1; If the position of hummingbird α is not updated, the access level of other hummingbirds in the access table to hummingbird α remains unchanged.

8. A method for planning energy-saving bus speed and deploying dynamic wireless charging facilities according to claim 7, characterized in that: In step 4.16, the candidate dynamic wireless charging facility deployment set is updated; and step 4.17 is executed; The specific process is: statistics With all hummingbirds The number of feasible individuals that satisfy constraint (28) after combination is the number of feasible individuals with the largest number of Keep and record Update the remaining candidate dynamic wireless charging facility deployment matrices, as shown in formula (41): In the formula, is the value of the τ′th element of the βth candidate matrix at the λ+1th iteration; is the value of the τ′th element of the βth candidate matrix at the λth iteration; is the value of the τ′th element of the candidate matrix with the largest number of feasible individuals at the λth iteration; ξ5 and ξ6 are random numbers between [0,1].

Citation Information

Patent Citations

  • Method of optimizing running track of city bus considering energy conservation

    CN107067710A

  • New energy bus cooperative scheduling and energy-saving driving system and control method thereof

    CN112837532A

Cited By

  • Dynamic wireless charging and vehicle infrastructure collaborative optimization control method

    CN121884582A