Garbage transfer station site selection method, device, equipment and media

Abstract

The present invention discloses a method, device, equipment and medium for selecting a site for a garbage transfer station, and relates to the technical field of site selection, including: obtaining a site selection area and a service area; obtaining a time period area based on a surveillance camera; analyzing the site selection area to obtain a route screening length; screening the route screening length and obtaining an optimal recycling route and an optimal site selection area; and selecting a site for a garbage transfer station based on the optimal site selection area. The present invention is used to solve the problem that in the existing site selection method for a garbage transfer station, the travel of residents in the area involved in the garbage transfer station is not analyzed, resulting in that after the site selection of the garbage transfer station, garbage trucks will cause congestion on the roads where residents travel or affect the environment when residents travel during garbage collection, thereby affecting the normal life of residents.

Description

Technical Field

[0001] The present invention relates to the field of site selection technology, in particular to a method, device, equipment and medium for site selection of a garbage transfer station. Background Art

[0002] Garbage transfer stations are important facilities in urban sanitation systems, primarily used to collect, temporarily store, compress, and transfer domestic waste to reduce its spread and environmental pollution in cities. Typically located underground or above ground in or around cities, garbage transfer stations use compression and volume reduction technology to reduce the volume of garbage for easier transportation and processing. Site selection requirements for garbage transfer stations include compliance with the overall plan and special environmental sanitation plans, comprehensive consideration of multiple factors, convenient transportation, and meeting infrastructure requirements.

[0003] Existing improvements in the site selection of garbage transfer stations usually analyze the factors affecting the site selection of garbage transfer stations, build a site selection model for analyzing garbage transfer stations, optimize existing plans and plan garbage transportation routes with the goal of minimizing the cost of urban domestic garbage collection and transportation network. Although this improvement method can reduce garbage collection costs and avoid the problem of garbage trucks queuing for dumping during peak hours, it does not analyze the travel of residents in the area involved in the garbage transfer station. As a result, after the site selection of the garbage transfer station, garbage trucks will cause congestion on the roads when residents travel during garbage collection or affect the environment when residents travel, thereby affecting the normal life of residents. For example, in the patent application with publication number CN116307134A, a method for selecting the site of an urban underground garbage transfer station is disclosed. System, equipment and storage medium. This solution is to analyze the factors affecting the site selection of urban underground garbage transfer stations, construct an urban underground garbage transfer station site selection model, and plan garbage transportation routes and optimize the garbage transfer station site selection plan with the goal of minimizing the total cost of the urban domestic garbage underground collection and transportation network. Other improvements in the site selection of garbage transfer stations usually analyze the garbage production and odor level in the area and the flow of people. However, in terms of residents' travel, the analysis has not been combined with the residents' travel in the area involved in the garbage transfer station. As a result, after the garbage transfer station is sited, garbage trucks will cause congestion on the roads when residents travel or affect the environment when residents travel, thereby affecting the normal life of residents. In view of this, it is necessary to improve the existing garbage transfer station site selection method. Summary of the Invention

[0004] The present invention aims to solve at least one of the technical problems in the prior art to a certain extent. By proposing a method, device, equipment and medium for selecting a garbage transfer station site, the present invention is used to solve the problem that the existing method for selecting a garbage transfer station site does not analyze the travel of residents in the area involved in the garbage transfer station, resulting in that after the garbage transfer station site is selected, garbage trucks will cause congestion on the roads where residents travel or affect the environment when residents travel, thereby affecting the normal life of residents.

[0005] To achieve the above objectives, in a first aspect, the present application provides a method for selecting a site for a garbage transfer station, comprising the following steps:

[0006] Obtain the areas where garbage transfer stations are allowed to be located and the areas served by the garbage transfer stations on the map, and record them as the location area and service area respectively; collect resident flow data on all roads in the service area using surveillance cameras, and divide the service area into multiple time zones based on the collection results;

[0007] Analyze each location area based on multiple time periods, and obtain the route screening length corresponding to each location area based on the analysis results;

[0008] All route screening lengths are screened, and the optimal recycling route is obtained based on the screening results. The site selection area corresponding to the optimal recycling route is recorded as the optimal site selection area; the site selection of the garbage transfer station is carried out based on the optimal site selection area.

[0009] Furthermore, the resident flow data of all roads in the service area is collected based on surveillance cameras, and the service area is divided into multiple time zones based on the collection results, including:

[0010] Establish a plane rectangular coordinate system and record it as the map analysis coordinate system, where the units of the X-axis and Y-axis of the map analysis coordinate system are both km; based on the location and proportional relationship of the site selection area and the service area, draw the site selection area and the service area in the map analysis coordinate system at equal scale;

[0011] In the map analysis coordinate system: all crossroads and T-junctions in the site selection area are recorded as resident flow nodes; for any resident flow node A: the resident flow node B closest to the resident flow node A is recorded as the neighboring node of the resident flow node A, the straight-line distance between the resident flow node A and the neighboring node is recorded as L, and L / 2 is recorded as the neighboring radius; circles are drawn with the resident flow node A and the neighboring node as the center and the neighboring radius as the radius, and are recorded as the neighboring analysis circles of the resident flow node A and the neighboring node respectively;

