Design method, system and equipment for smart city planning and medium

By building a garbage transportation connection diagram and weight calculation in smart city planning, the garbage transportation route is optimized, and the problem of insufficient priority analysis of garbage transportation in the existing technology is solved, efficient resource allocation and transportation cost reduction are achieved, and garbage management efficiency is improved .

CN118966439APending Publication Date: 2024-11-15周海涛
View PDF 0 Cites 3 Cited by

Patent Information

Application Number
CN202411037689.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-31
Publication Date
2024-11-15

AI Technical Summary

Technical Problem

The prior art ignores the transportation priority analysis of garbage recycling areas in urban garbage transportation route planning, resulting in improper resource allocation and increased transportation costs.

Method used

By building a three-dimensional model of a smart city, the weight value of the garbage recycling area is calculated, the weight is updated based on the garbage identification results, the garbage transportation route is optimized, and the garbage truck capacity is combined with the secondary optimization to reduce transportation costs and improve efficiency.

Benefits of technology

It has achieved more effective resource allocation and transportation costs, improved garbage transportation efficiency and management level, and supported the sustainable development of smart cities.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118966439A_ABST
    Figure CN118966439A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of smart city planning, in particular to a design method, system and device for smart city planning and a medium. Comprising the following steps: firstly, analyzing the initial weight of each garbage collection area from historical data, and adjusting the initial weight in combination with related factors to obtain the most accurate garbage collection area weight so as to provide scientific data support for subsequent garbage transportation planning; secondly, a garbage transportation route initial planning method is provided, according to the monitoring result of each garbage collection area, the transportation cost is calculated by combining the weight of the area meeting the transportation condition, and an initial garbage transportation route scheme is determined by selecting the minimum cost; according to the method, the transportation cost is reduced, and the garbage transportation route is optimized; and finally, according to the method, secondary optimization is carried out on the initial garbage transportation route scheme, cost calculation is carried out by adding the garbage truck capacity and non-conforming condition areas, extra cost is reduced through reasonable scheduling, and therefore the overall transportation efficiency is further improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of smart city planning, and in particular to a design method, system, equipment and medium for smart city planning. Background Art

[0002] With the continuous development of social economy, many new demands and challenges have been put forward for urban construction. Smart city planning is a hot topic nowadays; smart city planning is a comprehensive strategy that applies advanced technologies and innovative methods to improve the sustainability, efficiency and quality of life of residents in cities.

[0003] Smart city planning is a huge project, including many aspects, such as intelligent transportation system, intelligent energy management system, intelligent water system and intelligent buildings. In the process of smart city planning, it is necessary not only to realize the intelligence of urban infrastructure, but also other aspects, such as urban garbage transportation.

[0004] Intelligent urban waste transportation planning can use advanced technology and data analysis to improve the efficiency of waste collection and treatment, reduce resource waste and environmental pollution, while improving residents' quality of life and beautifying the city.

[0005] The transportation of urban garbage is a very complicated task. With the increase of urban population, the generation of garbage also increases, and the urban garbage is not concentrated, which causes certain troubles in the transportation of garbage. Therefore, the management of urban garbage is also a very important part of building a smart city.

[0006] Intelligent garbage transportation route planning can reduce the idle time and driving distance of garbage collection vehicles, thereby saving fuel costs and human resources; by optimizing routes, operating costs can be reduced while ensuring service quality; strategy adjustments and resource optimization based on actual data can further improve the efficiency and effectiveness of garbage management.

[0007] There are many excellent methods for intelligent planning of urban garbage transportation in the prior art. For example, the Chinese patent with publication number CN115526427A in the prior art proposes a method for planning and layout of garbage transfer stations; this method determines the amount of garbage to be transferred at each transfer point according to the weight of each transfer point, and then clusters each collection point; it refines the transportation cost of garbage collection and transportation vehicles in the area, and intelligently analyzes the optimal configuration and route of the collection and transportation vehicles of a large number of garbage collection points within the range. For another example, the Chinese patent with publication number CN114529061A in the prior art discloses a method for automatically predicting garbage output distribution and planning the optimal transportation route. This method establishes the necessary preconditions for the optimal transportation route planning module through an information processing module; establishes a garbage distribution prediction module, and sends historical garbage distribution data into it for training; combined with the optimal transportation route planning module, the garbage output distribution of each region in the future is predicted through the trained garbage distribution prediction module, and the optimal transportation planning module is used to calculate the optimal transportation route. The above-mentioned existing technologies realize the planning of urban garbage transportation routes, but there are some defects therein, such as ignoring the analysis of garbage transportation priority in garbage recycling areas, which leads to the inability to allocate resources well and increases the cost of garbage transportation.

[0008] To this end, the present invention proposes a design method, system, device and medium for smart city planning. Summary of the invention

[0009] The purpose of the present invention is to propose a design method, system, equipment and medium for smart city planning to realize intelligent planning of urban garbage transportation scheme; the present invention mainly starts from the following points; first, the present invention constructs a garbage transportation connectivity graph based on the three-dimensional model of the smart city, and the connectivity graph takes the garbage recycling area as the starting point, the garbage treatment area as the target point, and the transportable routes between the garbage recycling area and the garbage treatment area as the connecting edges between the points; wherein, the present invention divides the garbage recycling area into special garbage recycling areas and special garbage recycling areas, and calculates the weight value of each area by the historical relevant data of the seasonal time series and the types of different garbage areas, so as to achieve more effective resource allocation, improve processing efficiency, cope with seasonal changes, improve environmental management, and support the sustainable development of smart cities. Continuous development; secondly, the present invention proposes a method for initial planning of garbage transportation routes, which identifies garbage in a garbage recycling area and determines whether the garbage transportation conditions are met; when the conditions are met, the weight values ​​of the garbage recycling areas that meet the conditions are updated according to the garbage identification results, and the garbage recycling areas are sorted in descending order to obtain a sequence of transportable starting points; according to the connection relationship of the garbage transportation connectivity graph, the comprehensive cost of the loading process, transportation process in the garbage recycling area and unloading process in the garbage treatment area are calculated; an initial garbage transportation route planning scheme is obtained according to the minimum cost value; in order to further optimize the garbage transportation planning, the present invention performs secondary scheme planning on the capacity of the garbage truck and the garbage recycling areas that do not meet the conditions on the basis of the initial garbage transportation planning scheme, which can not only save resources and costs, but also improve the overall garbage transportation efficiency and management level.

[0010] To achieve the above object, the present invention provides the following technical solutions:

[0011] In a first aspect, the present invention provides a design method for smart city planning, comprising:

[0012] Marking garbage collection areas in the 3D model of the smart city;

[0013] Further, the garbage recycling area is classified to obtain a garbage recycling area classification result; wherein the garbage recycling area classification result includes: a special garbage recycling area and a non-special garbage recycling area;

[0014] Furthermore, the weight of the garbage recycling area is calculated according to the classification result of the garbage recycling area; wherein the weight calculation process of the garbage recycling area is:

