Bus charging deployment method, device, equipment and medium

Abstract

The invention provides a bus charging deployment method and device, equipment and a medium. According to the method, charging information, namely an initial charging scheme, generated by each bus in order to meet the electric quantity required by the journey is determined on the basis of bus shift change time; then performing first iteration processing on the charging information based on a plurality of preset charging requirements; in each round of iteration, a to-be-processed demand of the round is selected from the target demands, and an adjustment strategy corresponding to the to-be-processed demand is adopted to adjust the candidate charging information of the round to obtain target charging information of the round; the target demand is a charging demand which is not satisfied by the candidate charging information of the current round; the candidate charging information of the first round is charging information; the candidate charging information of the non-first round is the target charging information of the previous round. According to the process, the initial charging scheme is subjected to multi-objective optimization in a multi-round iteration mode, so that the optimization scheme meeting various charging requirements as much as possible is obtained, and then the charging deployment efficiency and applicability are improved.

Description

Technical Field

[0001] The present invention relates to the technical field of public transportation operation, and in particular to a charging deployment method, device, equipment and medium for a public transportation bus. Background Art

[0002] With the rapid development of electric vehicles in recent years, more and more electric buses have been put into use. Due to the limited range of electric buses, charging piles are often installed in bus stations, and the vehicles can be charged through the charging piles in the station during the shift change and rest period.

[0003] To ensure vehicle operation, bus operators often charge buses in a centralized manner during periods when the vehicles are not in operation. However, the amount of electricity after centralized charging may not be enough to complete the subsequent operation of the bus. On this basis, bus operators often set some charging requirements from the dimensions of cost saving and improving operational efficiency. For example, to save charging costs, it is necessary to avoid charging during peak electricity price periods as much as possible. For another example, to ensure the normal operation of the vehicle and respond to emergencies, the daily charging amount of the vehicle must not be less than the preset lower limit of the charging amount. Bus drivers can combine these charging requirements with the current power of the vehicle to independently choose the charging period of the vehicle during shift changes.

[0004] However, in actual applications, these charging needs may not be met at the same time due to various reasons. For example, when the driver drives the car to charge, there is a lack of idle charging piles at the station, which may result in the vehicle being unable to fully charge to the minimum limit of the daily charge required. For another example, when the driver finds that the vehicle may not have enough power for subsequent operation, it happens to be in the peak electricity price period. In order to ensure the operation of the vehicle, the driver can only choose to charge during the peak electricity price period.

[0005] In view of this, how to deploy charging for buses to meet the various charging requirements set by bus operators as much as possible is an issue that needs to be solved urgently. Summary of the invention

[0006] The embodiments of the present application provide a method, device, equipment and medium for charging deployment of a bus, which are used to perform multi-objective optimization on an initial charging plan in a multi-round iterative manner to obtain an optimized plan that meets multiple pre-set charging requirements as much as possible, thereby improving the efficiency and applicability of charging deployment.

[0007] In a first aspect, an embodiment of the present application provides a charging deployment method for a bus, comprising:

[0008] In response to the charging deployment instruction, based on the bus shift change time, determine the charging information expected to be generated by each bus to meet the power required for the trip;

[0009] Based on the preset multiple charging demands, the charging information is first iterated; in each round of iteration, the pending demand of this round is selected from the target demand, and the candidate charging information of this round is adjusted by using the adjustment strategy corresponding to the pending demand to obtain the target charging information of this round; wherein the target demand is the charging demand not satisfied by the candidate charging information of this round; the candidate charging information of the first round is the charging information; the candidate charging information of the non-first round is the target charging information of the previous round;

[0010] When the target charging information of any round meets the multiple charging requirements, the first iterative processing is stopped, and the charging plan of each bus is determined according to the target charging behavior at the end of the iteration.

[0011] In a second aspect, an embodiment of the present application provides a charging deployment device for a bus, comprising:

[0012] The information acquisition unit is configured to: determine the charging information expected to be generated by each bus to meet the power required for the trip based on the bus shift change time in response to the charging deployment instruction;

[0013] The iterative processing unit is configured to: perform a first iterative processing on the charging information based on a plurality of preset charging requirements; in each round of iteration, select a to-be-processed requirement of this round from the target requirements, and use an adjustment strategy corresponding to the to-be-processed requirement to adjust the candidate charging information of this round to obtain the target charging information of this round; wherein the target requirement is a charging requirement not satisfied by the candidate charging information of this round; the candidate charging information of the first round is the charging information; and the candidate charging information of the non-first round is the target charging information of the previous round;

[0014] The charging deployment unit is configured to: stop the first iterative processing when the target charging information of any round meets the multiple charging requirements, and determine the charging plan for each bus according to the target charging behavior at the end of the iteration.

[0015] In a third aspect, an embodiment of the present application provides an electronic device, including a data transmission unit and a processor:

[0016] The data transmission unit is configured to: receive a charging deployment instruction;

[0017] The processor is configured to: in response to the charging deployment instruction, determine the charging information expected to be generated by each bus to meet the required power for the trip based on the bus shift change time;

[0018] Based on the preset multiple charging demands, the charging information is first iterated; in each round of iteration, the pending demand of this round is selected from the target demand, and the candidate charging information of this round is adjusted by using the adjustment strategy corresponding to the pending demand to obtain the target charging information of this round; wherein the target demand is the charging demand not satisfied by the candidate charging information of this round; the candidate charging information of the first round is the charging information; the candidate charging information of the non-first round is the target charging information of the previous round;

[0019] When the target charging information of any round meets the multiple charging requirements, the first iterative processing is stopped, and the charging plan of each bus is determined according to the target charging behavior at the end of the iteration.

[0020] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, wherein the computer program includes program instructions, and when the program instructions are executed by a computer, the computer executes any one of the methods described in the first aspect.

[0021] In a fifth aspect, an embodiment of the present application provides a computer program product, comprising: a computer program code, when the computer program code is run on a computer, the computer executes any one of the methods described in the first aspect.

[0022] In the disclosed embodiment, based on the bus shift change time, the charging information that is expected to be generated by each bus to meet the power required for the journey, i.e., the initial charging plan, is determined. Then, based on the preset multiple charging requirements, the charging information is first iteratively processed; in each round of iteration, the pending requirements of this round are selected from the target requirements, and the candidate charging information of this round is adjusted using the adjustment strategy corresponding to the pending requirements to obtain the target charging information of this round; wherein, the target requirements are the charging requirements that are not met by the candidate charging information of this round; the candidate charging information of the first round is the charging information; and the candidate charging information of the non-first round is the target charging information of the previous round. The above process uses multiple rounds of iterations to perform multi-objective optimization on the initial charging plan, so as to obtain an optimization plan that meets the pre-set multiple charging requirements as much as possible, thereby improving the efficiency and applicability of charging deployment.