[0012] Obtain the neighboring nodes and neighboring analysis circles corresponding to all resident mobility nodes that do not contain neighboring analysis circles.

[0013] Furthermore, the resident flow data of all roads in the service area is collected based on surveillance cameras, and the service area is divided into multiple time zones based on the collected results, which also includes:

[0014] For any proximity analysis circle corresponding to a resident mobility node A, all roads within the proximity analysis circle are recorded as data collection roads for resident mobility node A. Cameras are placed on the actual roads corresponding to each data collection road, and the number of residents in the video captured by the camera is identified based on AI recognition. The data obtained by all cameras based on AI recognition is recorded as resident mobility data.

[0015] Obtain K days of resident mobility data. For any day's corresponding resident mobility data: establish a plane rectangular coordinate system and record it as the mobility analysis coordinate system, where the unit of the X-axis of the mobility analysis coordinate system is h and the Y-axis is the number axis; based on the total number of residents identified by all cameras from 0:00 to 24:00 in the resident mobility data, draw a corresponding curve between X=0h and X=24h in the mobility analysis coordinate system and record it as the personnel mobility curve;

[0016] Obtain K personnel flow curves corresponding to the resident flow data collected on K days, and fit the K personnel flow curves. The obtained curve is recorded as the time period curve of the resident flow node, and the point with the smallest vertical coordinate in the time period curve is recorded as the regional screening point.

[0017] Furthermore, the resident flow data of all roads in the service area is collected based on surveillance cameras, and the service area is divided into multiple time zones based on the collected results, which also includes:

[0018] Obtain the time period curves corresponding to all resident flow nodes and place all time period curves in the flow analysis coordinate system α; for any time period curve γ in the flow analysis coordinate system α, use the time period algorithm to obtain the time period correlation parameters corresponding to the time period curve γ and other time period curves respectively. The time period algorithm is: F = (1 + f1) × |X1-X2|, where F is the time period correlation parameter, f1 is the length of the region in the time period curve γ with the same abscissa and slope as the other time period curve on the X-axis, X1 is the ordinate of the regional screening point of the time period curve γ, and X2 is the ordinate of the regional screening point of the other time period curve;

[0019] Among all the period correlation parameters corresponding to the period curve γ, the period curve corresponding to the smallest period correlation parameter is recorded as the near correlation curve of the period curve γ;

[0020] Get the nearly related curves corresponding to all time period curves;

[0021] Based on the horizontal coordinates of all regional screening points from small to large, the neighboring analysis circles of the resident flow nodes corresponding to all regional screening points are recorded as time period area SQ1 to time period area SQ c , where c is the number of resident mobility nodes, and the adjacent area of ​​the time period area SQ is set to the time period area SQ corresponding to the near-association curve corresponding to the time period curve of the time period area SQ.

[0022] Furthermore, each location selection area is analyzed based on multiple time period areas, and the route screening length corresponding to each location selection area is obtained based on the analysis results, including:

[0023] For any site selection area: in the map analysis coordinate system, take the site selection area as the starting point, and pass through the time zone SQ1 to the time zone SQ c And the shortest route back to the site selection area is recorded as the time-series recovery route;

[0024] After the garbage truck starts from the site selection area and executes method V to reach all time period areas SQ, the shortest route back to the site selection area is recorded as the nearest recycling route. Among them, method V is: the time period area SQ closest to the garbage truck and where garbage collection is not performed is used as the destination of the garbage truck, and when the garbage truck arrives at the destination, the time period area SQ where the garbage truck is located is recorded as the time period area SQ where garbage collection has been performed. When the garbage truck arrives at any time period area SQ, method V is repeated.

[0025] Furthermore, analyzing each location selection area based on multiple time period areas, and obtaining the route screening length corresponding to each location selection area based on the analysis results also includes:

[0026] Obtain the shortest route for the garbage truck to start from the selected area, execute method T to reach all time period areas SQ, and then return to the selected area, which is recorded as the adjacent recycling route;

[0027] Method T is as follows: the time zone SQ closest to the garbage truck and where no garbage collection is being carried out is used as the destination of the garbage truck. When the garbage truck arrives at the destination, the destination of the garbage truck is adjusted to the adjacent area corresponding to the time zone SQ. When the garbage truck arrives at any adjacent area, method T is repeatedly executed. When the garbage truck arrives at any time zone SQ, the time zone SQ where the garbage truck is located is recorded as the time zone SQ where garbage collection has been carried out.

[0028] The total length of the sequential recycling route, the nearest recycling route and the adjacent recycling route corresponding to the site selection area is recorded as the route screening length of the site selection area;

[0029] Get the route screening lengths corresponding to all site selection areas.