[0015] Collect relevant historical data of each of the garbage recycling areas; wherein the relevant historical data is collected in a seasonal time series, including: historical garbage production, historical population density and historical activity information;

[0016] Further, the relevant historical data is preprocessed to obtain standardized relevant historical data;

[0017] Furthermore, the initial garbage collection area weight is calculated according to the standardized related historical data; wherein the calculation formula of the initial garbage collection area weight is: IW i =α1*X i +α2*Y i +α3*Z i Among them, IW i It is represented as the initial garbage collection area weight of the i-th season; X i Represented as the standardized historical garbage production data of the i-th season; Y i Represented as the standardized historical population density data of the i-th season; Z i It is represented by the standardized historical activity data of the i-th season; α1 is represented by the weight parameter of historical garbage production; α2 is represented by the weight parameter of historical population density; α3 is represented by the weight parameter of historical activities;

[0018] Furthermore, the initial garbage collection area weight is adjusted according to the garbage collection area classification result to obtain the garbage collection area weight; wherein the calculation formula of the garbage collection area weight is: SW i new =γ*IW i +λ*σ i ; Among them, SW i new It is represented as the garbage collection area weight of the garbage collection area in the i-th season; σ i It is represented as the adjustment increment of the ith seasonal region; γ is represented as the attenuation factor; λ is represented as the increment coefficient;

[0019] Furthermore, a garbage transportation connectivity graph is constructed according to the smart city three-dimensional model; the garbage transportation connectivity graph includes: N starting points, M target points and P connected edges; wherein the starting point is represented as the garbage recycling area; the target point is represented as the garbage processing area; the connected edge is represented as a reachable relationship from the starting point to the target point;

[0020] Further, initializing the starting point, target point and connected edges of the garbage transportation connected graph;

[0021] Further, the garbage containers in the garbage recycling area are monitored to identify the garbage storage status; wherein the garbage storage status includes: garbage type, garbage filling density, garbage storage time and garbage decay degree; wherein the garbage storage status identification process includes: obtaining the time from the placement of the garbage in the garbage container to the current monitoring time as the garbage storage time;

[0022] Calculate the garbage filling density of the garbage container; wherein the calculation formula of the garbage filling density is: Wherein, AAG represents the actual amount of garbage in the garbage container; TBC represents the total capacity of the garbage container;

[0023] Acquire a garbage image in the garbage container and a first smell inside the garbage container;

[0024] The garbage image and the first odor are input into a garbage recognition model to obtain the garbage type and the garbage decay degree respectively; wherein the garbage recognition model comprises: an input layer comprises: an image input module and an odor input module, respectively used to receive the garbage image and the first odor, and perform data processing to obtain a standard garbage image and a standard odor; an identification layer comprises: a garbage type identification module, an image decay degree identification module and an odor decay degree identification module, to obtain garbage classification probability, image decay degree value and odor decay degree value; an output layer comprises: a garbage type output module and a comprehensive decay degree output module, to obtain the garbage type and the garbage decay degree.

[0025] Furthermore, an initial garbage transportation route plan is planned; wherein the planning process of the initial garbage transportation route plan includes: obtaining the garbage transportation tolerance according to the garbage storage state; judging whether the garbage transportation tolerance exceeds the garbage transportation threshold; when it does not exceed, the garbage recycling area does not carry out transportation processing; when it exceeds, the garbage recycling area carries out transportation processing; calculating the garbage pre-transportation value of the garbage recycling area where the garbage can be transported; wherein the calculation formula of the garbage pre-transportation value is: PTV S_j It is the pre-transport value of garbage in the garbage collection area j where garbage can be transported; Q is the total number of garbage containers in the garbage collection area j; GDTV q It is represented as the waste transport tolerance of the qth waste container in waste collection area j;

[0026] updating the garbage collection area weight of the starting point according to the garbage pre-transportation value;

[0027] Sorting the updated garbage recycling area weights in descending order to obtain a sequence of garbage transportable starting points;

[0028] Acquire a transportation route from each starting point in the sequence of garbage transportable starting points to the target point from the garbage transportation connectivity graph;

[0029] Calculate the transportation cost of the transportation route; wherein the calculation formula of the transportation cost is:

[0030]

[0031] Among them, SC <S_j→T_k> Expressed as the transportation cost from starting point j to destination point k; LT q It is represented as the garbage loading time of the qth garbage container in the starting point j; TT <S_j→S_k> Expressed as the route transportation time between the starting point j and the target point k; UT T_k It represents the garbage unloading time of the target point k; c1 represents the unit cost coefficient of garbage loading; c2 represents the unit cost coefficient of garbage transportation; c3 represents the unit cost coefficient of garbage unloading; Δμ represents the transportation cost loss;

[0032] The costs of all transportation plans in the garbage transportable starting point sequence are calculated according to the transportation cost, and the transportation plan corresponding to the minimum transportation plan cost is selected as the initial garbage transportation route plan.

[0033] Further, the initial garbage transportation route plan is optimized to obtain an optimal garbage transportation route plan;

[0034] Among them, the optimization process of the optimal garbage transportation route plan includes: obtaining the garbage carrying capacity of the garbage truck; wherein, the garbage carrying capacity includes: special garbage carrying capacity and non-special garbage carrying capacity; constructing a garbage recycling area set; wherein, the garbage recycling area set includes: transportable garbage recycling area information and non-transportable garbage recycling area information; loading garbage at the starting point with the highest priority in the garbage transportation connectivity graph; calculating the remaining garbage loading capacity of the garbage truck after loading; making a next operation judgment based on the remaining garbage loading capacity; wherein, the next operation includes: driving towards the garbage treatment area and driving towards the remaining garbage recycling area; traversing the remaining points in the garbage transportation connectivity graph to obtain an optimized transportation cost set; selecting the transportation plan corresponding to the minimum garbage transportation cost in the optimized transportation cost set as the optimal garbage transportation route plan.

[0035] In a second aspect, the present invention provides a design system for smart city planning, the system comprising: a monitoring unit, a data acquisition unit, a three-dimensional modeling unit, a garbage status prompt unit, a route generation unit, an optimal route planning unit and a display unit;

[0036] Wherein, the monitoring unit is used to monitor the garbage collection area, garbage truck transportation and garbage disposal area;

[0037] The data collection unit is used to collect information about garbage transportation in the city;

[0038] The three-dimensional modeling unit is used to establish a three-dimensional model of a smart city, which mainly includes: a garbage collection area, a garbage transportation route, and a garbage disposal area;

[0039] The garbage status prompting unit is used to prompt relevant staff to transport garbage from the garbage collection area;

[0040] Wherein, the garbage status prompt unit comprises: respectively obtaining the garbage placement time, garbage filling density, image information and odor information of each garbage container in the garbage recycling area;

[0041] Wherein, the garbage placement time is recorded as the garbage storage time;