[0023] Other features and advantages of the present application will be described in the following description, and partly become apparent from the description, or be understood by practicing the present application. The purpose and other advantages of the present application can be realized and obtained by the structures specifically pointed out in the written description, claims, and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0025] Figure 1 A schematic diagram of an application scenario provided for an embodiment of the present application;

[0026] Figure 2 An overall flow chart of a bus charging deployment method provided in an embodiment of the present application;

[0027] Figure 3 A schematic diagram of electricity price information provided in an embodiment of the present application;

[0028] Figure 4 An overall flow chart of the second iterative process provided in an embodiment of the present application;

[0029] Figure 5 A schematic diagram of a process for determining a corresponding screening threshold for a target requirement provided in an embodiment of the present application;

[0030] Figure 6 A schematic diagram of a process for determining reference requirements provided in an embodiment of the present application;

[0031] Figure 7 A schematic diagram of various preset charging requirements provided in an embodiment of the present application;

[0032] Figure 8 A schematic diagram of a solution optimization process for an embodiment of the present application that does not meet the first requirement;

[0033] Fig. 9 A schematic diagram of the structure of a charging deployment device for a bus provided in an embodiment of the present application;

[0034] Fig.10 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0035] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application will be further described in detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present application.

[0036] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. On the contrary, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the attached claims.

[0037] To facilitate understanding of the technical solution provided by this application, the following is a detailed description of the technical background:

[0038] As mentioned above, bus operators usually charge buses in batches during periods when the vehicles are not in operation. However, the amount of electricity after centralized charging may not be enough to complete the subsequent operation of the bus. In order to ensure the operation of the vehicle, bus operators often set some charging requirements from the dimensions of saving costs and improving operational efficiency. These charging costs may include: for example, the charging amount during the peak electricity price period of the day cannot be higher than the preset threshold. For another example, the daily charging amount of the vehicle cannot be lower than the preset lower limit of the charging amount. Bus drivers can combine these charging requirements with the current power of the vehicle to independently choose the charging period of the vehicle during the shift.

[0039] However, this driver-driven charging method strongly relies on the driver's judgment of the timing of charging, and the actual charging behavior often fails to meet most of the charging needs expected by bus operators. For example, when the driver drives to the station to charge, he goes directly on the road due to the lack of idle charging piles, which may cause the vehicle to be unable to fully charge to the minimum limit of the daily charge required. For another example, the driver finds that the vehicle's power may not be able to support the operation of the next shift during the current shift. In order to ensure that the vehicle can run normally during the next shift, the driver can only choose to drive and charge during the bus shift change time at the end of the current shift. Assuming that this happens to be the peak period of electricity prices, this is because the driver did not charge the vehicle in advance during the shift change time of the previous shift, and can only choose to charge during the peak period of electricity prices with higher electricity prices.

[0040] In order to solve the above problems, the inventive concept of the embodiment of the present application is as follows: based on the bus shift change time, determine the charging information that is expected to be generated by each bus to meet the power required for the journey, that is, the initial charging plan. Then, based on the preset multiple charging requirements, the charging information is processed for the first iteration; in each round of iteration, the pending requirements of this round are selected from the target requirements, and the candidate charging information of this round is adjusted using the adjustment strategy corresponding to the pending requirements to obtain the target charging information of this round; wherein, the target requirements are the charging requirements that are not met by the candidate charging information of this round; the candidate charging information of the first round is the charging information; and the candidate charging information of the non-first round is the target charging information of the previous round. The above process uses multiple rounds of iterations to perform multi-objective optimization on the initial charging plan, so as to obtain an optimization plan that meets the pre-set multiple charging requirements as much as possible, thereby improving the efficiency and applicability of charging deployment.

[0041] Figure 1 A schematic diagram of an application scenario of bus charging deployment provided in an embodiment of the present application is shown in FIG. Figure 1 As shown, the application scenario may include: terminal device 101, server 102, and network 103; wherein, terminal device 101 may be a vehicle-mounted terminal deployed on a bus, or a mobile terminal such as a mobile phone, a laptop computer, a tablet, etc.; server 102 may be an independent physical server, or a server cluster or a distributed system composed of multiple physical servers, and the terminal device 101 and server 102 may be directly or indirectly connected in communication through one or more networks 103. The network 103 may be a wired network or a wireless network, for example, the wireless network may be a mobile cellular network, or may be a wireless fidelity (Wireless-Fidelity, WIFI) network, and of course may be other possible networks, which are not limited in the embodiments of the present application.

[0042] The bus charging deployment method in the embodiment of the present application can be executed by the server 102 alone, or by the terminal device 101 and the server 102 in collaboration. For example, relevant personnel can enter the bus operation schedule for a period of time into the server in advance, and the table records the bus operation routes, bus shift times and operation times. Before the bus starts operating every day, the server can determine the expected charging information of each bus to meet the required power for the trip based on the bus shift time.

[0043] In some embodiments, server 102 performs a first iterative processing on the charging information based on multiple built-in charging requirements; in each round of iteration, the pending requirements of this round are selected from the target requirements, and the candidate charging information of this round is adjusted using the adjustment strategy corresponding to the pending requirements to obtain the target charging information of this round; wherein, the target requirements are the charging requirements not met by the candidate charging information of this round; the candidate charging information of the first round is the charging information; the candidate charging information of the non-first round is the target charging information of the previous round; when the target charging information of any round meets multiple charging requirements, the first iterative processing is stopped, and the charging plan for each bus is determined according to the target charging behavior at the end of the iteration.

[0044] In some embodiments, the server 102 may send the charging plan of the bus to the terminal device 101 via the network 103 , and the bus driver may query the terminal device 101 to obtain the charging plan for the day before operation.

[0045] It should be noted that Figure 1 The above is just an example. In fact, the number of terminal devices and servers is not limited, and is not specifically limited in the embodiments of the present application. In addition, in some scenarios, the terminal device 101 and the server 102 can also be the same device, that is, the functions of the terminal device 101 and the server 102 can be implemented by the same device.

[0046] The image processing method provided by the exemplary embodiment of the present application is described below in combination with the application scenarios described above and with reference to the accompanying drawings. It should be noted that the above application scenarios are only shown to facilitate understanding of the spirit and principles of the present application, and the implementation of the present application is not limited in this regard.

[0047] Next, Figure 2 As shown, Figure 2 The overall process of a bus charging deployment method provided by an embodiment of the present application is shown, which specifically includes the following steps:

[0048] Step 201: In response to the charging deployment instruction, based on the bus shift time, determine the charging information that each bus is expected to generate to meet the required power for the trip;

