A low-carbon dispatching method and system for garbage vehicles
Optimizing garbage vehicle scheduling through adaptive particle swarm algorithms solves the problem of slow convergence speed and easy to fall into local optimality, and realizes efficient vehicle scheduling scheme planning, reducing carbon emissions and transportation costs.
Patent Information
- Application Number
- CN202111508631.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-12-10
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2041-12-10
AI Technical Summary
The existing garbage vehicle scheduling algorithm has slow convergence speed, which is easy to fall into local optimality, has low resolution accuracy, and it is difficult to quickly plan a vehicle scheduling plan with the lowest carbon emissions and total transportation costs.
The low-carbon scheduling method of garbage vehicles based on adaptive particle swarm algorithm is adopted, and the vehicle scheduling scheme is optimized through integer coding, enhanced local search and contribution-based adaptive learning strategies to ensure high convergence efficiency of the algorithm and local optimization.
It significantly improves the convergence speed and solution accuracy of the algorithm, and can quickly plan a vehicle scheduling plan with the lowest total transportation cost, reducing carbon emissions and transportation costs.
Smart Images

Figure CN114611864B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to a low-carbon dispatching method and system for garbage vehicles, belonging to the technical field of vehicle dispatching. Background Art
[0002] The pace of global population growth and urbanization is accelerating, the urban population is gradually concentrated, and the living standards and environment have changed significantly, accompanied by more and more domestic waste. On January 21, 2020, the estimated data released by the Waste Engineering Research Institute in Tokyo, Japan showed that the amount of garbage generated annually in the world will reach 32 billion tons in 2050, 4.2 times that of 2000. The accumulation of garbage has led to a rapid deterioration of the global environment, and CO2 emissions have also shown a straight-line upward trend. According to the International Energy Agency (IEA), the global carbon emissions increased by about 33 billion tons in 2019. Faced with such huge pressure and challenges, the world attaches great importance to it, and many local governments have begun to implement integrated solid waste management (ISWM). They advocate the development of an overall urban domestic waste management system. The system includes front-end garbage generation and terminal garbage disposal, and the connection between the two is garbage transportation. It can be seen that the transportation link plays a key role in the urban domestic waste management system. In the cost of garbage disposal, transportation costs account for a considerable proportion. For example, the literature points out that the total annual garbage disposal cost in the United States is about US$20 billion, of which transportation costs have exceeded US$10 billion. In addition, the transportation link is also one of the main reasons for the growth of global carbon emissions. In summary, it is necessary to conduct in-depth research on the scheduling of garbage transportation vehicles to reduce transportation costs and reduce environmental pollution.
[0003] The vehicle dispatching problem is an NP-hard problem. As the scale of the problem increases, the exact algorithm cannot obtain a satisfactory solution in an effective time. Therefore, scholars have proposed swarm intelligence optimization algorithms. The particle swarm optimization algorithm (PSO) proposed by Kennedy and Eberhart in 1995 is a typical example. The adaptive particle swarm algorithm is an improved version of the particle swarm algorithm. It integrates the problem information of garbage vehicle transportation with the structural characteristics of the particle swarm algorithm. The basic steps of the algorithm are as follows: the initial population is randomly generated by integer coding, and the individuals are decoded in turn according to the decoding method that eliminates time and capacity constraints. The fitness value of each individual is calculated, and the individual extreme value and global extreme value of the individual are determined; the decoded individuals are finely searched by an enhanced local search strategy. According to the capacity and distance information of the problem, the 2-opt algorithm is selected to perform local mining around the individuals decoded in the population. In order to prevent excessive local search from causing the loss of population diversity, only the trip with the largest number of garbage disposal points for each individual is operated; an adaptive learning strategy based on contribution is adopted. Starting from the four purposes of quickly converging to the global optimal solution, increasing population diversity, exploring new areas and developing the best position of individuals, four learning strategies with different advantages are designed. Based on the different contribution degrees, the most suitable learning strategy is adaptively selected for each particle and the offspring particles are generated. The traditional particle swarm algorithm does not utilize the characteristics of the problem when solving the low-carbon vehicle scheduling planning of garbage vehicles. The search is extremely blind and the convergence speed is slow. In addition, the traditional particle swarm algorithm is easy to fall into local optimality and has low solution accuracy. In summary, it is extremely necessary to propose a vehicle scheduling planning method with higher convergence efficiency and stronger ability to jump out of local optimality. Summary of the invention
[0004] The technical problem to be solved by the present invention is to overcome the defects of the prior art and provide a low-carbon scheduling method and system for garbage vehicles, which can greatly improve the convergence speed of the algorithm and have a strong ability to jump out of the local optimum, thereby quickly planning a group of vehicle scheduling plans with the lowest carbon emissions and total transportation costs.
[0005] In order to solve the above technical problems, the present invention provides a low-carbon dispatching method for garbage trucks, comprising:
[0006] Get input information, including: the number of garbage collection points N that the garbage truck needs to serve, the coordinate information of the garbage collection points, the parking lot coordinate information, the garbage transfer station coordinate information, the amount of garbage at each garbage collection point, the capacity of the garbage truck Q, and the maximum working time T of the driver max ;
[0007] Input information is fed into a pre-built garbage truck low-carbon dispatch optimization model based on an adaptive particle swarm algorithm to determine the optimal dispatch solution;
[0008] The optimization goal of the garbage truck low-carbon scheduling optimization model based on the adaptive particle swarm algorithm is to minimize the total transportation cost of the vehicles in the planned scheduling scheme. The constraints of the garbage truck low-carbon scheduling optimization model based on the adaptive particle swarm algorithm are that all vehicles depart from the parking lot and only depart once, each garbage delivery point is only allowed to be served by one vehicle once, when each garbage delivery point is served, there must be a vehicle driving from a certain location to the garbage delivery point and leaving from the point, all vehicles will empty all the garbage at the garbage transfer station, the garbage loading amount of the vehicle in one trip is not greater than its capacity limit, and the working hours of the driver of each vehicle cannot exceed the prescribed maximum working time limit.
[0009] Furthermore, the input information is input into a pre-built garbage truck low-carbon scheduling optimization model based on an adaptive particle swarm algorithm to determine the optimal scheduling solution, including:
[0010] Step 1: Set the adaptive particle swarm algorithm evolution population size to n, the maximum size of the neighborhood search to Y, and the maximum number of evaluations to Eva max , evaluation times counter Eva = 0;
[0011] Step 2: Use integer coding to randomly generate n individuals. The code of each individual is a sequence of integers between 3 and N:
[0012] X={x3,x4,x i ,…,x N}
[0013] Among them, x i Indicates the number of the garbage disposal point, i = 3, 4, ..., N, the parking lot is numbered 1, the garbage transfer station is numbered 2, and the garbage disposal points are numbered 3 to N;
[0014] Calculate the target value f(X) for each individual:
[0015] f(X)=C fixed +C fuel +C carbon
[0016] Among them, C fixed is the fixed cost, C fuel is the fuel cost, C carbon for the cost of carbon emissions;
[0017]
[0018] Among them, C f is the fixed cost of each vehicle, U k Indicates whether the kth vehicle is used, K represents the total number of vehicles,
[0019]
[0020] Among them, C m is the fuel cost per unit distance traveled by the vehicle, B represents the set of all trips of a vehicle, d ij is the distance between garbage disposal point i and garbage disposal point j, Indicates whether the k-th vehicle passes through the path (i, j) in the b-th trip,
[0021] EC ij =FE·FC ij
[0022]
[0023] Among them, EC ij represents the carbon emissions of a vehicle traveling from garbage disposal point i to j, FE is the fuel emission parameter, C e For carbon tax, Indicates whether the k-th vehicle serves garbage disposal point i in the b-th trip, FC ij is the amount of fuel consumed by the vehicle when traveling from garbage disposal point i to garbage disposal point j. The specific calculation method is as follows:
[0024] FC ij =[α ij (z+l ij )+βv 2 ]d ij
[0025] Where z represents the vehicle’s own weight, l ij represents the load of the vehicle from garbage disposal point i to j, v represents the speed of the vehicle, α ij and β are parameters related to road conditions and vehicle type, respectively, and are calculated as follows:
[0026] α ij =a+gsinθ ij +gC r cosθ ij
[0027] β=0.5C d Aρ
[0028] Among them, a is the vehicle acceleration, g is the gravitational acceleration constant, θ ij is the road slope from garbage disposal point i to garbage disposal point j, C r is the rolling resistance coefficient, C d is the traction coefficient, A is the front surface area of the vehicle, and ρ represents the air density;
[0029] The fitness of an individual is F(X):
[0030]
[0031] Step 3: Use enhanced local search strategy to conduct detailed search on the decoded individuals to form new individuals;
[0032] Step 4: Adopt an adaptive learning strategy based on contribution for the new individuals, adaptively select the learning method that best suits the particle's own stage, and generate offspring particles:
[0033] Step 5: Update individual extreme values and global extreme values in each iteration according to the rule of survival of the fittest;
[0034] Step 6, if Eva>Eva max Then the iteration is terminated and the individual with the best fitness is output, which is the individual that has planned the vehicle scheduling plan. Otherwise, Eva increases accordingly and go to step 3.
[0035] Furthermore, the enhanced local search strategy is used to perform a fine search on the decoded individuals to form new individuals, including:
[0036] Step 31, decoding the individuals by eliminating the time and capacity constraints to obtain a dispatching plan for garbage trucks;
[0037] Step 32, finding the vehicle index and trip index corresponding to the trip with the most garbage placement points;
[0038] Step 33, perform 2-opt optimization on the trip with the most garbage placement points, effectively opening up the intersecting routes in the trip;
[0039] Step 34, re-join the optimized trip with the remaining unselected trips in order to form a new individual; in the joining process, there are two cases according to the destination of the vehicle trip: when the destination of the trip is a transfer station, it means that the vehicle will not go to the parking lot again in the trip, and only the starting point and the garbage transfer station in the trip need to be removed; when the destination of the trip is the parking lot, the vehicle goes to the garbage transfer station to unload and then returns to the parking lot, and at this time, the starting point, the garbage transfer station and the parking lot in the trip need to be removed;
[0040] Step 35, outputting a new individual after implementing the enhanced local search strategy.
[0041] Furthermore, the adaptive learning strategy based on contribution is adopted for the new individuals, and the learning method that best suits the particle's own stage is adaptively selected to generate offspring particles, including:
[0042] Step 41, setting m learning strategies;
[0043] Step 42, let the contribution C of each learning strategy kk =0, kk=1,2,…,m;
[0044] Step 43, for each new individual ii in the population, a learning strategy learn(ii) is determined by roulette selection, a new particle Npop(ii) is generated according to learn(ii), and a target value of Npop(ii) is calculated;
[0045] Step 44, sorting the new particles in the new population according to the target value to obtain the particle ranking vector r(ii);
[0046] Step 45, assign weight w to the ii-th new particle according to the following formula: ii , the higher the particle ranking, the greater the weight assigned to it;
[0047]
[0048] Among them, w ii is the weight that the ii-th particle should be assigned, and r(ii) is the ranking of the ii-th particle;
[0049] Step 46, the contribution of the kkth learning strategy is updated as follows:
[0050]
[0051] Among them, sf ii is the reward and penalty factor. If the fitness value of the ii-th particle is improved through the kk-th learning strategy, then sf ii =1, otherwise sf ii =0;
[0052] Step 47, the method for updating and normalizing the probability of selecting the kkth learning strategy is as follows:
[0053] p kk =C kk +ε kk=1,2,...,m
[0054]
[0055] Among them, p kk is the probability of selecting the kkth learning strategy, jj represents the subscript of the learning strategy, jj=1,2,...,m, ε=0.01 is the minimum selection probability, which is used to ensure that each learning strategy has a chance to be selected;
[0056] Step 48, after the particles in the population learn by selecting different learning methods, all newly generated offspring particles Npop, the target value Npopobj of the new particles, the contribution vector C of the learning strategy and the selection probability vector P are output.
[0057] Furthermore, the m learning strategies include: greedy learning strategy, multivariate learning strategy, exploratory learning strategy and exploitative learning strategy.
[0058] The greedy learning strategy is: the new individual is reversed to generate a mutant individual, the mutant individual and the individual extreme value are used to generate a crossover individual one through a greedy crossover operator, and the crossover individual one and the global extreme value are greedily crossed again to generate a new individual after greedy learning;
[0059] The multivariate learning strategy is: generate mutant individuals through multivariate mutation operators, partially map and cross the generated mutant individuals with individual extreme values to obtain crossover individuals 1, and partially map and cross the crossover individual 1 with the global extreme value to generate new individuals after multivariate learning;
[0060] The exploratory learning strategy is to generate mutant individuals through multivariate mutation operators, and partially map and cross the generated mutant individuals with the individual extreme values of any particle in the population whose fitness is better than itself, to generate new individuals after exploratory learning;
[0061] The utilization learning strategy is to generate mutant individuals through multivariate mutation operators, perform partial mapping and crossover between the generated mutant individuals and individual extreme values, and generate new individuals after utilization learning.
[0062] Furthermore, the greedy learning strategy includes:
[0063] Step 411, determine the individuals X and individual extreme values X that need to be crossed pbest And the global extreme value X gbest ;
[0064] Step 412: randomly select a point from a non-parking lot and non-transfer station as the first garbage drop point S for vehicle service. The first garbage drop point S is selected at X pbest The left garbage disposal point S Lp and the garbage disposal point S on the right Rp , at the garbage drop point S on the left side of X LX and the garbage disposal point S on the right RX As a candidate set for the next visit;
[0065] Step 413, in the candidate set {S Lp ,S Rp ,S LX ,S RX} Select a garbage delivery point S' so that S' and S form a path segment with the least transportation cost;
[0066] Step 414, if S'∈{S Lp ,S LX}, execute step 415, otherwise execute step 416;
[0067] Step 415, from the individual extreme value X pbest Delete S from individual X, set S' as the next starting point S, and in the left candidate set of S {S Lp ,S LX} selects a new S' as the next garbage delivery point to be served, so that S' and S form a path segment with the lowest transportation cost, and repeats S515 until a new solution X is generated. new ;
[0068] Step 416, from the individual extreme value X pbest Delete S from individual X, set S' as the next starting point S, and in the right candidate set of S {S Rp ,S RX} selects a new S' as the next garbage drop point to be served, so that S' and S form a path segment with the lowest transportation cost, and repeats S516 until a new solution X is generated. new ;
[0069] Step 417, with X and X pbest As an example, the new solution X new and the global extreme value X gbest Perform greedy crossover again to generate a new solution;
[0070] Step 418, output the new individual that passes the greedy crossover operator.
[0071] Furthermore, the multi-faceted learning strategy includes:
[0072] Step 421, calculating the selection probabilities of reversal mutation, exchange mutation and insertion mutation;
[0073] Step 422, selecting a sequence number of a variation method based on a roulette wheel method;
[0074] Step 423, if the sequence number for reversal mutation is selected, exchange mutation is performed on the individual;
[0075] Step 424, if the sequence number of the exchange mutation is selected, the individual is reversed;
[0076] Step 425, if the sequence number of the insertion mutation is inserted, then the individual is subjected to insertion mutation;
[0077] Step 426, outputting a new individual after passing through the multivariate mutation operator according to the mutation result.
[0078] A low-carbon dispatching system for garbage vehicles, comprising:
[0079] The acquisition module is used to obtain input information, including: the number of garbage delivery points N that the garbage truck needs to serve, the coordinate information of the garbage delivery points, the parking lot coordinate information, the coordinate information of the garbage transfer station, the amount of garbage at each garbage delivery point, the capacity of the garbage truck Q, and the maximum working time T of the driver max ;
[0080] A determination module is used to input the input information into a pre-built garbage truck low-carbon scheduling optimization model based on an adaptive particle swarm algorithm to determine the optimal scheduling solution;
[0081] The optimization goal of the garbage truck low-carbon scheduling optimization model based on the adaptive particle swarm algorithm is to minimize the total transportation cost of the vehicles in the planned scheduling scheme. The constraints of the garbage truck low-carbon scheduling optimization model based on the adaptive particle swarm algorithm are that all vehicles depart from the parking lot and only depart once, each garbage delivery point is only allowed to be served by one vehicle once, when each garbage delivery point is served, there must be a vehicle driving from a certain location to the garbage delivery point and leaving from the point, all vehicles will empty all the garbage at the garbage transfer station, the garbage loading amount of the vehicle in one trip is not greater than its capacity limit, and the working hours of the driver of each vehicle cannot exceed the prescribed maximum working time limit.
[0082] A computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computing device, cause the computing device to perform any of the methods described.
[0083] A computing device comprising:
[0084] One or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, and the one or more programs include instructions for executing any of the methods described.
[0085] The beneficial effects achieved by the present invention are:
[0086] (1) A multi-trip low-carbon vehicle scheduling problem model for garbage collection and transportation is established, which includes practical factors such as vehicle capacity, low carbon, driver working hours, and multiple trips. The characteristic of this model is that a vehicle is allowed to have multiple trips between the parking lot, the garbage transfer station, and the garbage delivery site. In addition, the environmental pollution caused by the vehicle during driving is taken into account, and the carbon emissions are converted into carbon emission costs and included in the total cost.
[0087] (2) The present invention adopts a low-carbon dispatching method for garbage trucks based on an adaptive particle swarm algorithm, which eliminates the decoding method of time and capacity constraints, so that all decoded solutions are feasible solutions. Therefore, the performance of this algorithm is better than that of the traditional particle swarm algorithm.
[0088] (3) Enhanced local search strategy: local search is performed on the itineraries with the most garbage disposal points in the individual. This improves the accuracy of the algorithm while also avoiding the phenomenon of population assimilation being too fast due to excessive local search.
[0089] (4) Based on the contribution degree of the adaptive learning mechanism, four learning strategies with different advantages are designed for individuals at different evolutionary stages: greedy learning, multivariate learning, exploratory learning, and exploitative learning. According to their different contributions in the population evolution process, appropriate learning strategies are adaptively assigned to individuals to improve the search efficiency of the algorithm. BRIEF DESCRIPTION OF THE DRAWINGS
[0090] Figure 1 This is the main flow chart of the present invention using the adaptive particle swarm algorithm;
[0091] Figure 2 The best solution obtained by using the adaptive particle swarm algorithm of the present invention to solve the example;
[0092] Figure 3 This is a comparison result diagram of the optimal solution using the adaptive particle swarm algorithm of the present invention and the existing algorithm for solving the garbage removal problem in terms of fixed cost, fuel cost and carbon emission cost. DETAILED DESCRIPTION
[0093] The present invention will be further described below in conjunction with the accompanying drawings. The following embodiments are only used to more clearly illustrate the technical solution of the present invention, and cannot be used to limit the protection scope of the present invention.
[0094] Through field research on Green Ring Company in Jiangbei New District, Nanjing, China, we obtained the longitude and latitude coordinates of the 54 communities (marked as 3-56) served by the company, the longitude and latitude coordinates of the garbage transfer station (marked as 2) and the parking lot (marked as 1), and the amount of garbage in each community on a certain day. The longitude and latitude coordinates of all points were converted into plane rectangular coordinate system coordinates, as shown in Table 1. The capacity limit of garbage trucks is 10t, and the maximum time limit for drivers is 8h.
[0095] Table 1
[0096]
[0097]
[0098]
[0099] The optimal vehicle dispatching solution obtained by solving the embodiment based on the adaptive particle swarm algorithm proposed by the present invention is as follows: Figure 1 As shown, the specific steps are as follows:
[0100] S1, initialization. Read the input information of the instance (see Table 1); define the optimization goal and set constraints.
[0101] Assume that the plane coordinate information of the garbage disposal point is {(A x1 ,A y1 ),(A x2 ,A y2 ),…,(A xN ,A yN )}, the scale of the problem means that the problem contains N points (the parking lot is numbered 1, the garbage transfer station is numbered 2, and the garbage disposal points are numbered 3 to N). The distance between different points is calculated using the Euclidean distance formula, which is defined as:
[0102]
[0103] Among them, d ij represents the distance between garbage disposal point i and garbage disposal point j;
[0104] The optimization objective "transportation cost incurred in the path" is defined as:
[0105] f(X)=C fixed +C fuel +C carbon
[0106] Among them, f(X) includes fixed cost C fixed 、Fuel cost C fuel and the carbon emission cost C carbon .
[0107] (a) Fixed costs:
[0108] In the process of garbage collection, once the vehicle is used, it will incur corresponding maintenance costs and driver salary costs. Therefore, the fixed cost C generated by completing a garbage collection is fixed as follows:
[0109]
[0110] (b) Fuel cost:
[0111] The fuel cost of a vehicle is generated by fuel consumption during driving. The fuel consumption efficiency is often affected by factors such as driving speed and road conditions. This paper assumes that the road conditions are stable and the speed is uniform during the transportation process, and the fuel cost per unit distance of the vehicle is fixed. Therefore, the fuel cost C generated after all vehicles complete the entire journey isfuel as follows:
[0112]
[0113] (c) Carbon emission costs:
[0114] Due to the intensification of the greenhouse effect, many countries have formulated carbon tax systems to control CO2 emissions. Carbon tax refers to the collection of corresponding fees for CO2 emissions according to the amount of CO2 emissions. Therefore, the carbon emission cost C generated by all vehicles after completing the entire journey carbon as follows:
[0115] EC ij =FE·FC ij
[0116]
[0117]
[0118]
[0119]
[0120] Among them, FE is the fuel emission parameter, C e is the carbon tax, C m is the fuel cost per unit distance traveled by the vehicle, C f is the fixed cost of each vehicle, B represents the set of all trips of a vehicle, d ij is the distance between garbage disposal point i and garbage disposal point j, FC ij is the amount of fuel consumed by the vehicle when traveling from garbage disposal point i to garbage disposal point j. The specific calculation method is as follows:
[0121] FC ij =[α ij (z+l ij )+βv 2 ]d ij
[0122] Among them, α ij and β are parameters related to road conditions and vehicle type, respectively, and are calculated as follows:
[0123] α ij =a+gsinθ ij +gC r cosθ ij
[0124] β=0.5C d Aρ
[0125] Among them, a is the vehicle acceleration, g is the gravitational acceleration constant, θij is the road slope from garbage disposal point i to garbage disposal point j, C r is the rolling resistance coefficient, C d is the traction coefficient, A is the front surface area of the vehicle, and ρ represents the air density.
[0126] The following six constraints are defined:
[0127] (1) Ensure that all vehicles depart from the parking lot and depart only once, that is:
[0128]
[0129]
[0130] (2) Each garbage disposal point is only allowed to be served by one vehicle at a time, i.e.:
[0131]
[0132] (3) When each garbage disposal point is served, there must be a vehicle driving from a certain location to the garbage disposal point and leaving from that point, that is:
[0133]
[0134]
[0135] (4) All vehicles shall empty all garbage at the garbage transfer station, that is:
[0136]
[0137] (5) The amount of garbage loaded by the vehicle in one trip does not exceed its capacity limit, that is:
[0138]
[0139] (6) The working time of each vehicle cannot exceed the prescribed maximum working time limit, that is:
[0140]
[0141] Among them, q i represents the amount of garbage at each garbage disposal point i, l ij represents the load of the vehicle from garbage disposal point i to j, t ij represents the time it takes for a vehicle to travel from garbage drop-off point i to j, T max Indicates the maximum daily working hours of the driver.
[0142] S2, initialize the parameters of the improved particle swarm algorithm based on heuristic information:
[0143] Set the adaptive particle swarm algorithm evolution population size to n = 200, the number of neighborhood solutions Y = 10, and the maximum number of evaluations Eva max =100000, set the evaluation times counter Eva=0.
[0144] S3, generate the initial candidate population and calculate the fitness:
[0145] Integer coding is used. For a problem involving N points (the parking lot is numbered 1, the garbage transfer station is numbered 2, and the garbage disposal points are numbered 3 to N), the code of each individual is a sequence of integers between 3 and N:
[0146] X={x3,x4,x i ,…,x N}
[0147] Among them, x i (i=3,4,…,N) represents the number of the garbage disposal point; according to the known optimization target in step (1), the transportation cost generated in the path, that is, the lower the transportation cost, the higher the fitness and the better the planned plan, then the individual fitness is defined as:
[0148]
[0149] Determine individual and global extrema of individuals.
[0150] S4, using enhanced local search strategy to perform fine search on the decoded individuals:
[0151] S41, decoding the individuals by eliminating the time and capacity constraints to obtain a dispatching plan for garbage trucks;
[0152] S42, finding the vehicle index and trip index corresponding to the trip with the most garbage placement points;
[0153] S43, performs 2-opt optimization on the trips with the most garbage placement points, effectively opening up intersecting routes in the trips;
[0154] S44, reconnecting the optimized itinerary with the remaining unselected itineraries in order to form a new individual;
[0155] S45, during the splicing process, there are two cases according to the destination of the vehicle trip: When the destination of the trip is a transfer station, it means that the vehicle will not go to the parking lot again during the trip. Therefore, only the starting point and the end point (garbage transfer station) in the trip need to be removed. When the end point of the trip is the parking lot, the vehicle must go to the garbage transfer station to unload and then return to the parking lot. Therefore, the starting point, garbage transfer station and end point (parking lot) in the trip need to be removed;
[0156] S46, output the new individual after implementing the enhanced local search strategy.
[0157] S5 adopts an adaptive learning strategy based on contribution, adaptively selects the learning method that best suits the particle's own stage, and the implementation steps for generating daughter particles are:
[0158] S51, set the greedy learning strategy:
[0159] The individual generates a mutant individual by reversing the mutation. Secondly, the mutant individual and the individual extreme value generate the crossover individual 1 through the greedy crossover operator. Finally, the crossover individual 1 and the global extreme value are greedily crossed in the same way to generate a new individual after greedy learning;
[0160] S52, set up a multi-faceted learning strategy:
[0161] The particles generate mutant individuals through multivariate mutation operators. Secondly, the generated mutant individuals are partially mapped and crossed with individual extreme values to obtain crossover individual 1. Finally, crossover individual 1 is partially mapped and crossed with the global extreme value to generate new individuals after multivariate learning.
[0162] S53, set up exploratory learning strategy:
[0163] Particles generate mutant individuals through multivariate mutation operators. Secondly, the generated mutant individuals are partially mapped and crossed with the individual extreme values of any particle in the population whose fitness is better than itself, to generate new individuals after exploration and learning;
[0164] S54, set up the utilization learning strategy, and the particles generate mutant individuals through multivariate mutation operators. Secondly, the generated mutant individuals are partially mapped and crossed with individual extreme values to generate new individuals after utilization learning;
[0165] S55, when the population is initialized, let the contribution of each learning strategy C kk =0, kk=1,2,…,m; (assuming there are m learning strategies in total);
[0166] S56, for each new individual ii in the population, a learning strategy learn(ii) is determined by roulette wheel selection, a new particle Npop(ii) is generated according to learn(ii) and a target value of Npop(ii) is calculated;
[0167] S57, sorting the new particles in the new population according to the target value to obtain the ranking r(ii) of particle ii;
[0168] S58, assign weight w to the ii-th new particle according to the following formula ii , the higher the particle ranking, the greater the weight assigned to it.
[0169]
[0170] Among them, w ii is the weight that the ii-th particle should be assigned, and r(ii) is the ranking of the ii-th particle.
[0171] S59, the contribution of the kk-th learning strategy is updated as follows.
[0172]
[0173] Among them, sf ii is the reward and penalty factor. If the fitness value of the ii-th particle is improved through the kk-th learning strategy, then sf ii =1, otherwise sf ii =0.
[0174] S510, the method for updating and normalizing the probability of selecting the kkth learning strategy is as follows:
[0175] p kk =C kk +ε kk=1,2,...,m
[0176]
[0177] Among them, p kk is the selection probability of the kkth learning strategy, jj represents the subscript of the learning strategy, jj=1,2,...,m, ε=0.01 is the minimum selection probability, which is used to ensure that each learning strategy has a chance to be selected.
[0178] S511, after the particles in the population learn by selecting different learning methods, they output all newly generated offspring particles Npop, the target value Npopobj of the new particles, the contribution vector C of the learning strategy and the selection probability vector P.
[0179] S6, update individual extreme values and global extreme values: update individual extreme values and global extreme values in each iteration according to the rule of survival of the fittest.
[0180] S7, termination criteria judgment: if Eva>Eva max The iteration is terminated and the individual with the best fitness is output, which is the planned order of visiting garbage disposal points. Otherwise, Eva is increased accordingly and the process goes to step S4.
[0181] In step S51, the specific implementation steps of the greedy crossover operator in the greedy learning strategy are as follows:
[0182] S511, determine the individuals X and individual extreme values X that need to be crossed pbest And the global extreme value Xgbest ;
[0183] S512, randomly select a point from a non-parking lot and non-transfer station as the first garbage drop point S for vehicle service, and select the garbage drop point S at X pbest The left garbage disposal point S Lp and the garbage disposal point S on the right Rp , at the garbage drop point S on the left side of X LX and the garbage disposal point S on the right RX As a candidate set for the next visit;
[0184] S513, in the candidate set {S Lp ,S Rp ,S LX ,S RX}, select S' so that S' and S form the path segment with the least transportation cost;
[0185] S514, if customer S'∈{S Lp ,S LX}, execute S515, otherwise execute S516;
[0186] S515, from individual extreme value X pbest Delete S from individual X, set S' as the next starting point S, and in the left candidate set of S {S Lp ,S LX} selects a new S' as the next garbage delivery point to be served, so that S' and S form a path segment with the lowest transportation cost, and repeats S515 until a new solution X is generated. new ;
[0187] S516, from individual extreme value X pbest Delete S from individual X, set S' as the next starting point S, and in the right candidate set of S {S Rp ,S RX} selects a new S' as the next garbage drop point to be served, so that S' and S form a path segment with the lowest transportation cost, and repeats S516 until a new solution X is generated. new ;
[0188] S517, with X and X pbest As an example, the new solution X new and the global extreme value X gbest Perform greedy crossover again to generate a new solution;
[0189] S518, output the new individual through the greedy crossover operator.
[0190] As a preferred example, in step S52, the specific implementation steps of the multivariate mutation operator in the multivariate learning strategy are as follows:
[0191] S521, calculating the selection probability of reversal mutation, exchange mutation and insertion mutation;
[0192] S522, selecting a sequence number of a variation method based on a roulette method;
[0193] S523, if mutation mode 1 is selected, the individuals are subjected to exchange mutation;
[0194] S524, if mutation method 2 is selected, then the individual is reversed;
[0195] S525, if mutation mode 3 is selected, insertion mutation is performed on the individual;
[0196] S526, output the new individual after passing the multivariate mutation operator.
[0197] The present invention also provides a garbage truck low-carbon dispatching system, comprising:
[0198] The acquisition module is used to obtain input information, including: the number of garbage delivery points N that the garbage truck needs to serve, the coordinate information of the garbage delivery points, the parking lot coordinate information, the coordinate information of the garbage transfer station, the amount of garbage at each garbage delivery point, the capacity of the garbage truck Q, and the maximum working time T of the driver max ;
[0199] A determination module is used to input the input information into a pre-built garbage truck low-carbon scheduling optimization model based on an adaptive particle swarm algorithm to determine the optimal scheduling solution;
[0200] The optimization goal of the garbage truck low-carbon scheduling optimization model based on the adaptive particle swarm algorithm is to minimize the total transportation cost of the vehicles in the planned scheduling scheme. The constraints of the garbage truck low-carbon scheduling optimization model based on the adaptive particle swarm algorithm are that all vehicles depart from the parking lot and only depart once, each garbage delivery point is only allowed to be served by one vehicle once, when each garbage delivery point is served, there must be a vehicle driving from a certain location to the garbage delivery point and leaving from the point, all vehicles will empty all the garbage at the garbage transfer station, the garbage loading amount of the vehicle in one trip is not greater than its capacity limit, and the working hours of the driver of each vehicle cannot exceed the prescribed maximum working time limit.
[0201] A computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computing device, cause the computing device to perform any of the methods described.
[0202] A computing device comprising:
[0203] One or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, and the one or more programs include instructions for executing any of the methods described.
[0204] The effect of the present invention can be further illustrated by the following simulation experiment:
[0205] 1. Experimental conditions:
[0206] The simulation was performed using Matlab 2017b on an Intel(R) Core(TM) i5-5500U CPU@2.40GHz, 8GB memory, and WINDOWS 10 system.
[0207] 2. Experimental content:
[0208] Through field research on Green Ring Company in Jiangbei New District, Nanjing, China, we obtained the longitude and latitude coordinates of the 54 communities (marked as 3-56) served by the company, the longitude and latitude coordinates of the garbage transfer station (marked as 2) and the parking lot (marked as 1), and the amount of garbage in each community on a certain day. The longitude and latitude coordinates of all points were converted into plane rectangular coordinate system coordinates, as shown in Table 1. The capacity limit of garbage trucks is 10t, and the maximum time limit for drivers is 8h.
[0209] 3. Experimental results
[0210] i. Comparison of experimental results of the present invention and the existing algorithm for solving the garbage removal problem in the case of garbage removal of Green Ring Company in Jiangbei New District, Nanjing;
[0211] ii. The adaptive particle swarm algorithm of the present invention is used to solve the vehicle dispatch path planning diagram with the minimum transportation cost for the garbage removal problem;
[0212] iii. Comparison results of the optimal solutions of the present invention and the existing algorithms for solving the garbage removal problem in terms of fixed costs, fuel costs and carbon emission costs.
[0213] The experiment was run 30 times independently in the example. Table 2 lists the comparison results of the comparison algorithm and the adaptive particle swarm algorithm. Among them, Best and mean represent the optimal and average transportation cost target values searched in 30 runs, respectively, and the best values of Best and mean are bolded. The above experimental results show that the comprehensive performance of the proposed algorithm for the garbage collection problem is better than that of various comparison algorithms, and has a higher solution accuracy. Therefore, the proposed algorithm can effectively solve the garbage collection problem and provide a vehicle scheduling solution with low transportation cost and low carbon emissions for garbage collection companies.
[0214] Table 2
[0215]
[0216] Figure 2 The specific scheduling scheme of the proposed algorithm in the example of garbage collection vehicle scheduling of Green Ring Company in Jiangbei New District, Nanjing. The black dots represent garbage disposal points, the red five-pointed stars represent garbage truck yards, and the green squares represent garbage transfer stations. The black dotted lines represent all the trips of vehicle 1, and the red solid lines represent all the trips of vehicle 2. Figure 2 It can be seen that a total of two vehicles are needed to complete the garbage removal task. The first vehicle traveled 4 trips while meeting the driver's maximum time limit, namely (1-21-14-28-29-31-32-30-27-22-25-50-2), (2-41-40-37-39-52-46-42-2), (2-4-43-53-34-33-38-36-56-35-2), (2-54-49-55-26-48-47-51-45-44-2-1), and the second vehicle's itinerary arrangement was (1-13-3-20-10-9-6-5-8-12-2), (2-11-23-15-16-19-17-18-7-24-2-1). Since the optimization goal of this problem is to minimize the transportation cost, and there is no high requirement for the time to complete the collection, it is only necessary to complete the garbage collection task within the driver's maximum working time. Therefore, reducing the use of vehicles is conducive to saving transportation costs. In addition, vehicle 2 completed the collection of the last garbage drop point in the second trip. At this time, the garbage collection task has been completed by both vehicles. Therefore, vehicle 2 only has two trips.
[0217] Figure 3 The comparison results of the optimal solutions of the proposed algorithm and the comparison algorithm in terms of fixed cost, fuel cost and carbon emission cost are given. Figure 3It can be seen that the TS algorithm has the highest fixed cost because it calls the most vehicles. The proposed algorithm achieves the lowest carbon emission cost and total transportation cost among all the comparison algorithms. Compared with HGA and SA+GA, although the proposed algorithm has a slightly higher fuel cost, its advantage in carbon emission cost is greater than its disadvantage in fuel cost, so its total transportation cost is also lower. From the formula of the optimization objective, it can be seen that the fuel cost only involves distance information, while the carbon emission cost is related to both distance and load information. The other comparison algorithms in the experiment of this paper only consider the distance information between service points, while the proposed algorithm uses distance and load as heuristic information to guide the algorithm's search operation, so it is more likely to obtain lower carbon emissions and total transportation costs. In summary, the proposed algorithm is more suitable for solving garbage removal problems. By reasonably arranging vehicles and routes, it can save transportation costs to the greatest extent, including fuel costs and carbon emission costs, and truly achieve the goal of "energy conservation and emission reduction".
[0218] Various aspects of the present invention are described in this disclosure with reference to the accompanying drawings, in which many illustrative examples are shown. Examples of the present disclosure are not necessarily defined to include all aspects of the present invention. It should be understood that the various concepts and examples introduced above can be implemented in any of many ways, because the concepts and examples disclosed in the present invention are not limited to any implementation method. In addition, some aspects disclosed in the present invention can be used alone or in any appropriate combination with other aspects disclosed in the present invention.
[0219] Although the present invention has been disclosed as above with preferred embodiments, it is not intended to limit the present invention. A person with ordinary knowledge in the technical field to which the present invention belongs may make various changes and modifications without departing from the spirit and scope of the present invention. Therefore, the protection scope of the present invention shall be determined by the definition of the claims.
[0220] 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.
[0221] 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.
[0222] 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 comprising 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.
[0223] 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. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0224] The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the technical principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.
Claims
1. A low-carbon dispatching method for garbage trucks, characterized in that: include: Get input information, including: the number of garbage collection points N that the garbage truck needs to serve, the coordinate information of the garbage collection points, the parking lot coordinate information, the garbage transfer station coordinate information, the amount of garbage at each garbage collection point, the capacity of the garbage truck Q, and the maximum working time T of the driver max ; Input information is fed into a pre-built garbage truck low-carbon dispatch optimization model based on an adaptive particle swarm algorithm to determine the optimal dispatch solution; The optimization goal of the garbage truck low-carbon scheduling optimization model based on the adaptive particle swarm algorithm is to minimize the total transportation cost of the vehicles in the planned scheduling scheme. The constraints of the garbage truck low-carbon scheduling optimization model based on the adaptive particle swarm algorithm are that all vehicles start from the parking lot and only start once, each garbage delivery point is only allowed to be served by one vehicle once, when each garbage delivery point is served, there must be a vehicle driving from a certain location to the garbage delivery point and leaving from the point, all vehicles will empty all the garbage at the garbage transfer station, the garbage loading amount of the vehicle in one trip is not greater than its capacity limit, and the working time of the driver of each vehicle cannot exceed the prescribed maximum working time limit; The input information is input into a pre-built garbage truck low-carbon dispatch optimization model based on an adaptive particle swarm algorithm to determine the optimal dispatch solution, including: Step 1: Set the adaptive particle swarm algorithm evolution population size to n, the maximum size of the neighborhood search to Y, and the maximum number of evaluations to Eva max , evaluation times counter Eva = 0; Step 2: Use integer coding to randomly generate n individuals. The code of each individual is a sequence of integers between 3 and N: X={x3,x4,x i ,…,x N } Among them, x i Indicates the number of the garbage disposal point, i = 3, 4, ..., N, the parking lot is numbered 1, the garbage transfer station is numbered 2, and the garbage disposal points are numbered 3 to N; Calculate the target value f(X) for each individual: f(X)=C fixed +C fuel +C carbon Among them, C fixed is the fixed cost, C fuel is the fuel cost, C carbon for the cost of carbon emissions; Among them, C f is the fixed cost of each vehicle, U k Indicates whether the kth car is used, K represents Total number of vehicles, Among them, C m is the fuel cost per unit distance traveled by the vehicle, B represents the set of all trips of a vehicle, d ij is the distance between garbage disposal point i and garbage disposal point j, Indicates whether the k-th vehicle passes through the path (i, j) in the b-th trip, EC ij =FE·FC ij Among them, EC ij represents the carbon emissions of a vehicle traveling from garbage disposal point i to j, FE is the fuel emission parameter, C e For carbon tax, Indicates whether the k-th vehicle serves garbage disposal point i in the b-th trip, FC ij is the amount of fuel consumed by the vehicle when traveling from garbage disposal point i to garbage disposal point j. The specific calculation method is as follows: FC ij =[α ij (z+l ij )+bv 2 ]d ij Where z represents the vehicle’s own weight, l ij represents the load of the vehicle from garbage disposal point i to j, v represents the speed of the vehicle, α ij and β are parameters related to road conditions and vehicle type, respectively, and are calculated as follows: α ij =a+gsinq ij +gC r cosq ij b=0.5C d Ar Among them, a is the vehicle acceleration, g is the gravitational acceleration constant, θ ij is the road slope from garbage disposal point i to garbage disposal point j, C r is the rolling resistance coefficient, C d is the traction coefficient, A is the front surface area of the vehicle, and ρ represents the air density; The fitness of an individual is F(X): Step 3: Use enhanced local search strategy to conduct detailed search on the decoded individuals to form new individuals; Step 4: Adopt an adaptive learning strategy based on contribution for the new individuals, adaptively select the learning method that best suits the particle's own stage, and generate offspring particles: Step 5: Update individual extreme values and global extreme values in each iteration according to the rule of survival of the fittest; Step 6, if Eva>Eva max Then the iteration is terminated and the individual with the best fitness is output, which is the individual that has planned the vehicle scheduling plan. Otherwise, Eva increases accordingly and go to step 3; The enhanced local search strategy is used to perform a fine search on the decoded individuals to form new individuals, including: Step 31, decoding the individuals by eliminating the time and capacity constraints to obtain a dispatching plan for garbage trucks; Step 32, finding the vehicle index and trip index corresponding to the trip with the most garbage placement points; Step 33, perform 2-opt optimization on the trip with the most garbage placement points, effectively opening up the intersecting routes in the trip; Step 34, re-join the optimized trip with the remaining unselected trips in order to form a new individual; in the joining process, there are two cases according to the destination of the vehicle trip: when the destination of the trip is a transfer station, it means that the vehicle will not go to the parking lot again in the trip, and only the starting point and the garbage transfer station in the trip need to be removed; when the destination of the trip is the parking lot, the vehicle goes to the garbage transfer station to unload and then returns to the parking lot, and at this time, the starting point, the garbage transfer station and the parking lot in the trip need to be removed; Step 35, outputting a new individual after implementing the enhanced local search strategy; The adaptive learning strategy based on contribution is adopted for the new individuals, and the learning method that best suits the particle's own stage is adaptively selected to generate offspring particles, including: Step 41, setting m learning strategies; Step 42, let the contribution C of each learning strategy kk =0, kk=1,2,…,m; Step 43, for each new individual ii in the population, a learning strategy learn(ii) is determined by roulette selection, a new particle Npop(ii) is generated according to learn(ii), and a target value of Npop(ii) is calculated; Step 44, sorting the new particles in the new population according to the target value to obtain the particle ranking vector r(ii); Step 45, assign weight w to the ii-th new particle according to the following formula: ii , the higher the particle ranking, the greater the weight assigned to it; Among them, w ii is the weight that the ii-th particle should be assigned, and r(ii) is the ranking of the ii-th particle; Step 46, the contribution of the kkth learning strategy is updated as follows: Among them, sf ii is the reward and penalty factor. If the fitness value of the ii-th particle is improved through the kk-th learning strategy, then sf ii =1, otherwise sf ii =0; Step 47, the method for updating and normalizing the probability of selecting the kkth learning strategy is as follows: p kk =C kk +and kk=1,2,...,m Among them, p kk is the probability of selecting the kkth learning strategy, jj represents the subscript of the learning strategy, jj=1,2,...,m, ε=0.01 is the minimum selection probability, which is used to ensure that each learning strategy has a chance to be selected; Step 48, after the particles in the population learn by selecting different learning methods, all newly generated offspring particles Npop, the target value Npopobj of the new particles, the contribution vector C of the learning strategy and the selection probability vector P are output.
2. The low-carbon dispatching method for garbage trucks according to claim 1, characterized in that: The m learning strategies include: greedy learning strategy, multivariate learning strategy, exploratory learning strategy and exploitative learning strategy. The greedy learning strategy is: the new individual is reversed to generate a mutant individual, the mutant individual and the individual extreme value are used to generate a crossover individual one through a greedy crossover operator, and the crossover individual one and the global extreme value are greedily crossed again to generate a new individual after greedy learning; The multivariate learning strategy is: generate mutant individuals through multivariate mutation operators, partially map and cross the generated mutant individuals with individual extreme values to obtain crossover individuals 1, and partially map and cross the crossover individual 1 with the global extreme value to generate new individuals after multivariate learning; The exploratory learning strategy is to generate mutant individuals through multivariate mutation operators, and partially map and cross the generated mutant individuals with the individual extreme values of any particle in the population whose fitness is better than itself, to generate new individuals after exploratory learning; The utilization learning strategy is to generate mutant individuals through multivariate mutation operators, perform partial mapping and crossover between the generated mutant individuals and individual extreme values, and generate new individuals after utilization learning.
3. The low-carbon dispatching method for garbage trucks according to claim 2, characterized in that: The greedy learning strategy includes: Step 411, determine the individuals X and individual extreme values X that need to be crossed pbest And the global extreme value X gbest ; Step 412: randomly select a point from a non-parking lot and non-transfer station as the first garbage drop point S for vehicle service. The first garbage drop point S is selected at X pbest The left garbage disposal point S Lp and the garbage disposal point S on the right Rp , at the garbage drop point S on the left side of X LX and the garbage disposal point S on the right RX As a candidate set for the next visit; Step 413, in the candidate set {S Lp ,S Rp ,S LX ,S RX } Select a garbage delivery point S' so that S' and S form a path segment with the least transportation cost; Step 414, if S'∈{S Lp ,S LX }, execute step 415, otherwise execute step 416; Step 415, from the individual extreme value X pbest Delete S from individual X, set S' as the next starting point S, and in the left candidate set of S {S Lp ,S LX } selects a new S' as the next garbage delivery point to be served, so that S' and S form a path segment with the lowest transportation cost, and repeats S515 until a new solution X is generated. new ; Step 416, from the individual extreme value X pbest Delete S from individual X, set S' as the next starting point S, and in the right candidate set of S {S Rp ,S RX } selects a new S' as the next garbage drop point to be served, so that S' and S form a path segment with the lowest transportation cost, and repeats S516 until a new solution X is generated. new ; Step 417, with X and X pbest As an example, the new solution X new and the global extreme value X gbest Perform greedy crossover again to generate a new solution; Step 418, output the new individual that passes the greedy crossover operator.
4. The low-carbon dispatching method for garbage trucks according to claim 2, characterized in that: The multi-faceted learning strategies include: Step 421, calculating the selection probabilities of reversal mutation, exchange mutation and insertion mutation; Step 422, selecting a sequence number of a variation method based on a roulette wheel method; Step 423, if the sequence number for reversal mutation is selected, exchange mutation is performed on the individual; Step 424, if the sequence number of the exchange mutation is selected, the individual is reversed; Step 425, if the sequence number of the insertion mutation is inserted, then the individual is subjected to insertion mutation; Step 426, outputting a new individual after passing through the multivariate mutation operator according to the mutation result.
5. A system based on the low-carbon dispatching method for garbage trucks according to any one of claims 1 to 4, characterized in that: include: The acquisition module is used to obtain input information, including: the number of garbage delivery points N that the garbage truck needs to serve, the coordinate information of the garbage delivery points, the parking lot coordinate information, the coordinate information of the garbage transfer station, the amount of garbage at each garbage delivery point, the capacity of the garbage truck Q, and the maximum working time T of the driver max ; A determination module is used to input the input information into a pre-built garbage truck low-carbon scheduling optimization model based on an adaptive particle swarm algorithm to determine the optimal scheduling solution; The optimization goal of the garbage truck low-carbon scheduling optimization model based on the adaptive particle swarm algorithm is to minimize the total transportation cost of the vehicles in the planned scheduling scheme. The constraints of the garbage truck low-carbon scheduling optimization model based on the adaptive particle swarm algorithm are that all vehicles depart from the parking lot and only depart once, each garbage delivery point is only allowed to be served by one vehicle once, when each garbage delivery point is served, there must be a vehicle driving from a certain location to the garbage delivery point and leaving from the point, all vehicles will empty all the garbage at the garbage transfer station, the garbage loading amount of the vehicle in one trip is not greater than its capacity limit, and the working hours of the driver of each vehicle cannot exceed the prescribed maximum working time limit.
6. A computer-readable storage medium storing one or more programs, characterized in that: The one or more programs include instructions which, when executed by a computing device, cause the computing device to perform any one of the methods according to claims 1 to 4.
7. A computing device, characterized in that include: One or more processors, a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, and the one or more programs include instructions for executing any one of the methods according to claims 1 to 4.
Citation Information
Cited By
Garbage truck scheduling method and system for garbage treatment plant
CN121169008A