[0042] The calculation formula of the garbage filling density is: Wherein, AAG represents the actual amount of garbage in the garbage container; TBC represents the total capacity of the garbage container;

[0043] Inputting the image information and the odor information into a garbage recognition model to obtain the type of garbage and the degree of garbage decay respectively;

[0044] Among them, the garbage recognition model includes: the input layer includes: an image input module and an odor input module, which are respectively used to receive the image information and the odor information, and perform data processing to obtain standard garbage images and standard odors; the recognition layer includes: a garbage type recognition module, an image decay degree recognition module and an odor decay degree recognition module, to obtain garbage classification probability, image decay degree value and odor decay degree value; the output layer includes: a garbage type output module and a comprehensive decay degree output module, to obtain the garbage type and the garbage decay degree.

[0045] The route generation unit is used to generate an initial garbage transportation route; wherein the route generation unit includes: obtaining a garbage transportation tolerance according to the garbage storage state; judging whether the garbage transportation tolerance exceeds the garbage transportation threshold; when it does not exceed, the garbage recycling area does not carry out transportation processing; when it exceeds, the garbage recycling area carries out transportation processing; calculating the garbage pre-transport value of the garbage recycling area where the garbage can be transported; wherein the calculation formula of the garbage pre-transport value is: PTV S_j It is the pre-transport value of garbage in the garbage collection area j where garbage can be transported; Q is the total number of garbage containers in the garbage collection area j; GDTV q It is represented as the waste transport tolerance of the qth waste container in waste collection area j;

[0046] Updating the garbage collection area weight according to the garbage pre-transportation value;

[0047] Sorting the updated garbage recycling area weights in descending order to obtain a sequence of garbage transportable starting points;

[0048] Obtaining a transportation route from each starting point to a target point in the sequence of transportable garbage starting points from a garbage transportation connectivity graph;

[0049] Calculate the transportation cost of the transportation route; wherein the calculation formula of the transportation cost is:

[0050]

[0051] Among them, SC S_j→T_k> Expressed as the transportation cost from starting point j to destination point k; LT q It is represented as the garbage loading time of the qth garbage container in the starting point j; TT <S_j→S_k> Expressed as the route transportation time between the starting point j and the target point k; UT T_k It represents the garbage unloading time of the target point k; c1 represents the unit cost coefficient of garbage loading; c2 represents the unit cost coefficient of garbage transportation; c3 represents the unit cost coefficient of garbage unloading; Δμ represents the transportation cost loss;

[0052] The costs of all transportation plans in the garbage transportable starting point sequence are calculated according to the transportation cost, and the transportation plan corresponding to the minimum transportation plan cost is selected as the initial garbage transportation route plan.

[0053] The optimal route planning unit is used to optimize the garbage transportation route plan; wherein, the optimal route planning unit includes: obtaining the garbage carrying capacity of the garbage truck; wherein, the garbage carrying capacity includes: special garbage carrying capacity and non-special garbage carrying capacity; constructing a garbage recycling area set; wherein, the garbage recycling area set includes: transportable garbage recycling area information and non-transportable garbage recycling area information; loading garbage at the starting point with the highest priority in the garbage transportation connectivity graph; calculating the remaining garbage loading amount of the garbage truck after loading; making a next operation judgment based on the remaining garbage loading amount; wherein, the next operation includes: driving to the garbage treatment area and driving to the remaining garbage recycling area; traversing the remaining points in the garbage transportation connectivity graph to obtain an optimized transportation cost set; selecting the transportation plan corresponding to the minimum garbage transportation cost in the optimized transportation cost set as the optimal garbage transportation route plan.

[0054] The display unit is used to display the garbage status of the garbage collection area and the garbage transportation route.

[0055] In a third aspect, the present invention proposes a design device for smart city planning, the device comprising at least a processor and a memory, the processor being used to implement the steps of the method as described in any one of claims 1 to 4 above when executing a computer program stored in the memory.

[0056] In a fourth aspect, the present invention proposes a design medium for smart city planning, which is a computer program that can be executed by an electronic device. When the program runs on the electronic device, the electronic device executes the steps of the method described in any one of claims 1 to 4.

[0057] Compared with the prior art, the present invention has the following beneficial effects:

[0058] 1. The present invention analyzes the relevant historical data of the garbage recycling area, and calculates the initial weights of the garbage recycling area in different seasons from data such as historical garbage production, historical population density and historical activity information; in order to deeply analyze the importance of different types of garbage recycling areas, the present invention adjusts the initial weights in combination with relevant influencing factors, so that efficient garbage transportation plans can be planned, more effective resource allocation can be achieved, and transportation costs can be reduced.

[0059] 2. The present invention proposes an initial garbage transportation route planning method, which plans qualified garbage recycling areas according to the monitoring results of the garbage recycling areas, updates the weight values ​​of the qualified garbage recycling areas through the garbage identification results and the weights of the garbage recycling areas, and sorts them in descending order to obtain a sequence of transportable starting points; according to the connection relationship of the garbage transportation connectivity graph, the comprehensive cost of the loading process, transportation process of the garbage recycling area and unloading process of the garbage treatment area is calculated, and the garbage transportation planning scheme is obtained according to the minimum cost value; the overall operating cost is effectively reduced and the garbage transportation route is optimized.

[0060] 3. The present invention proposes a method for optimizing garbage transportation planning; the method performs secondary optimization on the initial garbage transportation planning scheme, calculates the transportation cost by combining the capacity of the garbage truck and the areas that do not meet the transportation conditions; considers the maximum loading capacity of the garbage truck to ensure that each transportation can maximize the capacity of the garbage truck and reduce the number of empty loads or transportations; combines the driving route of the garbage truck and the characteristics of the areas that do not meet the conditions, and attempts to reduce additional costs through reasonable scheduling or area allocation; thereby improving the overall transportation efficiency and reducing transportation costs. BRIEF DESCRIPTION OF THE DRAWINGS

[0061] Figure 1 A flow chart of a design method for smart city planning provided by an embodiment of the present invention;

[0062] Figure 2 A structural diagram of a design system for smart city planning provided by an embodiment of the present invention;

[0063] Figure 3 A garbage transport connectivity diagram provided by an embodiment of the present invention;

[0064] Figure 4An initialized garbage transport connectivity graph provided by an embodiment of the present invention;

[0065] Figure 5 A garbage transport connectivity graph after weight update provided by an embodiment of the present invention;

[0066] Figure 6 A schematic diagram of an initial garbage transportation route solution provided by an embodiment of the present invention;

[0067] Figure 7 A schematic diagram of an optimized garbage transportation route solution provided by an embodiment of the present invention;

[0068] Figure 8 A schematic diagram of the structure of a design device for smart city planning provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0069] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0070] Smart city planning uses advanced technologies and data-driven approaches to improve urban operating efficiency and the quality of life of residents; its design includes multiple aspects such as intelligent traffic management, environmental monitoring and governance, and digital services.