[0049] Taking the example of formulating a charging plan for a bus the day before, the embodiment of the present application can obtain in advance the bus operation plan table for each bus at the bus station on that day, as well as the electricity price information for each designated time period on that day. The bus operation plan table records the operating route, stopovers, bus transfer time and operating time of each bus. The electricity price information can be provided by the power grid for each time period of the day, as shown in the following figure. Figure 3As shown, the electricity price information is based on a specified time period (per hour), recording the corresponding unit prices of electricity consumption for the day's electricity price peak period, electricity price flat period and electricity price valley period.

[0050] When executing step 201, for each bus, the charging information of the bus can be determined based on multiple preset charging conditions, according to the bus shift change time, the charging pile opening time and electricity price information; the multiple preset charging conditions of the embodiment of the present application at least include: the power held by the bus after each charge meets the power required for the current shift, and if the bus shift change time is in the electricity price valley and the battery is not full, charging is performed during the bus shift change time.

[0051] In some embodiments, the rechargeable time period that characterizes the charging behavior of the bus during the bus shift change time can be determined according to the bus shift change time and the time when the charging pile is open to the public, and then the electricity price of each rechargeable time period can be determined according to the electricity price information. On the basis of ensuring that the power held by the bus after each charge meets the power required for the current trip, the charging deployment is carried out based on the principle of "charging as much as possible in the valley period of electricity prices". This principle means that as long as the rechargeable period is in the valley period of electricity prices and the current power held by the vehicle is lower than the preset threshold (for example, 85% of the full power). Charging must be carried out during this period, which can greatly reduce the situation where the bus is forced to charge in the peak period of electricity prices to ensure vehicle operation, thereby reducing operating costs.

[0052] Through the above process, the charging information expected to be generated by each bus under a variety of preset charging conditions can be determined. Each piece of charging information corresponds to a charging behavior of the bus, including the charging period, charging amount, charging price, and the amount of power held after the bus performs a charging behavior. It can be seen that the charging information expected to be generated by each bus obtained through step 201 is equivalent to an initial charging plan. After determining the initial charging plan, the embodiment of the present application optimizes the initial charging plan so that the optimized charging plan can meet the various charging requirements provided by the bus operator as much as possible. The optimization process can be found in subsequent steps 202 and 203.

[0053] Step 202: Based on the preset multiple charging demands, the charging information is subjected to a first iteration process; in each iteration, a demand to be processed in this round is selected from the target demands, and the candidate charging information in this round is adjusted using the adjustment strategy corresponding to the demand to be processed to obtain the target charging information in this round; wherein the target demand is the charging demand not satisfied by the candidate charging information in this round; the candidate charging information in the first round is the charging information; and the candidate charging information in a non-first round is the target charging information in the previous round;

[0054] Step 203: When the target charging information of any round meets the multiple charging requirements, the first iterative processing is stopped, and the charging plan for each bus is determined according to the target charging behavior at the end of the iteration.

[0055] In some embodiments, a corresponding priority and adjustment strategy may be set for each preset charging demand, and the Monte Carlo algorithm may be used to select the pending demand for this round from the target demand. The Monte Carlo algorithm is a statistical numerical calculation method that mainly solves mathematical and physical problems through random sampling. In the charging deployment scenario, it can be used to optimize under highly uncertain factors (such as fluctuations in electricity prices, changes in vehicle power consumption, etc.), and to traverse the optimal solution or approximate optimal solution under multiple uncertain factors by simulating a large number of possible scenarios. When implemented, it can be as follows Figure 4 As shown, the following steps are included:

[0056] Step 401: Determine a screening threshold corresponding to each target demand based on a preset screening value interval and the number of the target demands; wherein the screening threshold is proportional to the priority of the corresponding target demand;

[0057] like Figure 5 As shown in the figure, for N target requirements, the priorities are arranged from high to low as target requirement 1 to target requirement N. During implementation, a screening value interval can be pre-set, usually [0,1]. Then, the screening threshold corresponding to each target requirement is set according to the number of target requirements.

[0058] In some embodiments, an initial screening threshold may be pre-set according to the number of target requirements. Figure 5 Taking target demand 6 as an example, its initial screening threshold can be set to 68.27%. This initial screening threshold is used as the screening threshold for target demand 1 with the highest priority, and then the screening thresholds for the remaining target demands 2 to 6 are calculated by the square, cubic, and Nth powers of the initial screening threshold. That is, the screening threshold for target demand 2 is (68.27%). 2 、The screening threshold for target requirement 3 is (68.27%) 3 ...The screening threshold of target demand N is (68.27%) N .

[0059] Step 402: Based on the screening threshold, perform a second iterative processing on the target demand; in each round of iteration, generate a random number corresponding to each target demand within the screening value range; determine in order of priority from high to low whether the random number corresponding to each target demand is less than the screening threshold of the target demand; if the random number corresponding to any target demand is less than the screening threshold of the target demand, then the target demand is used as the demand to be processed in this round, and the second iterative processing is stopped; otherwise, enter the next round of iteration.

[0060] In each iteration, the embodiment of the present application will only optimize one charging demand that is not satisfied by the candidate charging information in this round, that is, only one demand to be processed is selected from the target demand in each iteration. Figure 5 An example is used to explain: In each iteration, a random number corresponding to each target requirement can be generated in the interval [0,1].

[0061] Then, in order of priority from high to low, determine whether the random number corresponding to each target requirement is less than the screening threshold of the target requirement. For example, the screening threshold of the highest priority target requirement 1 is 68.27%, so first determine whether the random number corresponding to target requirement 1 is less than 68.27%. If it is, stop the iteration and target requirement 1 is the target requirement to be processed in this round. Otherwise, determine whether the random number corresponding to target requirement 2 is less than (68.27%). 2 , and so on. If the pending requirements of this round are not selected from the N target requirements in one round of iteration, the next round of iteration is re-entered, that is, the random number corresponding to each target requirement is regenerated, and the above judgment is repeated in order of priority from high to low until the pending requirements of this round are screened out.

[0062] In each round of iteration, the pending demand of this round can be selected through the above process, and then the candidate charging information of this round is adjusted using the adjustment strategy corresponding to the pending demand to obtain the target charging information of this round.

[0063] It should be understood that one adjustment action in each round of iteration is equivalent to an optimization of the candidate charging information of that round in the direction of meeting the pending demand. However, as explained in the previous article, only one pending demand will be selected from the target demand in each round of iteration, that is, each round of iteration will only optimize a certain pending demand. Therefore, when the target charging information output by any round of iteration meets all the preset charging demands, the first iteration processing can be stopped. Then, the charging plan for each bus is determined according to the target charging behavior at the end of the iteration, and the charging plan can meet each pre-set charging demand.