[0030] Furthermore, all route screening lengths are screened, and based on the screening results, the optimal recycling route is obtained, and the site selection area corresponding to the optimal recycling route is recorded as the optimal site selection area; the site selection of the garbage transfer station based on the optimal site selection area includes:

[0031] The time-series recycling route, the nearest recycling route, and the adjacent recycling route corresponding to the minimum value among all route screening lengths are recorded as the optimal recycling route, and the location area corresponding to the optimal recycling route is recorded as the optimal location area;

[0032] The location of the garbage transfer station is selected based on the location of the most preferred site area.

[0033] Secondly, this application also provides a garbage transfer station site selection system, including a resident flow analysis module, a site selection area analysis module, and a screening and addressing module;

[0034] The resident flow analysis module is used to obtain the areas where garbage transfer stations are allowed to be located and the areas served by garbage transfer stations on the map, and record them as the location area and service area respectively; based on the surveillance cameras, the resident flow data of all roads in the service area is collected, and based on the collection results, the service area is divided into multiple time zones;

[0035] The site selection area analysis module is used to analyze each site selection area based on multiple time period areas, and obtain the route screening length corresponding to each site selection area based on the analysis results;

[0036] The screening and addressing module is used to screen the screening lengths of all routes, and obtain the optimal recycling route based on the screening results, and record the site selection area corresponding to the optimal recycling route as the optimal site selection area; the garbage transfer station is selected based on the optimal site selection area.

[0037] In a third aspect, the present application provides an electronic device comprising a processor and a memory, wherein the memory stores computer-readable instructions. When the computer-readable instructions are executed by the processor, the steps in the above method are performed.

[0038] In a fourth aspect, the present application provides a storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps in the above method are executed.

[0039] Beneficial effects of the present invention: The present application first obtains the areas where garbage transfer stations are allowed to be sited and the areas served by the garbage transfer stations in the map, and records them as site selection areas and service areas respectively; collects resident flow data on all roads in the service area based on surveillance cameras, and divides the service area into multiple time period areas based on the collection results. The advantage of this is that by collecting data on the service area and obtaining multiple time period areas, it is possible to obtain travel-related data of residents in different areas in the service area based on the resident flow data in the service area, so that the obtained time period areas can provide effective data support when subsequently obtaining the route screening length, so that the site selection of the garbage transfer station can be fully combined with the travel habits of residents, thereby reducing the congestion caused by garbage trucks on the roads when residents travel during garbage collection and the impact on the environment when residents travel, and avoiding garbage trucks affecting the normal lives of residents during garbage collection;

[0040] The present application also analyzes each site selection area based on multiple time period areas, and obtains the route screening length corresponding to each site selection area based on the analysis results; finally, all route screening lengths are screened, and the optimal recycling route is obtained based on the screening results, and the site selection area corresponding to the optimal recycling route is recorded as the optimal site selection area; the garbage transfer station is sited based on the optimal site selection area. The advantage of this is that by obtaining the route screening length and obtaining the optimal site selection area, all garbage collection routes that meet the requirements of efficient garbage collection and reducing the impact on the lives of residents in the service area can be screened, thereby ensuring that the optimal site selection address corresponding to the optimal recycling route can meet the requirements of efficient garbage collection based on the transfer station, while minimizing the congestion caused by garbage trucks on the roads when residents travel during garbage collection and the impact on the environment when residents travel. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] Figure 1 It is a principle block diagram of the system of the present invention;

[0042] Figure 2 is a flow chart of the steps of the method of the present invention;

[0043] Figure 3 A schematic diagram of obtaining a proximity analysis circle according to the present invention;

[0044] Figure 4 A schematic diagram of obtaining the calculation of the time period associated parameters of the present invention;

[0045] Figure 5 Schematic diagram of the structure of the electronic device of the present invention. DETAILED DESCRIPTION

[0046] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. 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 making creative efforts are within the scope of protection of the present invention.

[0047] Example 1, please refer to Figure 1 As shown, this application provides a garbage transfer station site selection system, including a resident flow analysis module, a site selection area analysis module, and a screening and addressing module;

[0048] The resident flow analysis module is used to obtain the areas where garbage transfer stations are allowed to be located and the areas served by garbage transfer stations on the map, and record them as the location area and service area respectively; based on the surveillance cameras, the resident flow data of all roads in the service area is collected, and based on the collection results, the service area is divided into multiple time zones;

[0049] The resident flow analysis module includes a resident flow analysis unit, which is configured with a resident flow analysis strategy. The resident flow analysis strategy includes:

[0050] Establish a plane rectangular coordinate system and record it as the map analysis coordinate system, where the units of the X-axis and Y-axis of the map analysis coordinate system are both km; based on the location and proportional relationship of the site selection area and the service area, draw the site selection area and the service area in the map analysis coordinate system at equal scale;

[0051] In the map analysis coordinate system: all crossroads and T-junctions in the site selection area are recorded as resident flow nodes; for any resident flow node A: the resident flow node B closest to the resident flow node A is recorded as the neighboring node of the resident flow node A, the straight-line distance between the resident flow node A and the neighboring node is recorded as L, and L / 2 is recorded as the neighboring radius; circles are drawn with the resident flow node A and the neighboring node as the center and the neighboring radius as the radius, and are recorded as the neighboring analysis circles of the resident flow node A and the neighboring node respectively;