[0071] Today's smart city planning is mainly focused on infrastructure, including transportation, energy, water and waste disposal. By embedding sensors and data collection equipment, real-time monitoring, management and optimization of infrastructure can be achieved. In terms of waste disposal, through intelligent planning of waste transportation routes, cities can achieve precise and efficient waste collection and treatment, effectively reduce resource waste and environmental pollution, and improve the quality of life of residents and the level of modernization of urban management.

[0072] Many documents have proposed corresponding solutions for the planning of urban garbage transportation routes, but research on the prior art has found that most methods only make the best selection for transportation route selection, but ignore the analysis of garbage transportation priority in the garbage recycling area, which makes it impossible to allocate resources well and increases transportation costs. To this end, the present invention proposes a design method, system, device and medium for smart city planning to solve the problems existing in the prior art. The following will be described in detail from two embodiments.

[0073] Embodiment 1:

[0074] In the embodiment of the present application, the present solution is described for city A; city A has 4 districts, namely district 1, district 2, district 3 and district 4; in the present solution, districts are used as units to implement garbage transportation route planning in each district. Taking district 2 as an example, the present embodiment combines the proposed method with the system to implement transportation route planning for district 2; for the method flow and system structure proposed in the present invention, please refer to Figure 1 and Figure 2 Content. Figure 1 The specific process of the method includes: S10. Marking the garbage recycling areas in the three-dimensional model of the smart city; S20. Classifying the garbage recycling areas; S30. Calculating the weights of the garbage recycling areas according to the classification results of the garbage recycling areas; S40. Constructing a garbage transportation connectivity map; S50. Initializing the garbage transportation connectivity map; S60. Planning the initial garbage transportation route plan; S70. Optimizing the garbage transportation route plan. Figure 2 The structure of the system includes: a monitoring unit, a data acquisition unit, a three-dimensional modeling unit, a garbage status prompt unit, a route generation unit, an optimal route planning unit and a display unit.

[0075] Further, according to Figure 1 and Figure 2 Description of the content embodiment;

[0076] Performing three-dimensional modeling of city A according to the three-dimensional modeling unit of the system to obtain a smart city three-dimensional model; wherein the smart city three-dimensional model includes four plate areas;

[0077] Further, the garbage collection area in the second area block in the smart city three-dimensional model is marked, corresponding to step S10; wherein the second area block is the three-dimensional model of area 2;

[0078] Further, the marked garbage collection areas are classified, corresponding to step S20; wherein the classification results include: special garbage collection areas and non-special garbage collection areas;

[0079] According to the labeling results of the smart city 3D model, it can be concluded that District 2 has 5 garbage recycling areas, namely commercial area, residential area, school, industrial park and hospital; among them, commercial area, residential area and school can be classified as non-special garbage recycling areas; industrial park and hospital can be classified as special garbage recycling areas;

[0080] Furthermore, the garbage collection area weights of each garbage collection area are calculated, corresponding to step S30; the specific calculation process includes:

[0081] The data collection unit of the system acquires relevant historical data of each garbage collection area in zone 2 for the past five years, and segments and integrates the data based on seasons as time series; wherein the relevant historical data includes: historical garbage production, historical population density and historical activity information;

[0082] Further, the relevant historical data is preprocessed to obtain standardized relevant historical data; wherein the preprocessing process mainly includes: data cleaning of the relevant historical data to remove abnormal values ​​and missing values; feature extraction of the cleaned data, such as historical activity information including: holidays and held activities, commercial performances and production tasks, etc.; standardization and normalization of the data after feature extraction to obtain standardized relevant historical data;

[0083] Furthermore, the initial garbage collection area weight is calculated based on the standardized relevant historical data; wherein the calculation formula of the initial garbage collection area weight is: IW i =α1*X i +α2*Y i +α3*Z i Among them, IW i It is represented as the initial garbage collection area weight of the i-th season; X i Represented as the standardized historical garbage production data of the i-th season; Y i Represented as the standardized historical population density data of the i-th season; Z i It is represented by the standardized historical activity data of the i-th season; α1 is represented by the weight parameter of historical garbage production; α2 is represented by the weight parameter of historical population density; α3 is represented by the weight parameter of historical activities;

[0084] In the embodiment of the present application, the calculation results of the initial garbage recycling area weights of the commercial area and the industrial park in the third season of Zone 2 are given;

[0085] Commercial area: IW3 = 0.5*0.6+0.3*0.4+0.2*0.2 = 0.46;

[0086] Industrial Park: IW3 = 0.5*0.8+0.3*0.3+0.2*0.1 = 0.51;

[0087] From the above, it can be concluded that the weight parameter α1 of garbage production, the weight parameter α2 of historical population density and the weight parameter α3 of historical activities in the third season are set to 0.5, 0.3 and 0.2 respectively; the setting of weight parameters is based on the analysis of historical data of the same season in 5 years. The initial garbage recycling area weight of District 2 in the commercial area in the third season is 0.46; the initial garbage recycling area weight of the industrial park in the third season is 0.51.

[0088] Further, the initial waste recycling area weight is adjusted according to the waste recycling area classification result to obtain the waste recycling area weight; wherein, the weight update principle is mainly due to the different natures of waste recycling areas, corresponding to changes in urban policies and citizen needs, and it is necessary to consider multiple factors to re-optimize the importance of each area;

[0089] As mentioned above, the calculation formula of the garbage collection area weight is: SW i new =γ*IW i +λ*σ i ; Among them, SW i new It is represented as the garbage collection area weight of the garbage collection area in the i-th season; σ i It is expressed as the adjustment increment of the special area in the i-th season; γ is the attenuation factor; λ is the increment coefficient;

[0090] According to the initial garbage collection area weight calculation of the third season commercial area and industrial park listed in the above embodiment of the present application, the weight is adjusted as follows:

[0091] Commercial area:

[0092] Industrial Park:

[0093] From the above calculation results, we can conclude that the weights of waste recycling areas in commercial areas and industrial parks are 0.30 and 0.50 respectively;

[0094] In the embodiment of the present application, the relevant historical data of zone 2 is analyzed in seasonal time series, and the initial weights of the garbage recycling areas in different seasons are calculated from data such as historical garbage production, historical population density and historical activity information; in order to deeply analyze the importance of different types of garbage recycling areas, the present invention adjusts the initial weights in combination with relevant influencing factors, so that efficient garbage transportation plans can be planned and more effective resource allocation can be achieved.

[0095] Further, a garbage transport connectivity diagram is constructed according to the contents of area 2 in the smart city three-dimensional model, corresponding to step S40; for details, the garbage transport connectivity diagram can be found in Figure 3 Content, in Figure 3 There are 7 points and 10 connected edges in the graph; among them, the commercial area, school, residential area, hospital, industrial park, garbage disposal area 1 and garbage disposal area 2; in the garbage transportation connectivity graph, the commercial area, school, residential area, hospital and industrial park are used as starting points; garbage disposal area 1 and garbage disposal area 2 are used as target points; the connected edges represent the direct or indirect reachability between points;

