Low-carbon garbage classification collection and transportation method and system based on improved brainstorming algorithm
By improving the brainstorming algorithm, establishing a dual-objective optimization model, and optimizing the garbage classification collection and transportation path, the complex algorithm and path optimization problems in the existing technology are solved, effective considerations for garbage transfer stations and classification are achieved, and transportation costs and carbon emissions are reduced. , support sustainable development.
Patent Information
- Application Number
- CN202010646773.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2020-07-07
- Publication Date
- 2024-11-19
- Estimated Expiration
- 2040-07-07
AI Technical Summary
The algorithms in the prior art are complex, and it is impossible to effectively optimize the garbage classification collection and transportation path, ignore the role of the transit station, and it is difficult to optimize the garbage classification collection and transportation.
Using improved brainstorming algorithms, a dual-objective optimization model is established. The goal is to minimize the total vehicle mileage and carbon emissions. By initializing algorithm parameters, randomly generating initial populations, clustering, selection operations and differential variation operations, the archive set is updated, and the archive set is provided. Path planning scheme.
Effectively optimize the garbage classification collection and transportation path, consider garbage transfer stations and classification, reduce transportation costs and carbon emissions, respond to the national garbage classification policy, and achieve sustainable development.
Smart Images

Figure CN111815048B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of garbage collection and transportation, and in particular to a low-carbon garbage classification collection and transportation method and system based on an improved brainstorming algorithm. Background Art
[0002] With the rapid development of economy and the increase of urbanization rate, the amount of urban domestic waste has exploded, and the improvement of people's living standards has also made the types of waste more and more complicated. According to incomplete statistics, the world produces tens of billions of tons of garbage every year, and only 15% of the garbage is recycled, and the rest of the garbage is treated by incineration and landfill, causing serious environmental pollution. Garbage classification can effectively improve this situation, maximize the utilization of garbage resources, reduce the amount of garbage disposal, and improve the living environment. Garbage collection and transportation is an important intermediate link connecting the source of garbage generation and the disposal system, and it occupies a very important position in garbage management and treatment projects. According to statistics, in the entire garbage disposal system, the cost of garbage collection and transportation accounts for 60%-80%. In many cities, garbage trucks often empty garbage cans along fixed routes, but this is not an efficient method, resulting in a lot of manpower and financial losses. Therefore, it is of great practical significance to reasonably and scientifically formulate the collection and transportation routes of garbage trucks to reduce the cost of garbage collection and transportation and promote the sustainable development of urban economy and society.
[0003] At present, the garbage collection and transportation problem is mostly abstracted as a vehicle routing problem for optimization and solution. In reality, garbage collection and transportation work is first collected from garbage bins by small vehicles and sent to transfer stations for pre-processing, and then transported to different processing centers by large vehicles. However, due to the difficulty of modeling and the complexity of solving, most existing studies ignore the role of transfer stations and only examine the garbage collection vehicle routes between the garbage source and the processing center. At the same time, existing studies rarely consider garbage classification collection, because the garbage classification collection and transportation problem is more complicated than the simple garbage collection and transportation problem. The difficulty lies in the increase of modeling decision variables and the increase of problem dimensions when solving. Therefore, not only is the algorithm complex, but it also cannot achieve the purpose of optimizing the garbage classification collection and transportation route. Summary of the invention
[0004] To this end, the technical problem to be solved by the present invention is to overcome the problem in the prior art that the algorithm is complex and cannot optimize the garbage classification collection and transportation path, thereby providing a low-carbon garbage classification collection and transportation method and system based on an improved brainstorming algorithm that has a simple algorithm and can effectively improve the optimization of the garbage classification collection and transportation path.
[0005] To solve the above technical problems, the present invention provides a low-carbon garbage classification collection and transportation method based on an improved brainstorming algorithm. According to the set constraints and the two defined objectives, a dual-objective optimization model is established, wherein the two defined objectives are: minimizing the total vehicle mileage and minimizing carbon emissions; an improved brainstorming algorithm is used to solve the dual-objective optimization model, and a corresponding path planning scheme is provided according to the Pareto solution after the solution, wherein the improved brainstorming algorithm is as follows: initializing algorithm parameters and randomly generating an initial population; clustering the initial population and clustering individuals with the same priority into one category; evaluating individuals and selecting the best individual in each category as the center of the category; performing a selection operation; performing a differential mutation operation on the selected individuals, updating an archive set according to the dominance relationship, and outputting a path planning according to the updated archive set.
[0006] In one embodiment of the present invention, the initialization algorithm parameters include: population size Q, archive set, next generation population generation control parameters, and maximum number of iterations.
[0007] In one embodiment of the present invention, the randomly generated initial population includes Q individuals or solutions represented by real number codes.
[0008] In one embodiment of the present invention, the method for clustering the initial population is: clustering the population according to Pareto priority.
[0009] In one embodiment of the present invention, the method for performing the selection operation is: after generating a random number, determine whether the random number is less than a first control parameter. If so, randomly select a cluster center and randomly generate a new individual to replace the randomly selected cluster center, and then generate a second random number; if not, generate a second random number and continue to process the second random number until a differential mutation operation is performed on the selected individual.
[0010] In one embodiment of the present invention, the method for processing the second random number is: determine whether the second random number is less than a second control parameter, and if so, randomly select an individual from the current archive set as the currently selected individual; if not, generate a third random number and process the third random number.
[0011] In one embodiment of the present invention, the method for processing the third random number is: determine whether the third random number is less than a third control parameter, if so, select a class, generate a fourth random number, and continue processing the fourth random number; if not, select two classes, generate a fifth random number, and continue processing the fifth random number.
[0012] In one embodiment of the present invention, the method for continuing to process the fourth random number is: determine whether the fourth random number is less than the fourth control parameter, if so, select the center of the class as the currently selected individual, if not, randomly select an individual in the class as the currently selected individual; the method for continuing to process the fifth random number is: determine whether the fifth random number is less than the fifth control parameter, if so, take the linear combination of the two class centers as the currently selected individual, if not, take the linear combination of two random individuals in the two classes as the currently selected individual.
[0013] In one embodiment of the present invention, after performing differential mutation operation on the selected individuals, the archive set is updated according to the dominance relationship to determine whether the maximum number of iterations has been reached. If so, a corresponding path planning scheme is provided according to the solved Pareto solution; if not, the process returns to the step of clustering the initial population.
[0014] The present invention also provides a low-carbon garbage classification collection and transportation system based on an improved brainstorming algorithm, comprising: a modeling module, used to establish a dual-objective optimization model according to set constraints and two defined goals, wherein the two defined goals are: minimizing the total vehicle mileage and minimizing carbon emissions; a planning module, used to solve the dual-objective optimization model using an improved brainstorming algorithm, and provide a corresponding path planning scheme according to the Pareto solution after the solution, wherein the improved brainstorming algorithm is: initializing algorithm parameters, randomly generating an initial population; clustering the initial population, clustering individuals with the same priority into one category; evaluating individuals, selecting the best individual in each category as the center of the category; performing selection operations; performing differential mutation operations on the selected individuals, and updating the archive set according to the dominance relationship.
[0015] The above technical solution of the present invention has the following advantages compared with the prior art:
[0016] The low-carbon garbage classification collection and transportation method and system based on the improved brainstorming algorithm described in the present invention takes into account the garbage transfer station and garbage classification, is more in line with the actual garbage collection and transportation situation, responds to the garbage classification policy proposed by the country, and combines the two-stage, multi-station vehicle path problem with garbage collection and transportation, which has practical significance; a dual-objective model is proposed, which not only takes into account the total mileage of the garbage truck, but also takes into account carbon emissions, which can not only help the sanitation department save economic costs, but also help it fulfill its social responsibility of protecting the environment and achieve sustainable development. Although the two proposed goals conflict with each other, the Pareto equilibrium solution of the two goals can be found; the brainstorming algorithm is improved, and the coding method, clustering method, mutation method, etc. are designed, so that the improved brainstorming algorithm can effectively solve the dual-objective optimization problem. Finally, the effectiveness and superiority of the model and algorithm are proved by examples, and some Pareto equilibrium solutions about total mileage and carbon emissions are obtained, which can effectively reduce transportation costs and carbon emissions, and provide reference for the sanitation department. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] In order to make the content of the present invention more clearly understood, the present invention is further described in detail below according to specific embodiments of the present invention in conjunction with the accompanying drawings, wherein
[0018] Figure 1 It is a flow chart of the low-carbon garbage classification collection and transportation method based on the improved brainstorming algorithm of the present invention;
[0019] Figure 2 It is a schematic diagram of the four-layer encoding method of the present invention;
[0020] Figure 3 It is a schematic diagram of the rank clustering method of the present invention;
[0021] Figure 4 It is a schematic diagram of the selection operation of the present invention;
[0022] Figure 5 The coordinates of each garbage classification delivery point, the amount of garbage and other information of the present invention;
[0023] Figure 6 The coordinates of the garbage transfer station and the garbage treatment center of the present invention;
[0024] Figure 7 It is the box plot of the hypervolume index of the three algorithms;
[0025] Figure 8 It is a Pareto frontier curve graph;
[0026] Figure 9a This is the schematic diagram of the first stage of the route of the garbage collection vehicle obtained through improvement and optimization;
[0027] Figure 9b This is the improved and optimized path diagram of the garbage collection vehicle in the second stage;
[0028] Fig.10 It is the path representation of the garbage collection vehicle. DETAILED DESCRIPTION
[0029] Embodiment 1
[0030] like Figure 1As shown, this embodiment provides a low-carbon garbage classification collection and transportation method based on an improved brainstorming algorithm, comprising the following steps: Step S1: Establish a dual-objective optimization model based on set constraints and two defined goals, wherein the two defined goals are: minimizing the total vehicle mileage and minimizing carbon emissions; Step S2: Use an improved brainstorming algorithm to solve the dual-objective optimization model, and provide a corresponding path planning scheme based on the Pareto solution after the solution, wherein the improved brainstorming algorithm is: initialize algorithm parameters, randomly generate an initial population; cluster the initial population, and cluster individuals with the same priority into one category; evaluate individuals, and select the best individual in each category as the center of the category; perform a selection operation; perform a differential mutation operation on the selected individuals, update the archive set according to the dominance relationship, and output the path planning according to the updated archive set.
[0031] In the low-carbon garbage classification collection and transportation method based on the improved brainstorming algorithm described in this embodiment, in the step S1, a dual-objective optimization model is established according to the set constraints and the two defined goals, wherein the two defined goals are: minimizing the total mileage of the vehicle and minimizing carbon emissions. Not only the total mileage of the garbage truck but also the carbon emissions are considered. Although the two proposed goals conflict with each other, a Pareto equilibrium solution of the two goals can be found, thereby helping the sanitation department save economic costs and fulfilling its social responsibility of protecting the environment and achieving sustainable development; in the step S2, an improved brainstorming algorithm is used to solve the dual-objective optimization model, and corresponding path planning is provided according to the Pareto solution after the solution. The scheme, wherein the improved brainstorming algorithm is: initialize the algorithm parameters, randomly generate the initial population; cluster the initial population, and cluster individuals with the same priority into one category; evaluate the individuals, select the best individual in each category as the center of the category; perform selection operation; perform differential mutation operation on the selected individuals, update the archive set according to the dominance relationship, and output the path planning according to the updated archive set. Since the optimal value in the archive set is the Pareto optimal solution set, the best path planning scheme can be provided according to the Pareto solution after solution. The improved brainstorming algorithm designed by the present invention includes coding method, clustering method, mutation method, etc., so that the improved brainstorming algorithm can effectively solve the dual-objective optimization problem. Finally, the effectiveness and superiority of the model and algorithm are proved by examples, and some Pareto equilibrium solutions for total mileage and carbon emissions are obtained, which can effectively reduce transportation costs and carbon emissions, and provide reference for the sanitation department, which is conducive to optimizing the garbage classification collection and transportation path according to the established model.
[0032] The formula for minimizing the total vehicle mileage is:
[0033]
[0034] where dij is the distance from node i to node j, x ij is a decision variable, which takes 1 if the vehicle passes through arc (i, j); otherwise, it takes 0. Formula (1) is the objective function 1, which means that the total mileage of the garbage truck is the smallest, that is, the cost is the lowest.
[0035] The formula for minimizing carbon emissions is:
[0036]
[0037] Where ξ is the conversion coefficient between carbon emission and fuel consumption, ρ 0 is the no-load fuel consumption rate, ρ * is the full-load fuel consumption rate. Formula (2) is the objective function 2, which means that the carbon emission in the garbage collection and transportation process is minimized.
[0038] The constraints include: the collection vehicles depart from the garbage transfer station by means of classified combined transportation, collect and transport the garbage from the garbage classification points according to the optimized route, and finally return to the original garbage transfer station. Then the garbage disposal center sends vehicles to each garbage transfer station to collect and transport various types of garbage; each garbage classification point is responsible for a collection vehicle; the total vehicle load at any point on the route is not greater than the vehicle carrying capacity; the capacity of the garbage transfer station is limited; the disposal center cannot directly send vehicles to the garbage classification points to collect and transport garbage. Specifically, it includes the formula:
[0039]
[0040] where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0. Formula (3) ensures that there is only one car responsible for each garbage sorting point.
[0041]
[0042] where w ij is a decision variable. If the garbage classification point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (4) ensures that each garbage classification point is assigned to and only to one garbage transfer station.
[0043]
[0044] where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; Formula (5) is a flow constraint, which ensures that the number of vehicles arriving at each node is the same as the number of vehicles leaving the node;
[0045]
[0046] where w ijis a decision variable. If the garbage sorting delivery point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (6) ensures that if a path includes a transfer station and a delivery point, the delivery point must be assigned to the transfer station.
[0047]
[0048] in is the amount of recyclable garbage at garbage sorting point i; is the amount of non-recyclable garbage at garbage sorting point i; Formula (7) is about the amount of garbage;
[0049]
[0050] in is the amount of recyclable garbage at garbage sorting point i; w ij is a decision variable. If the garbage classification delivery point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (8) is about the amount of garbage;
[0051]
[0052] in is the amount of non-recyclable garbage at garbage sorting point i; w ij is a decision variable. If the garbage classification delivery point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (9) is about the amount of garbage;
[0053]
[0054] where w ij is a decision variable. If the garbage sorting point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (10) ensures that the amount of garbage allocated to the transfer station is not greater than the maximum capacity of the transfer station.
[0055]
[0056] where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0;
[0057]
[0058] in is the amount of recyclable garbage at garbage sorting point i; x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0;
[0059]
[0060] in is the amount of non-recyclable garbage at garbage sorting point i; x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0;
[0061] The above formulas (11)-(13) can ensure that the total vehicle load at any point on any route is not greater than the vehicle carrying capacity;
[0062]
[0063] where x ij is a decision variable, which takes 1 if the car passes through arc (i, j); otherwise, it takes 0; w ij is a decision variable. If the garbage sorting point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0.
[0064]
[0065] where w ij is a decision variable. If the garbage sorting point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0.
[0066] The above formulas (14) and (15) ensure that each path starts from the same transfer station and eventually returns to the transfer station;
[0067]
[0068] Where Q ij is the actual load of the vehicle on arc (i, j);
[0069]
[0070] where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0;
[0071]
[0072] where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0;
[0073]
[0074] where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0;
[0075] The above formulas (16)-(19) are about the actual load of the vehicle at each node;
[0076]
[0077] where xij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0;
[0078]
[0079] where w ij is a decision variable. If the garbage sorting point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0.
[0080] The above formulas (20) and (21) are 0-1 constraints on variables.
[0081] The initialization algorithm parameters include: population size Q, archive set, next generation population generation control parameters, and maximum number of iterations. The control parameters include the first control parameter P 5a , the second control parameter P 6b , the third control parameter P 6bi , the fourth control parameter P 6biii , and the fifth control parameter P 6c .
[0082] The randomly generated initial population includes Q individuals or solutions represented by real number codes. Figure 2 As shown in the figure, taking 3 garbage transfer stations and 15 garbage disposal points as an example, real number coding design is carried out, including garbage disposal point allocation and visit order.
[0083] The method for clustering the initial population is to cluster the population according to Pareto priority. Figure 3 As shown, referring to the fast non-dominated multi-objective optimization algorithm with elite retention strategy, the population is clustered according to the Pareto priority, and individuals with the same priority are clustered into one category.
[0084] like Figure 4 As shown, the method for performing the selection operation is: after generating a random number a1∈(0,1), determining whether the random number a1∈(0,1) is less than the first control parameter P 5a , if yes, then randomly select a cluster center, and randomly generate a new individual to replace the randomly selected cluster center, and then generate a second random number a2∈(0,1); if no, then generate a second random number a2∈(0,1), and continue to process the second random number a2∈(0,1) until the selected individual is subjected to differential mutation operation. Specifically, the generated random number is a1∈(0,1), and it is determined whether the random number a1∈(0,1) is less than the first control parameter P 5a , if a1<P 5a, then randomly select a cluster center and randomly generate a new individual to replace the randomly selected cluster center, and then generate a second random number a2∈(0,1); if not, then generate a second random number a2∈(0,1), and continue to process the second random number a2∈(0,1) until the selected individual is subjected to a differential mutation operation.
[0085] The method for processing the second random number is: determining whether the second random number a2∈(0,1) is less than the second control parameter P 6b , then randomly select an individual from the current archive set as the currently selected individual; if not, generate a third random number and process the third random number. Specifically, if the second random number is less than the second control parameter P 6b , that is, a2<P 6b , then randomly select an individual from the current archive set as X select ; Otherwise, generate a third random number a3∈(0,1) and process the third random number a3∈(0,1).
[0086] The method for processing the third random number is: determining whether the third random number a3∈(0,1) is less than the third control parameter P 6bi If yes, select one class, generate a fourth random number a4∈(0,1), and continue to process the fourth random number a4∈(0,1); if no, select two classes, generate a fifth random number a5∈(0,1), and continue to process the fifth random number a5∈(0,1). Specifically, determine whether the third random number a3∈(0,1) is less than the third control parameter P 6bi If so, then a3<P 6bi , then select one class, generate a fourth random number a4∈(0,1), and continue processing the fourth random number a4∈(0,1); if not, select two classes, generate a fifth random number a5∈(0,1), and continue processing the fifth random number a5∈(0,1).
[0087] The method for further processing the fourth random number a4∈(0,1) is: determining whether the fourth random number a4∈(0,1) is less than the fourth control parameter P 6biii If yes, select the center of this class as the currently selected individual. If no, randomly select an individual in this class as the currently selected individual X. select The method for further processing the fifth random number a5∈(0,1) is as follows: determining whether the fifth random number a5∈(0,1) is less than the fifth control parameter P 6c If so, then a5<P 6c , the linear combination of the two class centers is used as the currently selected individual X selectIf not, the linear combination of two random individuals in the two categories is taken as the currently selected individual X select .
[0088] For the selected individual X select After performing the differential mutation operation, the archive set is updated according to the dominance relationship to determine whether the maximum number of iterations has been reached. If so, a corresponding path planning scheme is provided based on the Pareto solution after the solution; if not, it returns to the step of clustering the initial population.
[0089] This embodiment takes 75 garbage classification delivery points and 5 garbage transfer stations as examples to analyze the present invention in detail. The capacity limit of the garbage transfer station is 1000, the load limit of small vehicles for classified combined transportation in the first stage is 200, and the load limit of large vehicles in the second stage is 1000. The carbon emission and fuel consumption conversion coefficient ξ=2.32, and the no-load fuel consumption rate ρ 0 =1, full load fuel consumption rate ρ * =2.
[0090] Combine the following Figure 5 and Figure 6 To verify the beneficial effects of the low-carbon garbage classification collection and transportation method based on the improved brainstorming algorithm described in the present invention.
[0091] The present invention selects two classic multi-objective optimization algorithms as benchmarks, namely NSGA-II and MOEA / D, and compares the improved brainstorming algorithm with them, using the hypervolume index (HV) and the Pareto front curve as evaluation indicators. The hypervolume index refers to the volume of the area in the target space surrounded by the non-dominated solution set obtained by the algorithm and the reference point. The larger its value, the better the overall performance of the algorithm. Figure 7 This is a box plot of the three algorithms on the hypervolume index. It can be seen that the hypervolume of the solution set obtained by the improved brainstorming algorithm is much larger than the hypervolume of the solution set obtained by the other two algorithms, which shows the effectiveness and superiority of the improved brainstorming algorithm. In order to further illustrate the effectiveness of the algorithm, the attached Figure 8 The Pareto front curves of the solution sets obtained by the three algorithms are given. It can be seen that the solution set obtained by the improved brainstorming algorithm dominates the solution sets obtained by the other two algorithms. Therefore, it can be considered that the improved brainstorming algorithm of the present invention is effective and superior in solving the proposed model.
[0092] Attachment Figure 9a and Figure 9b As shown in the figure, a garbage collection vehicle path planning diagram is given, and the specific garbage collection vehicle path is shown in Fig.10 As shown, it can be seen that the model proposed by the present invention is feasible and effective. Among them: 1, 2, ..., 75 represent garbage classification delivery points; S1, S2, ..., S5 represent garbage transfer stations; C1, C2 represent garbage treatment centers.
[0093] Embodiment 2
[0094] Based on the same inventive concept, this embodiment provides a low-carbon garbage classification and collection system based on an improved brainstorming algorithm. The principle of solving the problem is similar to the low-carbon garbage classification and collection method based on the improved brainstorming algorithm, and the repeated parts will not be repeated.
[0095] The low-carbon garbage classification collection and transportation system based on the improved brainstorming algorithm described in this embodiment includes:
[0096] A modeling module is used to establish a dual-objective optimization model based on set constraints and two defined objectives, wherein the two defined objectives are: minimizing the total mileage of the vehicle and minimizing carbon emissions;
[0097] The planning module is used to solve the dual-objective optimization model using an improved brainstorming algorithm, and provide a corresponding path planning scheme according to the Pareto solution after the solution, wherein the improved brainstorming algorithm is as follows: initializing algorithm parameters and randomly generating an initial population; clustering the initial population and clustering individuals with the same priority into one category; evaluating individuals and selecting the best individual in each category as the center of the category; performing a selection operation; performing a differential mutation operation on the selected individuals and updating the archive set according to the dominance relationship.
[0098] 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.
[0099] 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 embodiments of 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 generate 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.
[0100] 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.
[0101] 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.
[0102] Obviously, the above embodiments are merely examples for the purpose of clear explanation and are not intended to limit the implementation methods. For those skilled in the art, other different forms of changes or modifications can be made based on the above description. It is not necessary and impossible to list all the implementation methods here. The obvious changes or modifications derived therefrom are still within the scope of protection of the present invention.
Claims
1. A low-carbon garbage classification collection and transportation method based on an improved brainstorming algorithm, characterized in that: The steps include: Step S1: establishing a dual-objective optimization model based on the set constraints and the two defined objectives, wherein the two defined objectives are: minimizing the total mileage of the vehicle and minimizing carbon emissions; Step S2: using an improved brainstorming algorithm to solve the dual-objective optimization model, and providing a corresponding path planning scheme according to the solved Pareto solution, wherein the improved brainstorming algorithm is as follows: initializing algorithm parameters, randomly generating an initial population; clustering the initial population, clustering individuals with the same priority into one category; evaluating individuals, selecting the best individual in each category as the center of the category; performing a selection operation; performing a differential mutation operation on the selected individuals, updating an archive set according to a dominance relationship, and outputting a path planning according to the updated archive set; The formula for minimizing the total vehicle mileage is: where d ij is the distance from node i to node j, x ij is a decision variable, which takes 1 if the vehicle passes through arc (i, j); otherwise, it takes 0. Formula (1) is the objective function 1, which means that the total mileage of the garbage truck is the smallest, that is, the cost is the lowest. The formula for minimizing carbon emissions is: Where ξ is the conversion coefficient between carbon emission and fuel consumption, ρ 0 is the no-load fuel consumption rate, ρ * is the full-load fuel consumption rate; Formula (2) is the objective function 2, which means that the carbon emission in the garbage collection and transportation process is minimized; The constraints include: the removal vehicles depart from the garbage transfer station by means of classified combined transportation, collect and transport the garbage from the garbage classification delivery points according to the optimized route, and finally return to the original garbage transfer station, and then the garbage disposal center sends vehicles to various garbage transfer stations to collect and transport various types of garbage; Each garbage sorting point is managed by a collection vehicle; the total vehicle load at any point on the route is not greater than the vehicle carrying capacity; the capacity of the garbage transfer station is limited; the disposal center cannot directly send a vehicle to the garbage sorting point to collect and transport garbage. Specifically, the formula includes: where x ij is a decision variable, which takes 1 if the car passes through arc (i, j); otherwise, it takes 0. Formula (3) ensures that there is only one car responsible for each garbage sorting point. where w ij is a decision variable. If the garbage classification point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (4) ensures that each garbage classification point is assigned to only one garbage transfer station. where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; Formula (5) is a flow constraint, which ensures that the number of vehicles arriving at each node is the same as the number of vehicles leaving the node; where w ij is a decision variable. If the garbage sorting delivery point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (6) ensures that if a path includes a transfer station and a delivery point, the delivery point must be assigned to the transfer station. in is the amount of recyclable garbage at garbage sorting point i; is the amount of non-recyclable garbage at garbage sorting point i; Formula (7) is about the amount of garbage; in is the amount of recyclable garbage at garbage sorting point i; w ij is a decision variable. If the garbage classification delivery point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (8) is about the amount of garbage; in is the amount of non-recyclable garbage at garbage sorting point i; w ij is a decision variable. If the garbage classification delivery point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (9) is about the amount of garbage; where w ij is a decision variable. If the garbage sorting point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (10) ensures that the amount of garbage allocated to the transfer station is not greater than the maximum capacity of the transfer station. where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; in is the amount of recyclable garbage at garbage sorting point i; x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; in is the amount of non-recyclable garbage at garbage sorting point i; x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; The above formulas (11)-(13) can ensure that the total vehicle load at any point on any route is not greater than the vehicle carrying capacity; where x ij is a decision variable, which takes 1 if the car passes through arc (i, j); otherwise, it takes 0; w ij is a decision variable. If the garbage sorting point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. where w ij is a decision variable. If the garbage sorting point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. The above formulas (14) and (15) ensure that each path starts from the same transfer station and eventually returns to the transfer station; Where Q ij is the actual load of the vehicle on arc (i, j); where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; The above formulas (16)-(19) are about the actual load of the vehicle at each node; where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; where w ij is a decision variable. If the garbage classification delivery point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. The above formulas (20) and (21) are 0-1 constraints on the variables.
2. The low-carbon garbage classification collection and transportation method based on the improved brainstorming algorithm according to claim 1 is characterized by: The initialization algorithm parameters include: population size Q, archive set, next generation population generation control parameters, and maximum number of iterations.
3. The low-carbon garbage classification collection and transportation method based on the improved brainstorming algorithm according to claim 1 is characterized by: The randomly generated initial population includes Q individuals or solutions represented by real number codes.
4. The low-carbon garbage classification collection and transportation method based on the improved brainstorming algorithm according to claim 1 is characterized by: The method for clustering the initial population is to cluster the population according to Pareto priority.
5. The low-carbon garbage classification collection and transportation method based on the improved brainstorming algorithm according to claim 1 is characterized by: The method for performing the selection operation is: after generating a random number, determine whether the random number is less than a first control parameter. If so, randomly select a cluster center and randomly generate a new individual to replace the randomly selected cluster center, and then generate a second random number; if not, generate a second random number and continue to process the second random number until a differential mutation operation is performed on the selected individual.
6. The low-carbon garbage classification collection and transportation method based on the improved brainstorming algorithm according to claim 5 is characterized by: The method for processing the second random number is: determining whether the second random number is less than a second control parameter, and if so, randomly selecting an individual from the current archive set as the currently selected individual; If not, generate a third random number, and process the third random number.
7. The low-carbon garbage classification collection and transportation method based on the improved brainstorming algorithm according to claim 6 is characterized by: The method for processing the third random number is: determining whether the third random number is less than a third control parameter, and if so, selecting a class, generating a fourth random number, and continuing to process the fourth random number; If not, two classes are selected, a fifth random number is generated, and the fifth random number is further processed.
8. The low-carbon garbage classification collection and transportation method based on the improved brainstorming algorithm according to claim 7 is characterized by: The method for continuing to process the fourth random number is: determine whether the fourth random number is less than the fourth control parameter, if so, select the center of the class as the currently selected individual, if not, randomly select an individual in the class as the currently selected individual; the method for continuing to process the fifth random number is: determine whether the fifth random number is less than the fifth control parameter, if so, use the linear combination of the two class centers as the currently selected individual, if not, use the linear combination of two random individuals in the two classes as the currently selected individual.
9. The low-carbon garbage classification collection and transportation method based on the improved brainstorming algorithm according to claim 1 is characterized by: After performing differential mutation operations on the selected individuals, the archive set is updated according to the dominance relationship to determine whether the maximum number of iterations has been reached. If so, a corresponding path planning scheme is provided based on the Pareto solution after solution; if not, it returns to the step of clustering the initial population.
10. A low-carbon garbage classification collection and transportation system based on an improved brainstorming algorithm, characterized in that: include: A modeling module is used to establish a dual-objective optimization model based on set constraints and two defined objectives, wherein the two defined objectives are: minimizing the total mileage of the vehicle and minimizing carbon emissions; The planning module is used to solve the dual-objective optimization model by using an improved brainstorming algorithm, and provide a corresponding path planning scheme according to the Pareto solution after the solution, wherein the improved brainstorming algorithm is as follows: initializing algorithm parameters and randomly generating an initial population; clustering the initial population and clustering individuals with the same priority into one category; evaluating individuals and selecting the best individual in each category as the center of the category; performing a selection operation; performing a differential mutation operation on the selected individuals and updating the archive set according to the dominance relationship; The formula for minimizing the total vehicle mileage is: where d ij is the distance from node i to node j, x ij is a decision variable, which takes 1 if the vehicle passes through arc (i, j); otherwise, it takes 0. Formula (1) is the objective function 1, which means that the total mileage of the garbage truck is the smallest, that is, the cost is the lowest. The formula for minimizing carbon emissions is: Where ξ is the conversion coefficient between carbon emission and fuel consumption, ρ 0 is the no-load fuel consumption rate, ρ * is the full-load fuel consumption rate; Formula (2) is the objective function 2, which means that the carbon emission in the garbage collection and transportation process is minimized; The constraints include: the removal vehicles depart from the garbage transfer station by means of classified combined transportation, collect and transport the garbage from the garbage classification delivery points according to the optimized route, and finally return to the original garbage transfer station, and then the garbage disposal center sends vehicles to various garbage transfer stations to collect and transport various types of garbage; Each garbage sorting point is managed by a collection vehicle; the total vehicle load at any point on the route is not greater than the vehicle carrying capacity; the capacity of the garbage transfer station is limited; the disposal center cannot directly send a vehicle to the garbage sorting point to collect and transport garbage. Specifically, the formula includes: where x ij is a decision variable, which takes 1 if the car passes through arc (i, j); otherwise, it takes 0. Formula (3) ensures that there is only one car responsible for each garbage sorting point. where w ij is a decision variable. If the garbage classification point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (4) ensures that each garbage classification point is assigned to and only to one garbage transfer station. where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; Formula (5) is a flow constraint, which ensures that the number of vehicles arriving at each node is the same as the number of vehicles leaving the node; where w ij is a decision variable. If the garbage sorting delivery point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (6) ensures that if a path includes a transfer station and a delivery point, the delivery point must be assigned to the transfer station. in is the amount of recyclable garbage at garbage sorting point i; is the amount of non-recyclable garbage at garbage sorting point i; Formula (7) is about the amount of garbage; in is the amount of recyclable garbage at garbage sorting point i; w ij is a decision variable. If the garbage classification delivery point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (8) is about the amount of garbage; in is the amount of non-recyclable garbage at garbage sorting point i; w ij is a decision variable. If the garbage classification delivery point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (9) is about the amount of garbage; where w ij is a decision variable. If the garbage sorting point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. Formula (10) ensures that the amount of garbage allocated to the transfer station is not greater than the maximum capacity of the transfer station. where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; in is the amount of recyclable garbage at garbage sorting point i; x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; in is the amount of non-recyclable garbage at garbage sorting point i; x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; The above formulas (11)-(13) can ensure that the total vehicle load at any point on any route is not greater than the vehicle carrying capacity; where x ij is a decision variable, which takes 1 if the car passes through arc (i, j); otherwise, it takes 0; w ij is a decision variable. If the garbage sorting point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0; where w ij is a decision variable. If the garbage sorting point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0; The above formulas (14) and (15) ensure that each path starts from the same transfer station and eventually returns to the transfer station; Where Q ij is the actual load of the vehicle on arc (i, j); where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; The above formulas (16)-(19) are about the actual load of the vehicle at each node; where x ij is a decision variable, which takes the value 1 if the car passes through arc (i, j); otherwise, it takes the value 0; where w ij is a decision variable. If the garbage classification delivery point i is collected and transported by the transfer station j, it takes 1; otherwise, it takes 0. The above formulas (20) and (21) are 0-1 constraints on the variables.
Citation Information
Patent Citations
Collaborative multi-objective algorithm-based multi-stage low-carbon logistics distribution network planning method
CN107833002A
Optimal configuration method and device for a hybrid renewable energy system
CN109800924A
Parallel plug-in hybrid power garbage truck and control method thereof
CN111055831A