[0052] Obtain the neighboring nodes and neighboring analysis circles corresponding to all resident mobility nodes that do not contain neighboring analysis circles;

[0053] In the specific implementation process, for example, during a data processing, the map analysis coordinate system obtained is as follows Figure 3 As shown, areas CC1 and CC2 are site selection areas, area AA1 is the service area, points JL1 to JL4 are all resident mobility nodes. Through analysis, it can be obtained that the neighboring point of point JL1 is point JL3, and the neighboring point of point JL2 is point JL4; the neighboring analysis circle of point JL1 to point JL4 is LY1 to LY4;

[0054] For any proximity analysis circle corresponding to a resident mobility node A, all roads within the proximity analysis circle are recorded as data collection roads for resident mobility node A. Cameras are placed on the actual roads corresponding to each data collection road, and the number of residents in the video captured by the camera is identified based on AI recognition. The data obtained by all cameras based on AI recognition is recorded as resident mobility data.

[0055] Obtain K days of resident mobility data. For any day's corresponding resident mobility data: establish a plane rectangular coordinate system and record it as the mobility analysis coordinate system, where the unit of the X-axis of the mobility analysis coordinate system is h and the Y-axis is the number axis; based on the total number of residents identified by all cameras from 0:00 to 24:00 in the resident mobility data, draw a corresponding curve between X=0h and X=24h in the mobility analysis coordinate system and record it as the personnel mobility curve;

[0056] In the specific implementation process, the value of K can be set according to the storage capacity of the actual camera for the collected data. For example, if the camera placed on the actual road has a large storage space, the value of K can be increased to increase the amount of resident flow data collected, so that the subsequent time period curve is more consistent with the actual travel situation of residents. In this embodiment, the value of K is set to 3;

[0057] Obtain K personnel flow curves corresponding to the resident flow data collected on K days, and fit the K personnel flow curves. The obtained curve is recorded as the time period curve of the resident flow node, and the point with the smallest ordinate in the time period curve is recorded as the regional screening point;

[0058] Obtain the time period curves corresponding to all resident flow nodes and place all time period curves in the flow analysis coordinate system α; for any time period curve γ in the flow analysis coordinate system α, use the time period algorithm to obtain the time period correlation parameters corresponding to the time period curve γ and other time period curves respectively. The time period algorithm is: F = (1 + f1) × |X1-X2|, where F is the time period correlation parameter, f1 is the length of the region in the time period curve γ with the same abscissa and slope as the other time period curve on the X-axis, X1 is the ordinate of the regional screening point of the time period curve γ, and X2 is the ordinate of the regional screening point of the other time period curve;

[0059] In the specific implementation process, for example, during a data analysis, the flow analysis coordinate system α is obtained as Figure 4As shown, for the two time period curves γ1 and γ2 in the flow analysis coordinate system α, it is found through data analysis that the slopes of all points with the same horizontal coordinates in γ1 and γ2 are the same only between X=XX1 and X=XX2. Therefore, f1 can be recorded as (XX1-XX2), and the time period correlation parameter corresponding to γ1 and γ2 is (1+XX1-XX2)×|X1-X2|, that is, 40;

[0060] Among all the period correlation parameters corresponding to the period curve γ, the period curve corresponding to the smallest period correlation parameter is recorded as the near correlation curve of the period curve γ;

[0061] Get the nearly related curves corresponding to all time period curves;

[0062] In the specific implementation process, the close correlation curves corresponding to the time period curves are most similar in terms of the minimum value of the number of resident flows and the change in the slope of the curves. This shows that the travel status of residents in the areas where the two resident flow nodes corresponding to the same set of time period curves and close correlation curves are located is most similar. Therefore, the garbage truck can collect garbage in the area where the resident flow node corresponding to the close correlation curve is located after collecting garbage in the area corresponding to one resident flow node, so as to reduce the impact on the travel of residents in the areas where other resident flow nodes are located.

[0063] Based on the horizontal coordinates of all regional screening points from small to large, the neighboring analysis circles of the resident flow nodes corresponding to all regional screening points are recorded as time period area SQ1 to time period area SQ c , where c is the number of resident mobility nodes, and the adjacent area of ​​the time period area SQ is set to the time period area SQ corresponding to the near-association curve corresponding to the time period curve of the time period area SQ.

[0064] The location area analysis module is used to analyze each location area based on multiple time periods and obtain the route screening length corresponding to each location area based on the analysis results; the location area analysis module includes a location area analysis unit, and the location area analysis unit is configured with a location area analysis strategy, which includes:

[0065] For any site selection area: in the map analysis coordinate system, take the site selection area as the starting point, and pass through the time zone SQ1 to the time zone SQ c And the shortest route back to the site selection area is recorded as the time-series recovery route;