[0096] In order to more clearly describe the transportation route planning process, in the embodiment of the present application, the commercial area, school, residential area, hospital, industrial park, garbage disposal area 1 and garbage disposal area 2 are replaced by v1, v2, v3, v4, v5, d1 and d2 symbols respectively;

[0097] Further, the garbage transport connectivity graph is initialized, corresponding to step S50; the initialization mainly includes: marking the area type of the starting point in the garbage transport connectivity graph, which is divided into special areas and non-special areas; marking the garbage recycling area weight of each starting point; marking the initial connectivity edge value of the connectivity edge; wherein the initial connectivity edge value is based on the time required for the garbage truck to travel at a constant speed; for details, see Figure 4 Further, the route generation unit of the system performs initial garbage transportation route planning, corresponding to step S60; the specific planning process includes:

[0098] The monitoring unit of the system monitors each garbage container in each garbage collection area to identify the garbage storage status in the garbage container; wherein the garbage storage status includes: garbage type, garbage filling density, garbage storage time and garbage decay degree; the monitoring and identification process of the garbage status in v1 is described in the embodiment of the present application; there are 10 garbage containers of uniform specifications in v1;

[0099] First, the placement time of the garbage in each garbage container is obtained as the garbage storage time; the recording standard is based on the interval between the placement of the garbage and the monitoring point after the most recent garbage cleaning;

[0100] Secondly, calculate the packing density of each garbage container; the packing density is calculated as: Wherein, AAG represents the actual amount of garbage in the garbage container; TBC represents the total capacity of the garbage container; wherein the actual amount of garbage can be obtained through a weight sensor installed at the bottom of the garbage container;

[0101] Further, the garbage image and smell in the garbage container are obtained; the image and smell information are input into the garbage recognition model; the model includes: an input layer, a recognition layer and an output layer; wherein the input layer includes: an image input module and an smell input module; the image input module receives the captured garbage image for image preprocessing; the smell input module uses an odor sensor to collect odor information; the recognition layer includes: a garbage type recognition module, an image decay degree recognition module and an odor decay degree recognition module; the garbage type recognition model uses a CNN model to classify garbage into hazardous garbage and harmless garbage; the image decay degree recognition module is used to locate the decay position of garbage in the image, and analyze the decay degree of garbage by color features and shape features; the odor decay degree recognition module analyzes the emitted volatile organic compounds and other chemical substances with the detection instrument, thereby detecting the decay degree in terms of odor; the output layer includes: a garbage type output module and a comprehensive decay degree output module, and obtains the type and decay degree of garbage;

[0102] Furthermore, the garbage status prompting unit of the system provides feedback to relevant staff members based on the obtained garbage storage status; the garbage status identified in some garbage containers in the commercial area is given in Table 1 below;

[0103] Table 1. Status of garbage in some garbage containers

[0104] Garbage container serial number Type of garbage Garbage filling density Garbage storage time Degree of garbage decay Garbage container 1 General garbage medium 2 days Low Garbage container 2 General garbage high 5 days medium Garbage container 3 Toxic waste Low 1 day high

[0105] In the embodiment of the present application, the garbage storage status in the garbage containers in the garbage recycling area is monitored; wherein the garbage storage status includes: garbage type, garbage filling density, garbage storage time and garbage decay degree; based on the above aspects, it is judged whether the garbage in the current garbage recycling area is transported, so that the garbage transportation route and time arrangement can be optimized; it can avoid empty transportation vehicles or premature transportation, reduce transportation costs and energy consumption, and improve transportation efficiency.

[0106] Furthermore, the garbage transportation tolerability is obtained according to the garbage status; wherein, the garbage transportation tolerability is obtained by comparing the garbage transportation conditions, such as: comparing the garbage filling density with the maximum allowable garbage filling density, comparing the garbage storage time with the maximum allowable garbage time, and comparing the garbage decay degree with the maximum allowable decay degree, etc. to obtain the garbage transportation tolerability; but when the identified garbage status does not meet the garbage transportation conditions, the garbage transportation tolerability can be comprehensively calculated based on the various status values.

[0107] Further, it is determined whether the garbage transportation tolerance exceeds the garbage transportation threshold; if it does not exceed, the garbage recycling area does not carry out transportation processing; if it exceeds, the garbage recycling area carries out transportation processing;

[0108] Based on the garbage status identified by the above method, the garbage transportation tolerance is obtained. It is judged that commercial areas, residential areas, hospitals and industrial parks meet the garbage transportation standards; schools do not meet the garbage transportation standards;

[0109] calculate Figure 4 The garbage pre-transportation value of v1, v3, v4 and v5; the calculation formula of the garbage pre-transportation value is: Among them, PTV S_vk It is represented by the pre-transport value of the garbage that can be transported to the vk point; Q is represented by the total number of garbage containers at the vk point; GDTV q The waste transport tolerance of the qth waste container represented by vk point; represents the garbage collection area weight of the corresponding point in the current third season;

[0110] In Table 2, the embodiment of the present application provides the calculated garbage pre-transportation value;

[0111] Table 2. Calculation of pre-transport value of garbage

[0112] Starting point number Pre-transport value of waste v1(commercial area) 1.75 v3(Residential area) 0.75 v4(Hospital) 5.42 v5(Industrial Park) 1.39

[0113] In Table 2, the waste pre-transportation values ​​of the transportable waste recycling areas in this application example are given, which are: v1 (commercial area) is 1.75, v3 (residential area) is 0.75, v4 (hospital) is 5.42 and v5 (industrial park) is 1.39;

[0114] Further, the garbage collection area weight of the starting point is updated according to the garbage pre-transportation value; Figure 5 content;

[0115] Further, the updated garbage collection area weights are sorted in descending order to obtain a garbage transportable starting point sequence; in the embodiment of the present application, the garbage transportable starting point sequence is recorded as: S = {(v4: 5.42), (v1: 1.75), (v5: 1.39), (v3: 0.75)};

[0116] Further, obtaining a transportation route from each starting point in the sequence of garbage transportable starting points to the target point from the garbage transportation connectivity graph;

[0117] Calculate the transportation cost of the transportation route; combine the above obtained garbage transportable starting point sequence with Figure 5 In the embodiment of the present application, the transportation cost formula can be defined as:

[0118]

[0119] Among them, SC <S_vk→T_dj>It is expressed as the transportation cost from point vk in the sequence of garbage transportable starting points to the garbage treatment area dj; LT q It is represented as the garbage loading time of the qth garbage container in point vk; TT <S_vk→T_dj> It is represented as the route transportation time between point vk and garbage treatment area dj, that is, the initial connected edge value; UT_dj is represented as the garbage unloading time of garbage treatment area dj; c1 is represented as the unit cost coefficient of garbage loading; c2 is represented as the unit cost coefficient of garbage transportation; c3 is represented as the unit cost coefficient of garbage unloading; Δμ is represented as the transportation cost loss;