[0064] In addition, it is considered that in actual scenarios, due to the influence of various uncertain factors, there may be no way to optimize the initial charging plan to meet all charging needs. Based on this, in the process of performing the first iterative processing of the charging information in step 202, it can be determined whether each round of iteration is a tuning iteration, and the number of times the tuning iteration is generated is recorded. That is, each time a tuning iteration is generated, the number of times it is generated is recorded plus one. When the number of times is greater than the preset number threshold, the first iterative processing can be stopped, and the charging plan for each bus can be determined according to the target charging behavior at the end of the iteration.

[0065] In some embodiments, whether each round of iteration is a tuning iteration may be determined in the following manner:

[0066] For any round of iteration, if the target charging information of this round meets the reference demand, the first number of vehicles and the second number of vehicles that do not meet the target demand are determined; the reference demand is the charging demand other than the target demand, and the priority of the reference demand is higher than any target demand; the first number of vehicles is the number of buses that do not meet any target demand in the target charging information of this round; the second number of vehicles is the number of buses that do not meet any target demand in the candidate charging information of this round;

[0067] The reference requirements for each iteration can be Figure 6 Example for determination: It is known that there are 6 preset charging requirements in total, and they are charging requirements 1 to 6 in descending order of priority. Assume that the candidate charging information of this round does not meet charging requirements 3 to 5, and these 3 charging requirements are the target requirements of this round. The reference requirements are charging requirements other than the target requirements and with higher priority than the target requirements, that is, charging requirements 1 to 2 are reference requirements.

[0068] On this basis, it is pre-determined whether the target charging information of this round meets all reference requirements, that is, whether the charging scheme after this round of optimization has introduced any new high-priority demand issues compared to the charging scheme before optimization. If the target charging information does not meet all reference requirements, it means that this round has optimized a low-priority demand problem among multiple preset charging requirements, but introduced a new high-priority demand problem, which is not conducive to the overall solution tuning. Therefore, in the process of determining whether this round of iteration is a tuning iteration, if a new high-priority demand problem is introduced, it is directly determined that this round of iteration does not belong to a tuning iteration.

[0069] Correspondingly, if the target charging information of this round meets all reference requirements, it is necessary to determine whether the first number of vehicles corresponding to each target requirement is lower than the second number of vehicles in order of priority from high to low: the first number of vehicles is equivalent to the number of buses that do not meet this charging requirement in the plan after this round of optimization. The second number of vehicles is equivalent to the number of buses that do not meet this charging requirement in the plan before this round of optimization. For the same target demand, if the first number of vehicles is lower than the second number of vehicles, it means that the demand problem for this target demand has been optimized in the plan after this round of optimization compared to before optimization.

[0070] In some embodiments, if there is at least one first demand in the target demand whose first number of vehicles is lower than the second number of vehicles, and the number of first vehicles corresponding to each target demand with a priority higher than the second demand is not higher than the second number of vehicles, then this round of iteration is determined to be an optimization iteration; wherein the second demand is the first demand with the highest priority. That is, the optimized solution is required to optimize the demand problem of at least one target demand compared to before the optimization, and no more buses with high-priority demand problems can be generated compared to before the optimization.

[0071] Next, the various charging requirements of the embodiments of the present application are explained: the various charging requirements of the embodiments of the present application may include: a first requirement characterizing that the number of idle charging piles is not less than the number of buses that generate candidate charging information; and / or a second requirement characterizing that the total charging amount of any bus in a reference time period does not meet the power threshold corresponding to the reference time period; the reference time period includes at least: night time, electricity price valley period, electricity price peak period and the day of operation; and / or a third requirement characterizing that the average charging price of any bus on the day of operation is lower than the average price threshold.

[0072] In some embodiments, the first to third requirements can be refined as follows: Figure 7 The 6 charging requirements shown are:

[0073] Regarding the first requirement, it has been explained in the above step 201 that when obtaining the initial charging plan, a single vehicle is deployed, that is, the default charging piles are sufficient. However, in the actual charging deployment stage, there may be a lack of idle charging piles when driving to charge, so the first requirement can be corresponding to Figure 7 [Requirement 1: Sufficient charging stations];

[0074] For the second demand, it includes multiple reference time periods, namely, night time, electricity price valley period, electricity price peak period and operation day. Each reference time period corresponds to different demand scenarios.

[0075] Among them, for the demand scenario where the reference period is the night period, as mentioned above, in actual applications, vehicles are usually charged collectively at night. However, due to factors such as differences in vehicle components, the charging rates of vehicles vary. Therefore, bus operators usually require that the charging amount at night cannot be lower than the set lower limit, that is, the corresponding Figure 7 [Requirement 2: Nighttime charging amount meets the standard] is shown.

[0076] As mentioned above, for demand scenarios where the reference time periods are the valley and peak electricity prices, in order to reduce costs, vehicles should try to charge in the valley period when electricity prices are lower, and avoid charging in the peak period when electricity prices are higher, but the premise is that the vehicle can operate normally. In other words, if the vehicle's battery power is insufficient to support the power required for the next trip, charging is required even if the bus changeover time for the current trip is during the peak electricity price period. Therefore, bus operators usually require that the amount of charge for buses during the valley period on that day should not be lower than the set lower limit, that is, the corresponding Figure 7 As shown in [Requirement 3: Increase charging behavior during the electricity price valley period to meet the standard]. Accordingly, the charging amount of the bus during the electricity price peak period on that day should not exceed the set upper limit, that is, Figure 7 [Requirement 4: Reduce charging behavior during peak electricity price periods to meet the standards] as shown.

[0077] For the demand scenario where the reference period is the day of operation, as mentioned above, in order to cope with emergencies, bus operators usually limit the total amount of charging for vehicles on that day, requiring that the total amount of charging for each bus on that day cannot be less than the set lower limit, that is, Figure 7 [Requirement 5: The daily charging amount meets the standard] is shown.

[0078] Regarding the third demand, in order to save costs, bus operators usually limit the average charging price of vehicles on the same day, requiring that the average charging price of each bus on the same day cannot be higher than the set upper limit, that is, Figure 7 [Requirement 6: The average charging price of the day meets the standard] is shown.

[0079] Next, combined with the above Figure 7 The six requirements shown in FIG. 1 are used to describe in detail the process of adjusting the candidate charging information of this round by using the adjustment strategy corresponding to the requirements to be processed in the aforementioned step 202:

[0080] In some embodiments, if the demand to be processed is the first demand, that is, the corresponding Figure 7 As shown in [Requirement 1: Sufficient charging piles], the problem period during the operation day in which the first requirement is not met, and the first bus that generates candidate charging information during the problem period are determined; the charging time of at least one first bus during the problem period is advanced or delayed by a first preset time.