[0066] In the specific implementation process, it is assumed that the collection capacity of garbage trucks is the same when analyzing each selected area. In actual application, it can be considered that garbage trucks cannot collect garbage from all time period areas SQ at one time. However, garbage trucks should still collect garbage from all time period areas SQ in sequence if they collect garbage multiple times. This does not affect the order of garbage collection and therefore does not affect the analysis of this plan.

[0067] After the garbage truck starts from the selected area and executes method V to reach all time zone areas SQ, the shortest route back to the selected area is recorded as the nearest recycling route. Among them, method V is: the time zone SQ closest to the garbage truck and where garbage collection is not being carried out is the destination of the garbage truck, and when the garbage truck arrives at the destination, the time zone SQ where the garbage truck is located is recorded as the time zone SQ where garbage collection has been carried out. When the garbage truck arrives at any time zone SQ, method V is repeated;

[0068] Obtain the shortest route for the garbage truck to start from the selected area, execute method T to reach all time period areas SQ, and then return to the selected area, which is recorded as the adjacent recycling route;

[0069] Method T is as follows: the time zone SQ closest to the garbage truck and where no garbage collection is being carried out is used as the destination of the garbage truck. When the garbage truck arrives at the destination, the destination of the garbage truck is adjusted to the adjacent area corresponding to the time zone SQ. When the garbage truck arrives at any adjacent area, method T is repeatedly executed. When the garbage truck arrives at any time zone SQ, the time zone SQ where the garbage truck is located is recorded as the time zone SQ where garbage collection has been carried out.

[0070] The total length of the sequential recycling route, the nearest recycling route and the adjacent recycling route corresponding to the site selection area is recorded as the route screening length of the site selection area;

[0071] During a specific implementation, for example, in a data analysis, the lengths of the sequential recycling route, the nearest recycling route, and the adjacent recycling route are 14 km, 10 km, and 15 km, respectively. The route screening length can be recorded as 39 km. In this embodiment, the sequential recycling route and the nearest recycling route correspond to the lengths of the garbage truck's working route when only considering the efficiency of garbage collection, and the adjacent recycling route corresponds to the length of the garbage truck's working route when considering reducing the impact on residents' travel. Therefore, by obtaining the route screening length and then obtaining the shortest route screening length in subsequent screening, it can be ensured that the optimal location area is a location area that satisfies the requirements of efficient garbage collection based on the transfer station while minimizing the congestion caused by garbage trucks on residents' roads during garbage collection and the impact on the environment during residents' travel.

[0072] Get the route screening lengths corresponding to all site selection areas.

[0073] The screening and addressing module is used to screen all route screening lengths, and obtain the optimal recycling route based on the screening results, and record the site selection area corresponding to the optimal recycling route as the optimal site selection area; based on the optimal site selection area, the site selection of the garbage transfer station is carried out;

[0074] The screening addressing module includes a garbage transfer station addressing unit. The garbage transfer station addressing unit is configured with a garbage transfer station addressing strategy. The garbage transfer station addressing strategy includes:

[0075] The time-series recycling route, the nearest recycling route, and the adjacent recycling route corresponding to the minimum value among all route screening lengths are recorded as the optimal recycling route, and the location area corresponding to the optimal recycling route is recorded as the optimal location area;

[0076] The location of the garbage transfer station is selected based on the location of the most preferred site area.

[0077] Example 2, please refer to Figure 2 As shown, this application also provides a method for selecting a site for a garbage transfer station, comprising the following steps:

[0078] Step S1: Obtaining the areas where the waste transfer station is allowed to be located and the areas served by the waste transfer station from a map, and recording them as the location area and the service area respectively; collecting resident flow data on all roads in the service area using surveillance cameras, and dividing the service area into multiple time zones based on the collected data;

[0079] Step S1 includes: Step S101, establishing a plane rectangular coordinate system and recording it as a map analysis coordinate system, wherein the units of the X axis and the Y axis of the map analysis coordinate system are both km; based on the locations and proportional relationship of the site selection area and the service area, drawing the site selection area and the service area in equal proportion in the map analysis coordinate system;

[0080] Step S102: In the map analysis coordinate system, all crossroads and T-junctions in the selected site area are recorded as resident mobility nodes; for any resident mobility node A, the resident mobility node B closest to the resident mobility node A is recorded as the neighboring node of the resident mobility node A, the straight-line distance between the resident mobility node A and the neighboring node is recorded as L, and L / 2 is recorded as the neighboring radius; circles are drawn with the resident mobility node A and the neighboring node as the center and the neighboring radius as the radius, and are recorded as the neighboring analysis circles of the resident mobility node A and the neighboring node respectively;

[0081] Step S103, obtaining neighboring nodes and neighboring analysis circles corresponding to all resident mobility nodes that do not contain neighboring analysis circles;

[0082] Step S104: For any proximity analysis circle corresponding to a resident mobility node A, all roads within the proximity analysis circle are recorded as data collection roads for resident mobility node A; cameras are placed on the actual roads corresponding to each data collection road, and the number of residents in the video captured by the cameras is identified based on AI recognition; the data obtained by all cameras based on AI recognition is recorded as resident mobility data;