[0120] Further, the initial connected edge value of the garbage transportation connected graph is updated according to the transportation cost;

[0121] Furthermore, the total garbage transportation cost of each garbage transportation route is calculated according to the updated initial connected edge value; wherein the calculation formula of the total garbage transportation cost is: Among them, GTTC S_vk→T_dj> It is represented by the total cost of garbage transportation from point vk to garbage disposal area dj; N is represented by the number of connected edges from point vk to garbage disposal area dj;

[0122] Furthermore, the total garbage transportation cost of each point in the sequence of garbage transportable starting points can be obtained based on the calculated total garbage transportation cost.

[0123] Furthermore, the total cost of garbage transportation is sorted in ascending order, and the garbage transportation route corresponding to the smallest value is used as the initial garbage transportation route plan; see Figure 6 ,exist Figure 6 The initial garbage transportation route plan diagram for the embodiment of the present application is given in FIG. Figure 6 According to the calculation, v2 does not reach the garbage transportation threshold and therefore does not participate in the planning of this initial garbage transportation route plan; after planning by v1 and v5, the garbage is transported to the garbage treatment area d1; after planning by v1 and v4, the garbage is transported to the garbage treatment area d2; according to the planning results, point v4 is given priority transportation to the hospital.

[0124] In the embodiment of the present application, a method for initial garbage transportation route planning is used to plan the garbage transportation route for zone 2; the method plans eligible garbage recycling areas according to the monitoring results of the garbage recycling areas, updates the weight values ​​of the eligible garbage recycling areas through the garbage identification results and the weights of the garbage recycling areas, and sorts them in descending order to obtain a sequence of transportable starting points; according to the connection relationship of the garbage transportation connectivity graph, the comprehensive cost of the loading process, transportation process of the garbage recycling area and unloading process of the garbage treatment area is calculated, and the garbage transportation planning scheme is obtained according to the minimum cost value; this method not only effectively reduces the operating cost of the overall garbage treatment system, but also improves the garbage treatment efficiency and resource utilization.

[0125] Furthermore, the optimal route planning unit of the system optimizes the initial garbage transportation route plan, corresponding to step S70, and the specific process includes:

[0126] Obtaining the garbage carrying capacity of the garbage truck; wherein the garbage carrying capacity includes: special garbage carrying capacity and non-special garbage carrying capacity;

[0127] Furthermore, unplanned garbage collection areas are incorporated into the optimization process to construct a set of garbage collection areas;

[0128] Further, an initial garbage transportation route plan is executed; wherein v4 is used as the top priority recycling area in the initial garbage transportation route plan;

[0129] Furthermore, the remaining garbage loading amount of the garbage truck is calculated after loading v4 with garbage;

[0130] Further, the next operation of the garbage truck is determined according to the current loading state of the garbage truck; wherein the next operation includes: driving to the garbage disposal area and driving to the residual garbage recycling area;

[0131] Further, the remaining points in the garbage transportation connectivity graph are traversed to obtain an optimized transportation cost set; wherein the optimized transportation cost set obtains the transportation cost after loading garbage in other garbage areas according to the remaining loading capacity of the current garbage truck, and compares the cost under direct transportation to obtain the optimized transportation cost set;

[0132] Further, the transportation plan corresponding to the minimum garbage transportation cost in the optimized transportation cost set is selected as the optimal garbage transportation route plan; Figure 7 ,exist Figure 7 The optimized garbage transportation route is given in the figure.

[0133] Furthermore, the display unit of the system displays the garbage status of the garbage recycling area and the garbage transportation route.

[0134] In the application embodiment, the system and method of the present invention are combined to realize the intelligent planning of urban garbage transportation scheme; the present invention mainly starts from the following aspects; first, the present invention marks the corresponding garbage recycling area in the three-dimensional model of the smart city, and analyzes the weight value of each area through historical data combined with different influences, so as to better plan the garbage transportation scheme and realize effective resource allocation; secondly, the present invention proposes a method for initializing garbage transportation planning; this method plans the garbage recycling area that meets the conditions according to the monitoring results of the garbage recycling area, updates the weight value of the garbage recycling area that meets the conditions according to the garbage identification results and the weight of the garbage recycling area, and sorts them in descending order to obtain a sequence of transportable starting points; according to the connection relationship of the garbage transportation connectivity graph, the garbage recycling area is calculated. The comprehensive cost of the loading process, transportation process and unloading process in the garbage recycling area and the garbage treatment area is calculated, and the garbage transportation planning scheme is obtained according to the minimum cost value; this method not only effectively reduces the operating cost of the overall garbage treatment system; finally, in order to minimize the garbage cost, the present invention proposes a method for optimizing garbage transportation planning; this method performs a secondary optimization on the initial garbage transportation planning scheme, and calculates the transportation cost by combining the capacity of the garbage truck and the area that does not meet the transportation conditions; considers the maximum loading capacity of the garbage truck to ensure that each transportation can maximize the capacity of the garbage truck and reduce empty loads or times; combines the driving route of the garbage truck and the characteristics of the area that does not meet the conditions, and attempts to reduce additional costs through reasonable scheduling or area allocation; thereby improving the overall transportation efficiency.

[0135] Embodiment 2:

[0136] In Example 1, the method of the present invention is combined with the system to implement the garbage transportation route planning for District 2 of City A. In order to further illustrate the effectiveness of the present invention, District 3 of City A will be technically described in the embodiment of this application. It is known that District 3 has a total of 8 garbage collection areas and 3 garbage treatment areas. The specific process is basically the same as the implementation process of Example 1, mainly including:

[0137] Mark the garbage collection area in area 3;

[0138] Further, the garbage recycling area is classified to obtain a classification result of the garbage recycling area;

[0139] Further, the garbage recycling area weight is calculated according to the garbage recycling area classification result;

[0140] Furthermore, a garbage transportation connectivity graph is constructed; the garbage transportation connectivity graph includes: 8 starting points, 3 target points and 18 connected edges;

[0141] Further, initializing the starting point, target point and connected edges of the garbage transportation connected graph;

[0142] Further, monitoring each garbage container in the garbage collection area to identify the garbage storage status; wherein the garbage storage status includes: garbage type, garbage filling density, garbage storage time and garbage decay degree;

[0143] Furthermore, an initial garbage transportation route plan is planned; wherein the planning process of the initial garbage transportation route plan includes:

[0144] Determining the tolerability of waste transportation based on the waste storage status;

[0145] Determine whether the garbage transportation tolerance exceeds the garbage transportation threshold; if it does not exceed, the garbage recycling area does not carry out transportation processing; if it exceeds, the garbage recycling area carries out transportation processing;