[0081] During implementation, the number of vehicles expected to generate charging behavior at each time point (such as every minute) can be counted in detail based on the candidate charging information of each bus. Figure 8 As shown: at 13:00, a total of 10 buses are expected to charge, at 13:01, a total of 15 buses are expected to charge, at 13:02, a total of 14 buses are expected to charge, at 13:03, a total of 13 buses are expected to charge, at 13:04, a total of 12 buses are expected to charge, at 13:05, a total of 11 buses are expected to charge, and at 13:06, a total of 8 buses are expected to charge. Assuming that there are 10 charging piles in the station, then 13:00-13:01, 13:01-13:02, 13:02-13:03, 13:03-13:04, and 13:04-13:05 are the problem periods when 4 charging piles cannot meet the charging needs of all vehicles, that is, [Requirement 1: Sufficient charging piles] is not met.

[0082] At this time, the same idea as the Monte Carlo algorithm can be used to determine the number of buses that do not meet the demand in each of the four problem periods. Figure 8 As shown, from 13:00 to 13:01, a total of 15 buses are scheduled to charge. Since there are 10 charging piles, the number of buses that fail to meet this demand is 15-10=5.

[0083] Then, the initial screening threshold is determined according to the number of problem periods and the preset screening value range, and the screening threshold corresponding to each problem period is determined based on the initial screening threshold. During implementation, the initial screening threshold can be used as the screening threshold for the problem period with the largest number of public buses that do not meet the demand, and the screening thresholds for the remaining problem periods are calculated in the form of the square, cubic, quartic / quintic of the initial screening threshold in the order of the number of vehicles that do not meet the demand from large to small.

[0084] Continue as Figure 8 As shown, still taking the above screening threshold of 68.27 as an example, the screening threshold corresponding to 13:00-13:01 is 68.27%, and the screening threshold corresponding to 13:01-13:02 is (68.27%). 2 , 13:02~13:03 corresponding screening threshold is (68.27%) 3 , 13:03~13:04 The corresponding screening threshold is (68.27%) 4 , 13:04~13:05 corresponding screening threshold is (68.27%) 5 .

[0085] The same idea as the second iteration process is subsequently adopted to select a problem period from each problem period based on the corresponding screening threshold of each problem period, for example, the problem period 13:00-13:01 is selected. Then, a first bus is randomly selected from the 15 first buses expected to be charged during the problem period, and the charging time of the first bus during the problem period is advanced or delayed by a first preset time. The first preset time can be set according to the actual scenario, and this application does not limit this. For example, it can be set to 2 minutes.

[0086] In some embodiments, if the demand to be processed is the second demand and the reference time period is the night time period, that is, Figure 7 As shown in [Requirement 2: Nighttime charging amount meets the standard], the second bus that does not meet requirement 2 in the candidate charging information can be determined, and the charging time of at least one second bus in at least one electricity price valley period can be extended by a second preset time.

[0087] During implementation, the charging amount of each bus during the night period can be determined based on the candidate charging information of each bus, and then multiple second buses whose charging amount does not meet the standard at night are counted. Then, according to the order of the charging amount of the second buses at night from high to low, the Monte Carlo algorithm is used to set the corresponding screening threshold for each second bus, and a second bus is screened out from multiple second buses in the same manner as the aforementioned second iterative processing flow, and the charging time of the second bus during the night period is extended by a second preset time. The second preset time can be set according to the actual scenario, and this application does not limit this. For example, it can be set to 2 minutes.

[0088] In some embodiments, if the demand to be processed is the second demand and the reference period is the electricity price valley period, that is, Figure 7 As shown in [Requirement 3: Increase charging behavior in the electricity price valley period to meet the standard], the second buses that do not meet requirement 3 in the candidate charging information can be determined, and the charging time of at least one second bus in at least one electricity price valley period can be extended by a second preset time.

[0089] During implementation, the total amount of charge of each bus in all electricity price valleys on the day of operation can be determined based on the candidate charging information of each bus, and then the second buses whose total amount of charge in the electricity price valley does not meet the standard can be counted. Then, according to the order of the total amount of charge of the second buses in the electricity price valley from low to high, the Monte Carlo algorithm is used to set the corresponding screening threshold for each second bus, and a second bus is screened out from multiple second buses in the same manner as the aforementioned second iterative processing flow. One electricity price valley is screened out from the multiple electricity price valleys where the second bus is expected to charge, and the charging time of the second bus in the electricity price valley is extended by the second preset time.

[0090] In some embodiments, if the demand to be processed is the second demand, and the reference period is the peak period of electricity price, that is, Figure 7 As shown in [Requirement 4: Reduce charging behavior during electricity price peak periods to meet the standard], the second buses that do not meet requirement 4 can be determined in the candidate charging information, and the charging time of at least one second bus during at least one electricity price peak period can be shortened by a third preset time.

[0091] During implementation, the total amount of charge of each bus in all electricity price peaks on the day of operation can be determined based on the candidate charging information of each bus, and then the second buses whose total amount of charge in the electricity price peak does not meet the standard can be counted. Then, according to the order of the total amount of charge of the second buses in the electricity price peak from high to low, the Monte Carlo algorithm is used to set the corresponding screening threshold for each second bus, and a second bus is screened out from multiple second buses in the same manner as the aforementioned second iterative processing flow. One electricity price peak is screened out from the multiple electricity price peaks that the second bus is expected to charge, and the charging time of the second bus in the electricity price peak is shortened by a third preset time. The third preset time can be set according to the actual scenario, and this application does not limit this. For example, it can be set to 2 minutes.

[0092] In some embodiments, if the demand to be processed is the second demand and the reference period is the operation day, that is, Figure 7 As shown in [Requirement 5: The charging amount on the day meets the standard], the second buses that do not meet requirement 5 in the candidate charging information can be determined, and the charging time of at least one second bus in at least one electricity price peak period can be extended by a second preset time.

[0093] During implementation, the total charge amount of each bus on the day of operation can be determined based on the candidate charging information of each bus, and then the second buses whose total charge amount does not meet the standard can be counted. Then, according to the order of the total charge amount of the second buses from low to high, the Monte Carlo algorithm is used to set the corresponding screening threshold for each second bus, and a second bus is screened out from multiple second buses in the same manner as the aforementioned second iterative processing flow. An electricity price valley section is screened out from the multiple electricity price valley sections where the second bus is expected to charge, and the charging time of the second bus in the electricity price valley section is extended by a second preset time.