[0083] Step S105: Obtain K days of resident flow data. For any day of resident flow data, establish a plane rectangular coordinate system and record it as the flow analysis coordinate system, where the unit of the X-axis of the flow analysis coordinate system is h and the Y-axis is the number axis. Based on the total number of residents identified by all cameras from 0:00 to 24:00 in the resident flow data, draw a corresponding curve between X=0h and X=24h in the flow analysis coordinate system and record it as the personnel flow curve.

[0084] Step S106: Obtain K personnel flow curves corresponding to the resident flow data collected over K days, and fit the K personnel flow curves. The obtained curves are recorded as the time period curves of the resident flow nodes, and the point with the smallest ordinate in the time period curve is recorded as the regional screening point.

[0085] Step S107: Obtain the time period curves corresponding to all resident flow nodes and place all time period curves into the flow analysis coordinate system α; for any time period curve γ in the flow analysis coordinate system α, use the time period algorithm to obtain the time period association parameters corresponding to the time period curve γ and other time period curves respectively. The time period algorithm is: F = (1 + f1) × |X1-X2|, where F is the time period association parameter, f1 is the length of the region in the time period curve γ that has the same abscissa and slope as the other time period curve on the X-axis, X1 is the ordinate of the regional screening point of the time period curve γ, and X2 is the ordinate of the regional screening point of the other time period curve;

[0086] Step S108 , among all the time period correlation parameters corresponding to the time period curve γ, the time period curve corresponding to the minimum time period correlation parameter is recorded as the nearly correlated curve of the time period curve γ;

[0087] Step S109, obtaining the nearly associated curves corresponding to all time period curves;

[0088] Step S110: Based on the horizontal coordinates of all regional screening points from small to large, the neighboring analysis circles of the resident flow nodes corresponding to all regional screening points are recorded as time period area SQ1 to time period area SQ c , where c is the number of resident mobility nodes, and the adjacent area of ​​the time period area SQ is set to the time period area SQ corresponding to the near-association curve corresponding to the time period curve of the time period area SQ.

[0089] Step S2, analyzing each site selection area based on multiple time period areas, and obtaining a route screening length corresponding to each site selection area based on the analysis results;

[0090] Step S2 includes: Step S201, for any selected site area: obtain the map analysis coordinate system with the selected site area as the starting point, passing through the time zone SQ1 to the time zone SQ cAnd the shortest route back to the site selection area is recorded as the time-series recovery route;

[0091] Step S202: After the garbage truck departs from the selected area and executes method V to reach all time zone areas SQ, the shortest route back to the selected area is recorded as the nearest collection route. Method V is as follows: the time zone area SQ closest to the garbage truck and not currently being collected is the garbage truck's destination. When the garbage truck arrives at the destination, the time zone SQ where the garbage truck is located is recorded as the time zone SQ where garbage collection has already been performed. When the garbage truck arrives at any time zone SQ, method V is repeated.

[0092] Step S203: Obtain the shortest route for the garbage truck to start from the selected area, execute method T to reach all time zone areas SQ, and then return to the selected area, which is recorded as the adjacent recycling route;

[0093] Method T is as follows: the time zone SQ closest to the garbage truck and where no garbage collection is being carried out is used as the destination of the garbage truck. When the garbage truck arrives at the destination, the destination of the garbage truck is adjusted to the adjacent area corresponding to the time zone SQ. When the garbage truck arrives at any adjacent area, method T is repeatedly executed. When the garbage truck arrives at any time zone SQ, the time zone SQ where the garbage truck is located is recorded as the time zone SQ where garbage collection has been carried out.

[0094] Step S204 , recording the total length of the sequential recycling route, the nearest recycling route, and the adjacent recycling route corresponding to the site selection area as the route screening length of the site selection area;

[0095] Step S205: Obtain route screening lengths corresponding to all site selection areas.

[0096] Step S3: Screen all route screening lengths, and obtain the optimal recycling route based on the screening results, and record the site selection area corresponding to the optimal recycling route as the optimal site selection area; select the site of the garbage transfer station based on the optimal site selection area;

[0097] Step S3 includes: step S301, recording the time-series recycling route, the nearest recycling route, and the adjacent recycling route corresponding to the minimum value among all route screening lengths as the optimal recycling route, and recording the location area corresponding to the optimal recycling route as the optimal location area;

[0098] Step S302: Select a location for the garbage transfer station based on the location of the most preferred location area.