[0146] Calculate the garbage pre-transportation value of the garbage recycling area where the garbage can be transported; wherein the calculation formula of the garbage pre-transportation value is: PTV S_j It is the pre-transport value of garbage in the garbage collection area j where garbage can be transported; Q is the total number of garbage containers in the garbage collection area j; GDTV q It is represented as the waste transport tolerance of the qth waste container in waste collection area j;

[0147] updating the garbage collection area weight of the starting point according to the garbage pre-transportation value;

[0148] Sorting the updated garbage recycling area weights in descending order to obtain a sequence of garbage transportable starting points;

[0149] Acquire a transportation route from each starting point in the sequence of garbage transportable starting points to the target point from the garbage transportation connectivity graph;

[0150] Calculate the transportation cost of the transportation route; wherein the calculation formula of the transportation cost is:

[0151]

[0152] Among them, SC <S_j→T_k> Expressed as the transportation cost from starting point j to destination point k; LT q It is represented as the garbage loading time of the qth garbage container in the starting point j; TT <S_j→S_k> Expressed as the route transportation time between the starting point j and the target point k; UT T_k It represents the garbage unloading time of the target point k; c1 represents the unit cost coefficient of garbage loading; c2 represents the unit cost coefficient of garbage transportation; c3 represents the unit cost coefficient of garbage unloading; Δμ represents the transportation cost loss;

[0153] The costs of all transportation plans in the garbage transportable starting point sequence are calculated according to the transportation cost, and the transportation plan corresponding to the minimum transportation plan cost is selected as the initial garbage transportation route plan.

[0154] Further, the initial garbage transportation route plan is optimized to obtain an optimal garbage transportation route plan;

[0155] The optimization process of the optimal garbage transportation route plan includes:

[0156] Obtaining the garbage carrying capacity of the garbage truck; wherein the garbage carrying capacity includes: special garbage carrying capacity and non-special garbage carrying capacity;

[0157] Constructing a garbage collection area set; wherein the garbage collection area set includes: information about transportable garbage collection areas and information about non-transportable garbage collection areas;

[0158] Loading garbage at the starting point with the highest priority in the garbage transportation connectivity graph;

[0159] Calculating the remaining garbage load of the garbage truck after loading;

[0160] Determine the next operation according to the remaining garbage loading amount; wherein the next operation includes: driving to the garbage processing area and driving to the remaining garbage recycling area;

[0161] Traversing the remaining points in the garbage transportation connectivity graph to obtain an optimized transportation cost set;

[0162] The transportation plan corresponding to the minimum garbage transportation cost in the optimized transportation cost set is selected as the optimal garbage transportation route plan.

[0163] For the planning method in the embodiment of the present application, the embodiment of the present application also provides a design device for smart city planning, such as Figure 8 As shown; the device includes: a memory, a processor, a bus and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the adjustment method when executing the computer program.

[0164] Specifically, the above-mentioned memory and processor may be general-purpose memory and processor, which are not specifically limited here. When the processor runs the computer program stored in the memory, the above-mentioned adjustment method can be executed.

[0165] An embodiment of the present application also provides a design medium for smart city planning, which can be a computer program executed by an electronic device. When the program runs on the electronic device, the electronic device executes the steps of the above-mentioned prediction method.

[0166] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

Claims

1. A design method for smart city planning, characterized in that: include: Marking garbage collection areas in the 3D model of the smart city; Classifying the garbage recycling area to obtain a garbage recycling area classification result; Calculating the weight of the garbage recycling area according to the classification result of the garbage recycling area; constructing a garbage transportation connectivity graph; initializing the starting point, target point and connected edge of the garbage transportation connectivity graph; Monitor each garbage container in the garbage recycling area to identify the garbage storage status; wherein the garbage storage status includes: garbage type, garbage filling density, garbage storage time and garbage decay degree; plan an initial garbage transportation route plan; optimize the initial garbage transportation route plan to obtain an optimal garbage transportation route plan; wherein the optimization process of the optimal garbage transportation route plan includes: obtaining the garbage carrying capacity of the garbage truck; constructing a garbage recycling area set; loading garbage at the starting point with the highest priority in the garbage transportation connectivity graph; calculating the remaining garbage loading capacity of the garbage truck after loading; making a next operation judgment based on the remaining garbage loading capacity; wherein the next operation includes: driving to the garbage treatment area and driving to the remaining garbage recycling area; traversing the remaining points in the garbage transportation connectivity graph to obtain an optimized transportation cost set; selecting the transportation plan corresponding to the minimum garbage transportation cost in the optimized transportation cost set as the optimal garbage transportation route plan.

2. A design method for smart city planning according to claim 1, characterized in that: The calculation process of the garbage recycling area weight is as follows: collect relevant historical data of each garbage recycling area; wherein the relevant historical data is collected in a seasonal time series, including: historical garbage production, historical population density and historical activity information; pre-process the relevant historical data to obtain standardized relevant historical data; calculate the initial garbage recycling area weight according to the standardized relevant historical data; wherein the calculation formula of the initial garbage recycling area weight is: IW i =α1*X i +α2*Y i +α3*Z i Among them, IW i It is represented as the initial garbage collection area weight of the i-th season; X i Represented as the standardized historical garbage production data of the i-th season; Y i Represented as the standardized historical population density data of the i-th season; Z i It is represented by the standardized historical activity data of the i-th season; α1 is represented by the weight parameter of historical garbage production; α2 is represented by the weight parameter of historical population density; α3 is represented by the weight parameter of historical activities; The initial garbage collection area weight is adjusted according to the garbage collection area classification result to obtain the garbage collection area weight; wherein the calculation formula of the garbage collection area weight is: SW i new =γ*IW i +λ*σ i ; Among them, SW i new It is represented as the garbage collection area weight of the garbage collection area in the i-th season; σ i It is expressed as the adjustment increment of the ith season; γ is expressed as the attenuation factor; λ is expressed as the increment coefficient.

3. A design method for smart city planning according to claim 1, characterized in that: The identification process of the garbage storage state includes: obtaining the time from the placement of the garbage in the garbage container to the current monitoring time as the garbage storage time; Calculate the garbage filling density of the garbage container; wherein the calculation formula of the garbage filling density is: Wherein, AAG represents the actual amount of garbage in the garbage container; TBC represents the total capacity of the garbage container; Acquire a garbage image in the garbage container and a first smell inside the garbage container; The garbage image and the first odor are input into a garbage recognition model to obtain the garbage type and the garbage decay degree respectively; wherein the garbage recognition model comprises: an input layer comprises: an image input module and an odor input module, respectively used to receive the garbage image and the first odor, and perform data processing to obtain a standard garbage image and a standard odor; an identification layer comprises: a garbage type identification module, an image decay degree identification module and an odor decay degree identification module, to obtain garbage classification probability, image decay degree value and odor decay degree value; an output layer comprises: a garbage type output module and a comprehensive decay degree output module, to obtain the garbage type and the garbage decay degree.