[0094] In some embodiments, if the demand to be processed is the third demand, that is, Figure 7 As shown in [Requirement 6: The average charging price of the day meets the standard], the third bus that does not meet requirement 6 in the candidate charging information can be determined, and the charging time of at least one third bus in at least one electricity price peak period can be shortened by a fourth preset time.

[0095] During implementation, the average charging price of each bus on the day of operation can be determined based on the candidate charging information of each bus, and then the third buses whose average charging prices do not meet the standard can be counted. Then, according to the order of the average charging prices of the third buses from high to low, the Monte Carlo algorithm is used to set the corresponding screening threshold for each third bus, and a third bus is screened out from multiple third buses in the same manner as the aforementioned second iterative processing flow. A valley section of electricity price is screened out from the multiple valley sections of electricity price that the third bus is expected to charge, and the charging time of the third bus in the peak section of electricity price is shortened by a fourth preset time, and / or, a peak section of electricity price is screened out from the multiple peak sections of electricity price that the third bus is expected to charge, and the charging time of the third bus in the peak section of electricity price is shortened by a fourth preset time.

[0096] It should be noted that the third preset duration can be set according to the actual scenario, and this application does not limit this. In some embodiments, since demand 6 in this application is the charging demand with the lowest priority, it is expected that the optimization proportion of demand 6 in the optimization process is the smallest, so the fourth preset duration can be set shorter than other preset durations, for example, it can be set to 1 minute.

[0097] Through the above process, the embodiment of the present application sets corresponding priorities and tuning strategies for multiple preset charging requirements. By combining the Monte Carlo algorithm in the first iterative processing process, the initial charging plan is iteratively tuned to meet the charging requirements for multiple rounds, so as to obtain an optimized plan that meets the pre-set multiple charging requirements as much as possible, thereby improving the efficiency and applicability of charging deployment.

[0098] Based on the same inventive concept, the present application embodiment also provides a charging deployment device for a bus, specifically as follows: Fig. 9 As shown, including:

[0099] The information acquisition unit 901 is configured to: determine the charging information expected to be generated by each bus to meet the required power for the trip based on the bus shift time in response to the charging deployment instruction;

[0100] The iterative processing unit 902 is configured to: perform a first iterative processing on the charging information based on a plurality of preset charging requirements; in each round of iteration, select a to-be-processed requirement of this round from the target requirements, and use an adjustment strategy corresponding to the to-be-processed requirement to adjust the candidate charging information of this round to obtain the target charging information of this round; wherein the target requirement is a charging requirement not satisfied by the candidate charging information of this round; the candidate charging information of the first round is the charging information; and the candidate charging information of the non-first round is the target charging information of the previous round;

[0101] The charging deployment unit 903 is configured to: stop the first iterative processing when the target charging information of any round meets the multiple charging requirements, and determine the charging plan for each bus according to the target charging behavior at the end of the iteration.

[0102] In some embodiments, to perform the method of determining the amount of electricity required by each bus to meet the travel schedule based on the bus shift change time, and the estimated charging information, the information acquisition unit 901 is specifically configured as follows:

[0103] Obtaining electricity price information for each designated time period on the operation day; wherein each designated time period is divided into: electricity price peak period, electricity price flat period and electricity price valley period in descending order of electricity price;

[0104] For each bus, based on multiple preset charging conditions, the charging information of the bus is determined according to the bus shift change time, the opening time of the charging pile and the electricity price information; wherein each charging information corresponds to a charging behavior of the bus, including the charging time period, charging amount, charging price and the remaining power after charging when the bus performs a charging behavior; the multiple preset charging conditions at least include: the remaining power of the bus after each charging meets the power required for the current shift, and, if the bus shift change time is in the electricity price valley and the power is lower than the preset threshold, then charging is carried out during the bus shift change time.

[0105] In some embodiments, the execution of the multiple charging demands is set with corresponding priorities; the iterative processing unit 902 is specifically configured to select the demand to be processed in this round from the target demand:

[0106] Based on a preset screening value interval and the number of the target requirements, determining a screening threshold corresponding to each target requirement; wherein the screening threshold is proportional to the priority of the corresponding target requirement;

[0107] Based on the screening threshold, the target demand is subjected to a second iterative processing; in each round of iteration, a random number corresponding to each target demand is generated within the screening value range; in order of priority from high to low, it is determined in turn whether the random number corresponding to each target demand is less than the screening threshold of the target demand; if the random number corresponding to any target demand is less than the screening threshold of the target demand, the target demand is used as the demand to be processed in this round, and the second iterative processing is stopped; otherwise, the next round of iteration is entered.

[0108] In some embodiments, the charging deployment unit 903 is further configured to:

[0109] During the first iterative processing of the charging information, when any round of iteration is the tuning iteration and the number of tuning iterations is greater than a preset number threshold, the first iterative processing is stopped;

[0110] Among them, whether each round of iteration is a tuning iteration is determined in the following way:

[0111] For any round of iteration, if the target charging information of this round meets the reference demand, the first number of vehicles and the second number of vehicles that do not meet the target demand are determined; the reference demand is a charging demand other than the target demand, and the priority of the reference demand is higher than any target demand; the first number of vehicles is the number of buses that do not meet any target demand in the target charging information of this round; the second number of vehicles is the number of buses that do not meet any target demand in the candidate charging information of this round;

[0112] In order from high to low priority, determine whether the first number of vehicles corresponding to each target demand is lower than the second number of vehicles: if there is at least one first demand among the target demands whose first number of vehicles is lower than the second number of vehicles, and the first number of vehicles corresponding to each target demand with a priority higher than the second demand is not higher than the second number of vehicles, then determine that this round of iteration is the tuning iteration; the second demand is the first demand with the highest priority.

[0113] In some embodiments, the multiple charging requirements include:

[0114] A first requirement representing that the number of idle charging piles is not less than the number of buses generating the candidate charging information; and / or,

[0115] A second requirement indicating that the total amount of charge of any bus in a reference period does not meet the power threshold corresponding to the reference period; the reference period at least includes: night time, electricity price valley period, electricity price peak period and operation day; and / or,

[0116] The third demand represents that the average charging price of any bus on the operation day is lower than the average price threshold.

[0117] In some embodiments, the adjustment strategy corresponding to the demand to be processed is used to adjust the candidate charging information of this round, and the iterative processing unit 902 is specifically configured to:

[0118] If the demand to be processed is the first demand, determining a problem period that does not meet the first demand on the operation day, and a first bus that generates the candidate charging information during the problem period;

[0119] The charging time of at least one first bus during the problem period is advanced or delayed by a first preset time period.

[0120] In some embodiments, the adjustment strategy corresponding to the demand to be processed is used to adjust the candidate charging information of this round, and the iterative processing unit 902 is specifically configured to:

[0121] If the demand to be processed is the second demand, determining a second bus in the candidate charging information that does not meet the second demand;

[0122] If the reference time period is the night time period, extending the charging time of at least one second bus in the night time period by a second preset time period;

[0123] If the reference time period is the electricity price valley period or the operation day, the charging time of at least one second bus in at least one electricity price valley period is extended by a second preset time period;

[0124] If the reference time period is the electricity price peak period, the charging time of at least one second bus in at least one electricity price peak period is shortened by a third preset time length.

[0125] In some embodiments, the adjustment strategy corresponding to the demand to be processed is used to adjust the candidate charging information of this round, and the iterative processing unit 902 is specifically configured to:

[0126] If the demand to be processed is the third demand, determining a third bus in the candidate charging information that does not meet the second demand;

[0127] The charging time of at least one third bus in at least one electricity price peak period is shortened by a fourth preset time period, and / or the charging time of at least one third bus in at least one electricity price valley period is extended by a fourth preset time period; wherein the fourth preset time period is not longer than the first preset time period, the second preset time period and the third preset time period.

[0128] Based on the same inventive concept, the present application embodiment also provides an electronic device, specifically Fig.10 As shown, it may include a data transmission unit 1001 and a processor 1002:

[0129] The data transmission unit 1001 is configured to: receive a charging deployment instruction;

[0130] The processor 1002 is configured to: determine, in response to the charging deployment indication, charging information expected to be generated by each bus to meet the required power for the trip based on the bus shift change time;

[0131] Based on the preset multiple charging demands, the charging information is first iterated; in each round of iteration, the pending demand of this round is selected from the target demand, and the candidate charging information of this round is adjusted by using the adjustment strategy corresponding to the pending demand to obtain the target charging information of this round; wherein the target demand is the charging demand not satisfied by the candidate charging information of this round; the candidate charging information of the first round is the charging information; the candidate charging information of the non-first round is the target charging information of the previous round;

[0132] When the target charging information of any round meets the multiple charging requirements, the first iterative processing is stopped, and the charging plan of each bus is determined according to the target charging behavior at the end of the iteration.

[0133] In some embodiments, to perform the process of determining the amount of electricity required by each bus to meet the travel requirements based on the bus shift change time and the estimated charging information, the processor 1002 is specifically configured to:

[0134] Obtaining electricity price information for each designated time period on the operation day; wherein each designated time period is divided into: electricity price peak period, electricity price flat period and electricity price valley period in descending order of electricity price;

[0135] For each bus, based on multiple preset charging conditions, the charging information of the bus is determined according to the bus shift change time, the opening time of the charging pile and the electricity price information; wherein each charging information corresponds to a charging behavior of the bus, including the charging time period, charging amount, charging price and the remaining power after charging when the bus performs a charging behavior; the multiple preset charging conditions at least include: the remaining power of the bus after each charging meets the power required for the current shift, and, if the bus shift change time is in the electricity price valley and the power is lower than the preset threshold, then charging is carried out during the bus shift change time.

[0136] In some embodiments, the execution of the multiple charging demands is set with corresponding priorities; the processor 1002 is specifically configured to:

[0137] Based on a preset screening value interval and the number of the target requirements, determining a screening threshold corresponding to each target requirement; wherein the screening threshold is proportional to the priority of the corresponding target requirement;

[0138] Based on the screening threshold, the target demand is subjected to a second iterative processing; in each round of iteration, a random number corresponding to each target demand is generated within the screening value range; in order of priority from high to low, it is determined in turn whether the random number corresponding to each target demand is less than the screening threshold of the target demand; if the random number corresponding to any target demand is less than the screening threshold of the target demand, the target demand is used as the demand to be processed in this round, and the second iterative processing is stopped; otherwise, the next round of iteration is entered.

[0139] In some embodiments, the processor 1002 is further configured to:

[0140] During the first iterative processing of the charging information, when any round of iteration is the tuning iteration and the number of tuning iterations is greater than a preset number threshold, the first iterative processing is stopped;

[0141] Among them, whether each round of iteration is a tuning iteration is determined in the following way:

[0142] For any round of iteration, if the target charging information of this round meets the reference demand, the first number of vehicles and the second number of vehicles that do not meet the target demand are determined; the reference demand is a charging demand other than the target demand, and the priority of the reference demand is higher than any target demand; the first number of vehicles is the number of buses that do not meet any target demand in the target charging information of this round; the second number of vehicles is the number of buses that do not meet any target demand in the candidate charging information of this round;

[0143] In order from high to low priority, determine whether the first number of vehicles corresponding to each target demand is lower than the second number of vehicles: if there is at least one first demand among the target demands whose first number of vehicles is lower than the second number of vehicles, and the first number of vehicles corresponding to each target demand with a priority higher than the second demand is not higher than the second number of vehicles, then determine that this round of iteration is the tuning iteration; the second demand is the first demand with the highest priority.

[0144] In some embodiments, the multiple charging requirements include:

[0145] A first requirement representing that the number of idle charging piles is not less than the number of buses generating the candidate charging information; and / or,

[0146] A second requirement indicating that the total amount of charge of any bus in a reference period does not meet the power threshold corresponding to the reference period; the reference period at least includes: night time, electricity price valley period, electricity price peak period and operation day; and / or,

[0147] The third demand represents that the average charging price of any bus on the operation day is lower than the average price threshold.

[0148] In some embodiments, the processor 1002 is specifically configured to:

[0149] If the demand to be processed is the first demand, determining a problem period that does not meet the first demand on the operation day, and a first bus that generates the candidate charging information during the problem period;

[0150] The charging time of at least one first bus during the problem period is advanced or delayed by a first preset time period.

[0151] In some embodiments, the processor 1002 is specifically configured to:

[0152] If the demand to be processed is the second demand, determining a second bus in the candidate charging information that does not meet the second demand;

[0153] If the reference time period is the night time period, extending the charging time of at least one second bus in the night time period by a second preset time period;

[0154] If the reference time period is the electricity price valley period or the operation day, the charging time of at least one second bus in at least one electricity price valley period is extended by a second preset time period;

[0155] If the reference time period is the electricity price peak period, the charging time of at least one second bus in at least one electricity price peak period is shortened by a third preset time length.

[0156] In some embodiments, the processor 1002 is specifically configured to:

[0157] If the demand to be processed is the third demand, determining a third bus in the candidate charging information that does not meet the second demand;

[0158] The charging time of at least one third bus in at least one electricity price peak period is shortened by a fourth preset time period, and / or the charging time of at least one third bus in at least one electricity price valley period is extended by a fourth preset time period; wherein the fourth preset time period is not longer than the first preset time period, the second preset time period and the third preset time period.