[0099] Example 3, please refer to Figure 5 As shown, Figure 5A schematic diagram of the structure of an electronic device is provided. The electronic device may include: a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory communicate with each other via the communication bus. The memory stores computer-readable instructions, and the processor can call the instructions in the memory. When the computer-readable instructions are executed by the processor, the steps of a method for selecting a location for a garbage transfer station are executed to implement the following functions: first, areas where a garbage transfer station is allowed to be located and areas served by the garbage transfer station are obtained from a map, and are recorded as location areas and service areas, respectively; resident flow data on all roads in the service area is collected using surveillance cameras, and the service area is divided into multiple time zones based on the collection results; then, each location zone is analyzed based on the multiple time zones, and a route screening length corresponding to each location zone is obtained based on the analysis results; finally, all route screening lengths are screened, and an optimal recycling route is obtained based on the screening results, and the location zone corresponding to the optimal recycling route is recorded as the optimal location zone; and a location for the garbage transfer station is selected based on the optimal location zone.

[0100] In addition, the logical instructions in the above-mentioned memory can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when sold or used as an independent product. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, and other media that can store program code.

[0101] Example 4. The present application also provides a computer-readable storage medium. The present application provides a storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps in the above garbage transfer station site selection method are executed to achieve the following functions: first, the areas where the garbage transfer station is allowed to be sited and the areas served by the garbage transfer station are obtained in the map, and are recorded as site selection areas and service areas respectively; based on the surveillance camera, the resident flow data of all roads in the service area is collected, and the service area is divided into multiple time period areas based on the collection results; then, each site selection area is analyzed based on the multiple time period areas, and the route screening length corresponding to each site selection area is obtained based on the analysis results; finally, all route screening lengths are screened, and the optimal recycling route is obtained based on the screening results, and the site selection area corresponding to the optimal recycling route is recorded as the optimal site selection area; the garbage transfer station is sited based on the optimal site selection area.

[0102] Through the description of the above embodiments, the embodiments of the present invention can be provided as methods, systems, or computer program products. Based on this understanding, the essence of the above technical solutions or the portion that contributes to the prior art can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a magnetic disk, or an optical disk, and includes a number of instructions for enabling a computer device (such as a personal computer, server, or network device) to execute the methods described in various embodiments or certain portions of the embodiments.

[0103] In the embodiments provided in this application, it should be understood that the disclosed system or method can be implemented in other ways. The embodiments described above are merely illustrative. For example, the division of modules or units is only a logical function division. There may be other division methods in actual implementation. For example, multiple modules or units can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some communication interfaces, and the indirect coupling or communication connection of systems, modules and units can be electrical, mechanical or other forms.

[0104] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. The method for selecting a site for a garbage transfer station is characterized by: The steps include: Obtain the areas where the waste transfer station is allowed to be located and the areas served by the waste transfer station from the map, and record them as the location area and service area respectively; The resident flow data of all roads in the service area is collected using surveillance cameras, and the service area is divided into multiple time zones based on the collection results; Analyze each location area based on multiple time periods, and obtain the route screening length corresponding to each location area based on the analysis results; Screen all route screening lengths, and obtain the optimal recycling route based on the screening results, and record the site selection area corresponding to the optimal recycling route as the optimal site selection area; select the site of the garbage transfer station based on the optimal site selection area; The surveillance cameras collect the flow data of residents on all roads in the service area, and divide the service area into multiple time zones based on the collection results, including: Establish a plane rectangular coordinate system and record it as the map analysis coordinate system, where the units of the X-axis and Y-axis of the map analysis coordinate system are both km; based on the location and proportional relationship of the site selection area and the service area, draw the site selection area and the service area in the map analysis coordinate system at equal scale; In the map analysis coordinate system: all crossroads and T-junctions in the site selection area are recorded as resident flow nodes; for any resident flow node A: the resident flow node B closest to the resident flow node A is recorded as the neighboring node of the resident flow node A, the straight-line distance between the resident flow node A and the neighboring node is recorded as L, and L / 2 is recorded as the neighboring radius; circles are drawn with the resident flow node A and the neighboring node as the center and the neighboring radius as the radius, and are recorded as the neighboring analysis circles of the resident flow node A and the neighboring node respectively; Obtain the neighboring nodes and neighboring analysis circles corresponding to all resident mobility nodes that do not contain neighboring analysis circles; The monitoring cameras collect the flow data of residents on all roads in the service area, and divide the service area into multiple time zones based on the collected results. For any proximity analysis circle corresponding to a resident mobility node A, all roads within the proximity analysis circle are recorded as data collection roads for resident mobility node A. Cameras are placed on the actual roads corresponding to each data collection road, and the number of residents in the video captured by the camera is identified based on AI recognition. The data obtained by all cameras based on AI recognition is recorded as resident mobility data. Obtain K days of resident mobility data. For any day's corresponding resident mobility data: establish a plane rectangular coordinate system and record it as the mobility analysis coordinate system, where the unit of the X-axis of the mobility analysis coordinate system is h and the Y-axis is the number axis; based on the total number of residents identified by all cameras from 0:00 to 24:00 in the resident mobility data, draw a corresponding curve between X=0h and X=24h in the mobility analysis coordinate system and record it as the personnel mobility curve; Obtain K personnel flow curves corresponding to the resident flow data collected on K days, and fit the K personnel flow curves. The obtained curve is recorded as the time period curve of the resident flow node, and the point with the smallest ordinate in the time period curve is recorded as the regional screening point; The monitoring cameras collect the flow data of residents on all roads in the service area, and divide the service area into multiple time zones based on the collected results. Obtain the time period curves corresponding to all resident flow nodes and place all time period curves in the flow analysis coordinate system α; for any time period curve γ in the flow analysis coordinate system α, use the time period algorithm to obtain the time period correlation parameters corresponding to the time period curve γ and other time period curves respectively. The time period algorithm is: F = (1 + f1) × |X1-X2|, where F is the time period correlation parameter, f1 is the length of the region in the time period curve γ with the same abscissa and slope as the other time period curve on the X-axis, X1 is the ordinate of the regional screening point of the time period curve γ, and X2 is the ordinate of the regional screening point of the other time period curve; Among all the period correlation parameters corresponding to the period curve γ, the period curve corresponding to the smallest period correlation parameter is recorded as the near correlation curve of the period curve γ; Get the nearly related curves corresponding to all time period curves; Based on the horizontal coordinates of all regional screening points from small to large, the neighboring analysis circles of the resident flow nodes corresponding to all regional screening points are recorded as time period area SQ1 to time period area SQ c , where c is the number of resident mobility nodes, and the adjacent area of ​​the time period area SQ is set to the time period area SQ corresponding to the near-association curve corresponding to the time period curve of the time period area SQ.