4. A design method for smart city planning according to claim 1, characterized in that: The planning process of the initial garbage transportation route plan includes: obtaining the garbage transportation tolerance according to the garbage storage state; judging whether the garbage transportation tolerance exceeds the garbage transportation threshold; when it does not exceed, the garbage recycling area does not carry out transportation processing; when it exceeds, the garbage recycling area carries out transportation processing; calculating the garbage pre-transport value of the garbage recycling area where the garbage can be transported; wherein the calculation formula of the garbage pre-transport value is: PTV S_j It is the pre-transport value of garbage in garbage collection area j where garbage can be transported; Q is the total number of garbage containers in garbage collection area j; GDTV q It is represented as the waste transport tolerance of the qth waste container in waste collection area j; updating the garbage collection area weight of the starting point according to the garbage pre-transportation value; Sorting the updated garbage recycling area weights in descending order to obtain a sequence of garbage transportable starting points; Acquire a transportation route from each starting point in the sequence of garbage transportable starting points to the target point from the garbage transportation connectivity graph; Calculate the transportation cost of the transportation route; wherein the calculation formula of the transportation cost is: Among them, SC <S_j→T_k> Expressed as the transportation cost from starting point j to destination point k; LT q It is represented as the garbage loading time of the qth garbage container in the starting point j; TT <S_j→S_k> Expressed as the route transportation time between the starting point j and the target point k; UT T_k It represents the garbage unloading time of the target point k; c1 represents the unit cost coefficient of garbage loading; c2 represents the unit cost coefficient of garbage transportation; c3 represents the unit cost coefficient of garbage unloading; Δμ represents the transportation cost loss; The costs of all transportation plans in the garbage transportable starting point sequence are calculated according to the transportation cost, and the transportation plan corresponding to the minimum transportation plan cost is selected as the initial garbage transportation route plan.

5. A design system for smart city planning, characterized in that: The system includes: a monitoring unit, a data acquisition unit, a three-dimensional modeling unit, a garbage status prompting unit, a route generating unit, an optimal route planning unit and a display unit; wherein the monitoring unit is used to monitor the garbage collection area, the garbage truck transportation and the garbage treatment area; the data acquisition unit is used to collect information about the garbage transportation in the city; the three-dimensional modeling unit is used to establish a three-dimensional model of a smart city, which mainly includes: a garbage collection area, a garbage transportation route and a garbage treatment area; the garbage status prompting unit is used to prompt relevant staff to transport the garbage in the garbage collection area; the route generating unit is used to generate an initial garbage transportation route; the optimal route planning unit is used to optimize the garbage transportation route plan; the display unit is used to display the garbage status of the garbage collection area and the garbage transportation route.

6. A smart city planning design system according to claim 5, characterized in that: The garbage status prompt unit comprises: respectively obtaining the garbage placement time, garbage filling density, image information and odor information of each garbage container in the garbage collection area; wherein the garbage placement time is recorded as the garbage storage time; The calculation formula of the garbage filling density is: Wherein, AAG represents the actual amount of garbage in the garbage container; TBC represents the total capacity of the garbage container; The image information and the odor information are input into a garbage recognition model to obtain the garbage type and the degree of garbage decay respectively; wherein the garbage recognition model comprises: an input layer comprises: an image input module and an odor input module, which are respectively used to receive the image information and the odor information, and perform data processing to obtain a standard garbage image and a standard odor; an identification layer comprises: a garbage type identification module, an image decay degree identification module and an odor decay degree identification module, to obtain garbage classification probability, image decay degree value and odor decay degree value; an output layer comprises: a garbage type output module and a comprehensive decay degree output module, to obtain garbage type and garbage decay degree.

7. A smart city planning design system according to claim 5, characterized in that: The route generation unit includes: obtaining the tolerability of garbage transportation according to the garbage storage state; judging whether the garbage transportation tolerability exceeds the garbage transportation threshold; when it does not exceed, the garbage recycling area does not carry out transportation processing; when it exceeds, the garbage recycling area carries out transportation processing; calculating the garbage pre-transportation value of the garbage recycling area where the garbage can be transported; wherein the calculation formula of the garbage pre-transportation value is: PTV S_j It is the pre-transport value of garbage in garbage collection area j where garbage can be transported; Q is the total number of garbage containers in garbage collection area j; GDTV q It is represented as the waste transport tolerance of the qth waste container in waste collection area j; Updating the garbage collection area weight according to the garbage pre-transportation value; Sorting the updated garbage recycling area weights in descending order to obtain a sequence of garbage transportable starting points; Obtaining a transportation route from each starting point to a target point in the sequence of transportable garbage starting points from a garbage transportation connectivity graph; Calculate the transportation cost of the transportation route; wherein the calculation formula of the transportation cost is: Among them, SC <S_j→T_k> Expressed as the transportation cost from starting point j to destination point k; LT q It is represented as the garbage loading time of the qth garbage container in the starting point j; TT <S_j→S_k> Expressed as the route transportation time between the starting point j and the target point k; UT T_k It represents the garbage unloading time of the target point k; c1 represents the unit cost coefficient of garbage loading; c2 represents the unit cost coefficient of garbage transportation; c3 represents the unit cost coefficient of garbage unloading; Δμ represents the transportation cost loss; The costs of all transportation plans in the garbage transportable starting point sequence are calculated according to the transportation cost, and the transportation plan corresponding to the minimum transportation plan cost is selected as the initial garbage transportation route plan.

8. A smart city planning design system according to claim 5, characterized in that: The optimal route planning unit includes: obtaining the garbage carrying capacity of the garbage truck; wherein the garbage carrying capacity includes: special garbage carrying capacity and non-special garbage carrying capacity; constructing a garbage recycling area set; wherein the garbage recycling area set includes: transportable garbage recycling area information and non-transportable garbage recycling area information; loading garbage at the starting point with the highest priority in the garbage transportation connectivity graph; calculating the remaining garbage loading amount of the garbage truck after loading; making a next operation judgment based on the remaining garbage loading amount; wherein the next operation includes: driving to the garbage treatment area and driving to the remaining garbage recycling area; traversing the remaining points in the garbage transportation connectivity graph to obtain an optimized transportation cost set; selecting the transportation plan corresponding to the minimum garbage transportation cost in the optimized transportation cost set as the optimal garbage transportation route plan.

9. A design device for smart city planning, characterized in that: The device comprises at least a processor and a memory, and the processor is configured to implement the steps of the method according to any one of claims 1 to 4 when executing a computer program stored in the memory.

10. A design medium for smart city planning, characterized in that: The medium is a computer program that can be executed by an electronic device. When the program is run on the electronic device, the electronic device executes the steps of the method according to any one of claims 1 to 4.

Citation Information

Cited By

  • Multi-functional module linkage collaborative management control method and system for smart park

    CN120450557A

  • Renewable resource recovery system and method based on big data

    CN121365967A

  • A big data-based renewable resource recycling system and method

    CN121365967B