[0159] An embodiment of the present application also provides a computer storage medium, in which computer program instructions are stored. When the instructions are executed on a computer, the computer executes any one of the steps of the above-mentioned method for determining the departure frequency.

[0160] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

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

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

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

[0164] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A method for deploying charging for a bus, characterized in that: include: In response to the charging deployment instruction, based on the bus shift change time, determine the charging information expected to be generated by each bus to meet the power required for the trip; Based on the preset multiple charging demands, the charging information is first iterated; in each round of iteration, the pending demand of this round is selected from the target demand, and the candidate charging information of this round is adjusted by using the adjustment strategy corresponding to the pending demand to obtain the target charging information of this round; wherein the target demand is the charging demand not satisfied by the candidate charging information of this round; the candidate charging information of the first round is the charging information; the candidate charging information of the non-first round is the target charging information of the previous round; When the target charging information of any round meets the multiple charging requirements, the first iterative processing is stopped, and the charging plan of each bus is determined according to the target charging behavior at the end of the iteration.

2. The method according to claim 1, characterized in that The estimated charging information for determining the amount of electricity required for each bus to meet the trip based on the bus shift change time includes: Obtaining electricity price information for each designated time period on the operation day; wherein each designated time period is divided into: electricity price peak period, electricity price flat period and electricity price valley period in descending order of electricity price; For each bus, based on multiple preset charging conditions, the charging information of the bus is determined according to the bus shift change time, the opening time of the charging pile and the electricity price information; wherein each charging information corresponds to a charging behavior of the bus, including the charging time period, charging amount, charging price and the remaining power after charging when the bus performs a charging behavior; the multiple preset charging conditions at least include: the remaining power of the bus after each charging meets the power required for the current shift, and, if the bus shift change time is in the electricity price valley and the power is lower than the preset threshold, then charging is carried out during the bus shift change time.

3. The method according to claim 1, characterized in that The multiple charging demands are provided with corresponding priorities; the selecting of the demand to be processed in this round from the target demands comprises: Based on a preset screening value interval and the number of the target requirements, determining a screening threshold corresponding to each target requirement; wherein the screening threshold is proportional to the priority of the corresponding target requirement; Based on the screening threshold, the target demand is subjected to a second iterative processing; in each round of iteration, a random number corresponding to each target demand is generated within the screening value range; in order of priority from high to low, it is determined in turn whether the random number corresponding to each target demand is less than the screening threshold of the target demand; if the random number corresponding to any target demand is less than the screening threshold of the target demand, the target demand is used as the demand to be processed in this round, and the second iterative processing is stopped; otherwise, the next round of iteration is entered.

4. The method according to claim 3, characterized in that The method further comprises: During the first iterative processing of the charging information, when any round of iteration is the tuning iteration and the number of tuning iterations is greater than a preset number threshold, the first iterative processing is stopped; Among them, whether each round of iteration is a tuning iteration is determined in the following way: For any round of iteration, if the target charging information of this round meets the reference demand, the first number of vehicles and the second number of vehicles that do not meet the target demand are determined; the reference demand is a charging demand other than the target demand, and the priority of the reference demand is higher than any target demand; the first number of vehicles is the number of buses that do not meet any target demand in the target charging information of this round; the second number of vehicles is the number of buses that do not meet any target demand in the candidate charging information of this round; In order from high to low priority, determine whether the first number of vehicles corresponding to each target demand is lower than the second number of vehicles: if there is at least one first demand among the target demands whose first number of vehicles is lower than the second number of vehicles, and the first number of vehicles corresponding to each target demand with a priority higher than the second demand is not higher than the second number of vehicles, then determine that this round of iteration is the tuning iteration; the second demand is the first demand with the highest priority.

5. The method according to any one of claims 1 to 4, characterized in that: The various charging requirements include: A first requirement representing that the number of idle charging piles is not less than the number of buses generating the candidate charging information; and / or, A second requirement indicating that the total amount of charge of any bus in a reference period does not meet the power threshold corresponding to the reference period; the reference period at least includes: night time, electricity price valley period, electricity price peak period and operation day; and / or, The third demand represents that the average charging price of any bus on the operation day is lower than the average price threshold.

6. The method according to claim 5, characterized in that The step of adjusting the candidate charging information of this round by using the adjustment strategy corresponding to the demand to be processed includes: If the demand to be processed is the first demand, determining a problem period that does not meet the first demand on the operation day, and a first bus that generates the candidate charging information during the problem period; The charging time of at least one first bus during the problem period is advanced or delayed by a first preset time period.

7. The method according to claim 5, characterized in that The step of adjusting the candidate charging information of this round by using the adjustment strategy corresponding to the demand to be processed includes: If the demand to be processed is the second demand, determining a second bus in the candidate charging information that does not meet the second demand; If the reference time period is the night time period, extending the charging time of at least one second bus in the night time period by a second preset time period; If the reference time period is the electricity price valley period or the operation day, the charging time of at least one second bus in at least one electricity price valley period is extended by a second preset time period; If the reference time period is the electricity price peak period, the charging time of at least one second bus in at least one electricity price peak period is shortened by a third preset time length.

8. The method according to claim 5, characterized in that The step of adjusting the candidate charging information of this round by using the adjustment strategy corresponding to the demand to be processed includes: If the demand to be processed is the third demand, determining a third bus in the candidate charging information that does not meet the second demand; The charging time of at least one third bus in at least one electricity price peak period is shortened by a fourth preset time period, and / or the charging time of at least one third bus in at least one electricity price valley period is extended by a fourth preset time period; wherein the fourth preset time period is not longer than the first preset time period, the second preset time period and the third preset time period.

9. An electronic device, characterized in that: Including data transmission unit and processor: The data transmission unit is configured to: receive a charging deployment instruction; The processor is configured to: in response to the charging deployment instruction, determine the charging information expected to be generated by each bus to meet the required power for the trip based on the bus shift change time; Based on the preset multiple charging demands, the charging information is first iterated; in each round of iteration, the pending demand of this round is selected from the target demand, and the candidate charging information of this round is adjusted by using the adjustment strategy corresponding to the pending demand to obtain the target charging information of this round; wherein the target demand is the charging demand not satisfied by the candidate charging information of this round; the candidate charging information of the first round is the charging information; the candidate charging information of the non-first round is the target charging information of the previous round; When the target charging information of any round meets the multiple charging requirements, the first iterative processing is stopped, and the charging plan of each bus is determined according to the target charging behavior at the end of the iteration.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, wherein the computer program includes program instructions, and when the program instructions are executed by a computer, the computer executes the method according to any one of claims 1 to 8.

Images