2. The method for selecting a site for a garbage transfer station according to claim 1, wherein: Analyze each location area based on multiple time zones, and obtain the route screening length corresponding to each location area based on the analysis results, including: For any site selection area: in the map analysis coordinate system, take the site selection area as the starting point, and pass through the time zone SQ1 to the time zone SQ c And the shortest route back to the site selection area is recorded as the time-series recovery route; After the garbage truck starts from the site selection area and executes method V to reach all time period areas SQ, the shortest route back to the site selection area is recorded as the nearest recycling route. Among them, method V is: the time period area SQ closest to the garbage truck and where garbage collection is not performed is used as the destination of the garbage truck, and when the garbage truck arrives at the destination, the time period area SQ where the garbage truck is located is recorded as the time period area SQ where garbage collection has been performed. When the garbage truck arrives at any time period area SQ, method V is repeated.

3. The method for selecting a site for a garbage transfer station according to claim 2, wherein: Analyzing each location area based on multiple time zones and obtaining the route screening length corresponding to each location area based on the analysis results also includes: Obtain the shortest route for the garbage truck to start from the selected area, execute method T to reach all time period areas SQ, and then return to the selected area, which is recorded as the adjacent recycling route; Method T is as follows: the time zone SQ closest to the garbage truck and where no garbage collection is being carried out is used as the destination of the garbage truck. When the garbage truck arrives at the destination, the destination of the garbage truck is adjusted to the adjacent area corresponding to the time zone SQ. When the garbage truck arrives at any adjacent area, method T is repeatedly executed. When the garbage truck arrives at any time zone SQ, the time zone SQ where the garbage truck is located is recorded as the time zone SQ where garbage collection has been carried out. The total length of the sequential recycling route, the nearest recycling route and the adjacent recycling route corresponding to the site selection area is recorded as the route screening length of the site selection area; Get the route screening lengths corresponding to all site selection areas.

4. The method for selecting a site for a garbage transfer station according to claim 3, wherein: All route screening lengths are screened, and the optimal recycling route is obtained based on the screening results, and the site selection area corresponding to the optimal recycling route is recorded as the optimal site selection area; the site selection of the garbage transfer station based on the optimal site selection area includes: The time-series recycling route, the nearest recycling route, and the adjacent recycling route corresponding to the minimum value among all route screening lengths are recorded as the optimal recycling route, and the location area corresponding to the optimal recycling route is recorded as the optimal location area; The location of the garbage transfer station is selected based on the location of the most preferred site area.

5. A garbage transfer station site selection system, used to implement the garbage transfer station site selection method according to any one of claims 1 to 4, characterized in that: It includes resident flow analysis module, site selection area analysis module and screening addressing module; The resident flow analysis module is used to obtain the areas where garbage transfer stations are allowed to be located and the areas served by the garbage transfer stations in the map, and record them as the location area and service area respectively; The resident flow data of all roads in the service area is collected using surveillance cameras, and the service area is divided into multiple time zones based on the collection results; The site selection area analysis module is used to analyze each site selection area based on multiple time period areas, and obtain the route screening length corresponding to each site selection area based on the analysis results; The screening and addressing module is used to screen the screening lengths of all routes, and obtain the optimal recycling route based on the screening results, and record the site selection area corresponding to the optimal recycling route as the optimal site selection area; the garbage transfer station is selected based on the optimal site selection area.

6. An electronic device, characterized in that: The method comprises a processor and a memory, wherein the memory stores computer-readable instructions, and when the computer-readable instructions are executed by the processor, the steps in the method according to any one of claims 1 to 4 are executed.

7. A storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 4 are executed.

Images