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

Abstract

The embodiment of the invention discloses a garbage transfer station site selection method based on garbage throwing points. A specific embodiment of the method comprises the following steps: acquiring basic information and historical collection and transportation data of an existing garbage throwing point; based on the garbage throwing point information set and the historical collection and transportation data set, grouping the garbage throwing point information set to obtain a garbage throwing point information group set; for each garbage throwing point information group in the garbage throwing point information group set, garbage transfer station information is determined by using each piece of garbage throwing point information in the garbage throwing point information group, and a garbage transfer station information set is obtained; adding the newly set garbage throwing point information into a garbage throwing point information group in the garbage throwing point information group set; and controlling the display terminal to visually display the garbage throwing point information group set and the position information of each garbage transfer station. According to the implementation mode, scientific and efficient site selection of the garbage transfer station is achieved, the garbage collection and transportation efficiency and the resource utilization rate are improved, and the transportation cost is reduced.

Description

Technical Field

[0001] Embodiments of the present disclosure relate to the field of computer technology, and in particular to a method, device, equipment and medium for selecting a site for a garbage transfer station based on garbage delivery points. Background Art

[0002] Garbage transfer station site selection is a technology that selects one or more suitable locations within a city or region to build a garbage transfer station. As a key node connecting the garbage generation point and the final treatment facility, the location of the garbage transfer station directly affects the garbage collection efficiency, transportation costs and environmental impact. At present, when selecting the site of a garbage transfer station, the usual method is to determine the location of the transfer station through manual experience or simple geometric methods (such as the shortest path method).

[0003] However, when adopting the above method to select the site of the garbage transfer station, the following technical problems often occur:

[0004] First, it relies on manual experience and simple algorithms, lacks systematicity and scientificity, and decision-making based on experience not only increases the risk of human error, but also limits the diversity and flexibility of site selection options, while also making it difficult to guarantee the optimality of the results.

[0005] Second, in reality, the number of garbage generating points is large and their distribution is complex. It is difficult to effectively process and deeply mine massive data by relying solely on manual analysis. This not only makes the site selection process time-consuming and laborious, but may also lead to irrational allocation of resources and increase unnecessary construction and operating costs. Summary of the invention

[0006] The content of this disclosure is used to introduce concepts in a brief form, which will be described in detail in the detailed implementation section below. The content of this disclosure is not intended to identify the key features or essential features of the technical solution claimed for protection, nor is it intended to limit the scope of the technical solution claimed for protection.

[0007] Some embodiments of the present disclosure propose a method, device, electronic device and computer-readable medium for selecting a garbage transfer station based on garbage delivery points to solve one or more of the technical problems mentioned in the above background technology section.

[0008] In a first aspect, some embodiments of the present disclosure provide a method for selecting a garbage transfer station based on a garbage drop point, the method comprising: obtaining basic information and historical collection and transportation data of an existing garbage drop point, obtaining a garbage drop point information set and a historical collection and transportation data set, wherein the garbage drop point information in the above garbage drop point information set comprises: a garbage drop point identifier, location information, a drop point type, and a loading volume, and the historical collection and transportation data in the above historical collection and transportation data set comprises: a garbage drop point identifier, a garbage collection and transportation volume, and a garbage collection and transportation frequency, and each historical collection and transportation data in the above historical collection and transportation data set corresponds to the same historical time period. Based on the above garbage drop point information set and the above historical collection and transportation data set, the above garbage drop point information set is grouped to obtain a garbage drop point information group set. For each garbage drop point information group in the above garbage drop point information group set, the garbage transfer station information is determined using the information of each garbage drop point in the above garbage drop point information group to obtain a garbage transfer station information set, wherein the garbage transfer station information in the above garbage transfer station information set comprises: a garbage transfer station identifier, location information, a number of personnel configurations, and a number of vehicle configurations. In response to receiving the newly established garbage disposal point information, the newly established garbage disposal point information is added to the garbage disposal point information group in the garbage disposal point information group set. The control display terminal is used to visualize the garbage disposal point information group set and the location information of each garbage transfer station.

[0009] In a second aspect, some embodiments of the present disclosure provide a garbage transfer station site selection device based on garbage disposal points, the device comprising: an acquisition unit, configured to acquire basic information and historical collection and transportation data of existing garbage disposal points, and obtain a garbage disposal point information set and a historical collection and transportation data set, wherein the garbage disposal point information in the above garbage disposal point information set includes: garbage disposal point identification, location information, disposal point type and loading capacity, and the historical collection and transportation data in the above historical collection and transportation data set includes: garbage disposal point identification, garbage collection and transportation volume and garbage collection and transportation times, and each historical collection and transportation data in the above historical collection and transportation data set corresponds to the same historical time period. A grouping unit, configured to group the above garbage disposal point information set based on the above garbage disposal point information set and the above historical collection and transportation data set, and obtain a garbage disposal point information group set. The determination unit is configured to determine the garbage transfer station information for each garbage drop point information group in the above-mentioned garbage drop point information group set using the information of each garbage drop point in the above-mentioned garbage drop point information group to obtain the garbage transfer station information set, wherein the garbage transfer station information in the above-mentioned garbage transfer station information set includes: garbage transfer station identification, location information, number of personnel configurations, and number of vehicle configurations. The adding unit is configured to respond to receiving the newly established garbage drop point information and add the newly established garbage drop point information to the garbage drop point information group in the above-mentioned garbage drop point information group set. The display unit is configured to control the display terminal to visually display the above-mentioned garbage drop point information group set and the location information of each garbage transfer station.

[0010] In a third aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; a storage device on which one or more programs are stored, and when the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any implementation manner of the above-mentioned first aspect.

[0011] In a fourth aspect, some embodiments of the present disclosure provide a computer-readable medium having a computer program stored thereon, wherein when the program is executed by a processor, the method described in any implementation manner of the above-mentioned first aspect is implemented.

[0012] The above-mentioned embodiments of the present disclosure have the following beneficial effects: through the garbage transfer station site selection method based on garbage delivery points of some embodiments of the present disclosure, the location of garbage transfer can be selected more scientifically to improve the efficiency of garbage collection and transportation. Specifically, the decision-making method based on experience not only increases the risk of human error, but also limits the diversity and flexibility of the site selection scheme, and it is difficult to ensure the optimality of the result because it relies on manual experience and simple algorithms, lacks systematicity and scientificity. Based on this, the garbage transfer station site selection method based on garbage delivery points of some embodiments of the present disclosure, first, obtains the basic information and historical collection and transportation data of the existing garbage delivery points, obtains the garbage delivery point information set and the historical collection and transportation data set, wherein the garbage delivery point information in the above-mentioned garbage delivery point information set includes: garbage delivery point identification, location information, delivery point type and loading capacity, the historical collection and transportation data in the above-mentioned historical collection and transportation data set includes: garbage delivery point identification, garbage collection and transportation volume and garbage collection and transportation times, and each historical collection and transportation data in the above-mentioned historical collection and transportation data set corresponds to the same historical time period. Therefore, the distribution of garbage delivery points and the historical collection and transportation rules can be fully grasped, providing a solid data foundation for subsequent site selection. Then, based on the above garbage placement point information set and the above historical collection and transportation data set, the above garbage placement point information set is grouped to obtain a garbage placement point information group set. Thus, different service areas can be reasonably divided according to factors such as the amount of garbage generated, geographical location, and collection and transportation frequency, ensuring that the number and distribution of garbage placement points in each area are relatively balanced. Then, for each garbage placement point information group in the above garbage placement point information group set, the garbage transfer station information is determined using the information of each garbage placement point in the above garbage placement point information group to obtain a garbage transfer station information set, wherein the garbage transfer station information in the above garbage transfer station information set includes: garbage transfer station identification, location information, number of personnel configuration, and number of vehicle configuration. Thus, the most suitable transfer station location can be accurately selected according to the actual needs of each group, and resources can be reasonably allocated to ensure efficient operation. Then, in response to receiving the newly established garbage placement point information, the above newly established garbage placement point information is added to the garbage placement point information group in the above garbage placement point information group set. Thus, the grouping of garbage placement points can be dynamically adjusted to maintain flexibility and adaptability. Finally, the control display terminal visualizes the above garbage disposal point information group set and the location information of each garbage transfer station. As a result, users can view the distribution of garbage disposal points and service areas, as well as the specific location and resource allocation of transfer stations in real time through an intuitive map interface, which facilitates management and supervision and improves the transparency and efficiency of decision-making. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the accompanying drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and that components and elements are not necessarily drawn to scale.

[0014] Figure 1 is a flow chart of some embodiments of a method for selecting a garbage transfer station site based on garbage delivery points according to the present disclosure;

[0015] Figure 2 is a schematic diagram showing the location of a garbage delivery point in some embodiments of the garbage transfer station site selection method based on the garbage delivery point disclosed in the present invention;

[0016] Figure 3 It is a schematic diagram of garbage placement point information display in some embodiments of the garbage transfer station site selection method based on garbage placement points according to the present disclosure;

[0017] Figure 4 It is a structural schematic diagram of some embodiments of the garbage transfer station site selection device based on garbage delivery points disclosed in the present invention;

[0018] Figure 5 It is a schematic diagram of the structure of an electronic device suitable for implementing some embodiments of the present disclosure. DETAILED DESCRIPTION

[0019] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments set forth herein. On the contrary, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0020] It should also be noted that, for ease of description, only the parts related to the invention are shown in the drawings. In the absence of conflict, the embodiments and features in the embodiments of the present disclosure can be combined with each other.

[0021] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0022] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0023] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0024] The present disclosure will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

[0025] refer to Figure 1 The process 100 of some embodiments of the method for selecting a garbage transfer station based on a garbage delivery point according to the present disclosure is shown. The method for selecting a garbage transfer station based on a garbage delivery point comprises the following steps:

[0026] Step 101, obtain basic information and historical collection and transportation data of existing garbage disposal points, and obtain a garbage disposal point information set and a historical collection and transportation data set.

[0027] In some embodiments, the executor of the garbage transfer station site selection method based on garbage delivery points can obtain the basic information and historical collection and transportation data of existing garbage delivery points through a wired connection or a wireless connection to obtain a garbage delivery point information set and a historical collection and transportation data set. Among them, the garbage delivery point information in the above-mentioned garbage delivery point information set may include: garbage delivery point identification, location information, delivery point type and loading capacity. The historical collection and transportation data in the above-mentioned historical collection and transportation data set may include: garbage delivery point identification, garbage collection and transportation volume and garbage collection and transportation times. Each historical collection and transportation data in the above-mentioned historical collection and transportation data set corresponds to the same historical time period.

[0028] The above garbage disposal point identifier can be used to uniquely identify a garbage disposal point. The above disposal point types may include but are not limited to: domestic garbage disposal points, construction garbage disposal points, and agricultural garbage disposal points. In practice, the length of the above historical time period can be set according to actual application needs. As an example, the length of the above historical time period can be three days.

[0029] Step 102: based on the garbage disposal point information set and the historical collection and transportation data set, the garbage disposal point information set is grouped to obtain a garbage disposal point information group set.

[0030] In some embodiments, the execution subject groups the garbage disposal point information set based on the garbage disposal point information set and the historical collection and transportation data set to obtain a garbage disposal point information group set, and may perform the following steps:

[0031] In the first step, each piece of garbage disposal point information in the above garbage disposal point information set is taken as a garbage disposal point information cluster to obtain a garbage disposal point information cluster set.

[0032] In the second step, for each garbage disposal point information cluster in the above garbage disposal point information cluster set, the following merging sub-steps are performed:

[0033] The first merging sub-step is to determine the distance value between any two garbage disposal point information clusters in the garbage disposal point information cluster set to obtain a distance value matrix.

[0034] In the second merging sub-step, two garbage placement point information clusters corresponding to the minimum distance value in the distance value matrix are merged.

[0035] The third merging sub-step is to determine the number of garbage disposal point information clusters in the garbage disposal point information cluster set to obtain the number of clusters.

[0036] In a fourth merging sub-step, in response to determining that the number of clusters is less than or equal to a preset number, each garbage disposal point information cluster in the garbage disposal point information cluster set is determined as a garbage disposal point information group to obtain a garbage disposal point information group set.

[0037] In the third step, in response to determining that the number of clusters is greater than the preset number, continue to execute the merging sub-step.

[0038] In practice, the preset number can be set according to actual application needs, and is not limited here. As an example, the preset number can be 6.

[0039] In some optional implementations of some embodiments, the location information in the garbage disposal point information in the garbage disposal point information set is a geographic coordinate, and the execution subject determines the distance value between any two garbage disposal point information clusters in the garbage disposal point information cluster set to obtain a distance value matrix, and the following steps may be performed:

[0040] The first step is to sort the garbage disposal point information clusters in the above garbage disposal point information cluster set to obtain a garbage disposal point information cluster sequence.

[0041] The second step is to generate an initial distance matrix according to the number of garbage point information clusters in the above garbage point information cluster sequence. The dimension of the above initial distance matrix is ​​the same as the number of garbage point information clusters in the above garbage point information cluster sequence. Each data in the above initial distance matrix is ​​zero.

[0042] In the third step, for each garbage disposal point information cluster in the above garbage disposal point information cluster sequence, the following pre-processing sub-steps are performed:

[0043] The first preprocessing sub-step is to determine the number of garbage disposal point information clusters in the above-mentioned garbage disposal point information clusters to obtain a first quantity value.

[0044] In the second preprocessing sub-step, in response to determining that the first quantity value is greater than one, the following generation sub-steps are performed on the garbage placement point information cluster:

[0045] The first generation sub-step is to average the geographic coordinates in the garbage disposal point information cluster to obtain cluster coordinates.

[0046] The second generation sub-step is to average the garbage collection and transportation volume and the garbage collection and transportation times in the historical collection and transportation data corresponding to each garbage disposal point information in the above-mentioned garbage disposal point information cluster to obtain the cluster garbage collection and transportation volume and the cluster garbage collection and transportation times.

[0047] The third preprocessing sub-step, in response to determining that the above-mentioned first quantity value is equal to one, determines the geographical coordinates in the above-mentioned garbage disposal point information cluster as cluster coordinates, and determines the garbage collection and transportation volume and garbage collection and transportation times in the historical collection and transportation data corresponding to the above-mentioned garbage disposal point information cluster as the cluster garbage collection and transportation volume and cluster garbage collection and transportation times.

[0048] The fourth preprocessing sub-step is to combine the cluster coordinates, the cluster garbage collection and transportation volume, and the cluster garbage collection and transportation times to obtain cluster information.

[0049] The fifth preprocessing sub-step is to add the above cluster information to the cluster information sequence.

[0050] Randomly select two garbage disposal point information clusters from the above garbage disposal point information cluster sequence as the first information cluster and the second information cluster.

[0051] Step 4: for the first information cluster and the second information cluster, perform the following distance determination sub-steps:

[0052] In the first distance determination sub-step, the cluster information corresponding to the first information cluster and the second information cluster in the cluster information sequence are determined as the first cluster information and the second cluster information.

[0053] The second distance determination substep is to determine the distance value between the cluster coordinates in the first cluster information and the second cluster information to obtain a first reference distance value.

[0054] The third distance determination sub-step, in response to determining that the first reference distance value is less than the target distance value, determines whether the sum of the cluster garbage collection and transportation volumes in the first cluster information and the second cluster information is less than the target garbage collection and transportation volume.

[0055] In practice, the specific numerical value of the above target distance value can be set according to actual application needs, and is not limited here.

[0056] The fourth distance determination sub-step, in response to determining that the sum of the cluster garbage collection and transportation volumes in the first cluster information and the second cluster information is less than the above-mentioned target garbage collection and transportation volume, determines whether the cluster garbage collection and transportation times in the first cluster information and the second cluster information are less than the target garbage collection and transportation times.

[0057] In practice, the specific value of the above-mentioned target garbage collection and transportation times can be set according to actual application needs, and is not limited here.

[0058] The fifth distance determination sub-step, in response to determining that the number of cluster garbage collection and transportation in the first cluster information and the second cluster information is less than the above-mentioned target garbage collection and transportation number, sets the value at the position corresponding to the first cluster information and the second cluster information in the above-mentioned initial distance matrix to a first reference distance value, and determines whether the above-mentioned garbage disposal point information cluster sequence meets a preset condition. The above-mentioned preset condition may be that the above-mentioned garbage disposal point information cluster sequence exists between which the above-mentioned distance determination sub-step is not executed.

[0059] The sixth distance determination sub-step, in response to determining that the first reference distance value is greater than or equal to the above-mentioned target distance value, or the sum of the cluster garbage collection and transportation volumes in the first cluster information and the second cluster information is greater than or equal to the above-mentioned target garbage collection and transportation volume, or the number of cluster garbage collection and transportation times in the first cluster information and the second cluster information is greater than or equal to the above-mentioned target garbage collection and transportation times, sets the numerical values ​​at the positions corresponding to the first cluster information and the second cluster information in the above-mentioned initial distance matrix to positive infinity.

[0060] In a seventh distance determination sub-step, in response to determining that the garbage placement point information cluster sequence does not satisfy the preset condition, the initial distance matrix is ​​determined as a distance value matrix.

[0061] In the fifth step, in response to determining that the above-mentioned garbage disposal point information cluster sequence meets the above-mentioned preset conditions, any two garbage disposal point information clusters that meet the preset conditions are selected from the above-mentioned garbage disposal point information cluster sequence as the first information cluster and the second information cluster, and the above-mentioned distance determination sub-step is continued to be executed.

[0062] The above-mentioned steps of grouping the garbage placement point information set based on the garbage placement point information set and the historical collection and transportation data set to obtain the garbage placement point information group set and its expansion steps are an inventive point of the embodiment of the present disclosure, which further solves the technical problem mentioned in the background technology: "limiting the diversity and flexibility of the site selection scheme, and it is difficult to ensure the optimality of the result". The factors that lead to the above technical problems are often as follows: relying on manual experience and simple algorithms, lacking systematicity and scientificity. If the above factors are solved, it is possible to achieve a more scientific selection of the location of garbage transfer and improve the efficiency of garbage collection and transportation. In order to achieve this effect, the present disclosure introduces the geographical coordinates of the garbage placement point, the amount of garbage collection and transportation, and the number of garbage collection and transportation, and then comprehensively considers and analyzes the geographical coordinates of each garbage placement point, so as to design the shortest or optimal garbage collection and transportation route, reduce transportation time and cost, and improve efficiency. At the same time, according to the amount and number of garbage collection and transportation, the required human and material resources, including the number of vehicles, personnel configuration, etc., can be more accurately estimated, thereby realizing the reasonable allocation of resources.

[0063] Step 103: for each garbage disposal point information group in the garbage disposal point information group set, the garbage transfer station information is determined using the information of each garbage disposal point in the garbage disposal point information group to obtain the garbage transfer station information set.

[0064] In some embodiments, the garbage transfer station information in the above-mentioned garbage transfer station information set may include: garbage transfer station identification, location information, number of personnel configurations, and number of vehicle configurations.

[0065] The execution subject may determine the garbage transfer station information for each garbage disposal point information group in the garbage disposal point information group set by using the information of each garbage disposal point in the garbage disposal point information group to obtain the garbage transfer station information set, and may perform the following steps:

[0066] In the first step, the historical collection and transportation data corresponding to each garbage disposal point information in the above garbage disposal point information group is determined as the target historical collection and transportation data to obtain a target historical collection and transportation data set.

[0067] The second step is to sum up the garbage collection and transportation volumes in the above target historical collection and transportation data set to obtain the sum of the target garbage collection and transportation volumes.

[0068] The third step is to sum up the number of garbage collection and transportation times in the above target historical collection and transportation data set to obtain the target garbage collection and transportation times.

[0069] The fourth step is to determine the product of the sum of the above-mentioned target garbage collection and transportation volumes and the first expansion coefficient as the expanded standard garbage collection and transportation volume.

[0070] The fifth step is to determine the product of the sum of the above-mentioned target garbage collection and transportation times and the second expansion coefficient as the expanded garbage collection and transportation times.

[0071] In practice, the specific values ​​of the first expansion coefficient and the second expansion coefficient can be set according to actual application needs. As an example, the first expansion coefficient and the second expansion coefficient can both be 1.1.

[0072] The sixth step is to round up the ratio of the above-mentioned expanded standard garbage collection and transportation volume to the preset per capita processing volume to obtain the number of staffing.

[0073] In practice, the preset per capita garbage disposal volume can be determined based on the daily per capita garbage disposal volume in actual applications, and is not limited here.

[0074] The seventh step is to round up the ratio of the above-mentioned number of collection and transportation times of expanded garbage to the preset number of collection and transportation times per vehicle to obtain the number of vehicle configurations.

[0075] In practice, the preset number of collection and transportation per vehicle can be determined based on the daily number of collection and transportation per vehicle in actual applications, and is not limited here.

[0076] In some optional implementations of some embodiments, before determining the garbage transfer station information by using the information of each garbage disposal point in the garbage disposal point information group to obtain the garbage transfer station information set for each garbage disposal point information group in the garbage disposal point information group, the execution entity may group the historical collection and transportation data set according to the grouping of the information of each garbage disposal point in the garbage disposal point information group to obtain a historical collection and transportation data group sequence.

[0077] Optionally, the execution subject may determine the garbage transfer station information for each garbage drop point information group in the garbage drop point information group set by using the information of each garbage drop point in the garbage drop point information group to obtain the garbage transfer station information set, and may perform the following steps:

[0078] The first step is to select the historical collection and transportation data group corresponding to the above-mentioned garbage disposal point information group from the above-mentioned historical collection and transportation data group sequence as the collection and transportation data group to be processed.

[0079] The second step is to normalize the garbage collection and transportation volumes and garbage collection and transportation times in the above-mentioned collection and transportation data group to be processed, so as to obtain the target collection and transportation data group.

[0080] The third step is to determine the sum of the normalized garbage collection and transportation volume and the normalized garbage collection and transportation times in each target collection and transportation data in the above target collection and transportation data group as the weight value to obtain a weight value set.

[0081] Step 4: For each dimension of the geographic coordinates, perform the following coordinate value determination sub-steps:

[0082] The first coordinate value determination sub-step is to sum up each weight value in the above-mentioned weight value set to obtain a first value.

[0083] The second coordinate value determination sub-step is to multiply the coordinate value corresponding to the above dimension in each geographic coordinate in the above garbage disposal point information group by the corresponding weight value in the above weight value set to generate a weight product value, thereby obtaining a weight product value set.

[0084] The third coordinate value determination sub-step is to sum up each weight product value in the above-mentioned weight product value set to obtain a second value.

[0085] The fourth coordinate value determination sub-step is to determine the ratio of the second value to the first value as the target coordinate value.

[0086] The fifth step is to combine the target coordinate values ​​corresponding to each dimension in the geographic coordinates to obtain the location information of the garbage transfer station.

[0087] The above-mentioned steps of determining the garbage transfer station information using the information of each garbage drop point in the garbage drop point information group to obtain the garbage transfer station information set and its extended sub-steps are an inventive point of an embodiment of the present disclosure, which solves the second technical problem mentioned in the background technology: "The site selection process is time-consuming and labor-intensive, which may lead to unreasonable allocation of resources and increase unnecessary construction and operation costs." The factors that lead to the above technical problems are often as follows: In practice, the number of garbage generating points is large and the distribution is complex, and it is difficult to achieve effective processing and deep mining of massive data by manual analysis alone. If the above factors are solved, the effect of improving the accuracy of vehicle-mounted data can be achieved. In order to achieve this effect, the present disclosure introduces the automatic processing and analysis of a large amount of historical collection and transportation data from each garbage drop point, and through the optimization algorithm, quickly and accurately calculates the optimal garbage transfer station location and the corresponding personnel and vehicle configuration. In addition, the model also has the ability to dynamically adjust, and can continuously optimize the grouping of new garbage drop points according to the changes in real-time data to ensure the long-term and efficient operation of the system. In this way, not only the efficiency of the site selection process is improved and human intervention is reduced, but also the construction and operation costs are significantly reduced, and the rational allocation and utilization of resources are achieved.

[0088] Step 104: in response to receiving the newly established garbage disposal point information, adding the newly established garbage disposal point information to the garbage disposal point information group in the garbage disposal point information group set.

[0089] In some embodiments, in response to receiving the newly established garbage drop point information, the execution subject adds the newly established garbage drop point information to the garbage drop point information group in the garbage drop point information group set, and may perform the following steps:

[0090] In the first step, for each garbage disposal point information group in the above garbage disposal point information group set, the following processing sub-steps are performed:

[0091] In the first processing sub-step, the garbage transfer station location information corresponding to the above-mentioned garbage placement point information group is determined as the target garbage transfer station location information.

[0092] The second processing sub-step is to determine a second reference distance value using the location information in the newly established garbage disposal point information and the location information of the target garbage transfer station. The second reference distance value is the distance between the geographical locations represented by the location information in the newly established garbage disposal point information and the location information of the target garbage transfer station.

[0093] The third processing sub-step is, in response to determining that the second reference distance value is less than or equal to the preset distance value, determining the target garbage transfer station location information as the garbage transfer station location information to be selected.

[0094] In practice, the preset distance value may be set according to actual application needs, and is not limited here. As an example, the preset distance value may be 20 kilometers.

[0095] The fourth processing sub-step is to sum the garbage collection and transportation volumes in the above-mentioned historical collection and transportation data set and the above-mentioned historical collection and transportation data corresponding to the location information of the candidate garbage transfer station to obtain the sum of the garbage collection and transportation volumes.

[0096] The second step is to add the newly established garbage disposal point information to the garbage disposal point information group that meets the preset joining condition in the garbage disposal point information group set. The preset joining condition may be that the garbage disposal point information group is the garbage disposal point information corresponding to the smallest sum of the garbage collection and transportation volumes among the sums of the garbage collection and transportation volumes.

[0097] Step 105, controlling the display terminal to visually display the garbage placement point information group set and the location information of each garbage transfer station.

[0098] In some embodiments, the execution subject controls the display terminal to visually display the garbage drop point information group set and the location information of each garbage transfer station, and may perform the following steps:

[0099] The first step is to display the location of the garbage disposal point represented by each garbage disposal point information in the above garbage disposal point information group set in the electronic map in the display terminal.

[0100] For example, Figure 2 It is a screenshot of an internal test operation page for displaying garbage disposal point monitoring in an electronic map in a display terminal in the garbage transfer station site selection method based on garbage disposal points disclosed in the present invention.

[0101] Figure 3 This is a screenshot of an internal test operation page for displaying garbage disposal point information in an electronic map in a display terminal in the garbage transfer station site selection method based on garbage disposal points disclosed in the present invention.

[0102] The second step is to display the location information of each garbage transfer station on the electronic map in the display terminal.

[0103] For example, Figure 3 It is a screenshot of an internal test operation page for displaying the location information of a garbage transfer station in an electronic map in a display terminal in the garbage transfer station site selection method based on garbage delivery points disclosed in the present invention.

[0104] The above-mentioned embodiments of the present disclosure have the following beneficial effects: through the garbage transfer station site selection method based on garbage delivery points of some embodiments of the present disclosure, the location of garbage transfer can be selected more scientifically to improve the efficiency of garbage collection and transportation. Specifically, the decision-making method based on experience not only increases the risk of human error, but also limits the diversity and flexibility of the site selection scheme, and it is difficult to ensure the optimality of the result because it relies on manual experience and simple algorithms, lacks systematicity and scientificity. Based on this, the garbage transfer station site selection method based on garbage delivery points of some embodiments of the present disclosure, first, obtains the basic information and historical collection and transportation data of the existing garbage delivery points, obtains the garbage delivery point information set and the historical collection and transportation data set, wherein the garbage delivery point information in the above-mentioned garbage delivery point information set includes: garbage delivery point identification, location information, delivery point type and loading capacity, the historical collection and transportation data in the above-mentioned historical collection and transportation data set includes: garbage delivery point identification, garbage collection and transportation volume and garbage collection and transportation times, and each historical collection and transportation data in the above-mentioned historical collection and transportation data set corresponds to the same historical time period. Therefore, the distribution of garbage delivery points and the historical collection and transportation rules can be fully grasped, providing a solid data foundation for subsequent site selection. Then, based on the above garbage placement point information set and the above historical collection and transportation data set, the above garbage placement point information set is grouped to obtain a garbage placement point information group set. Thus, different service areas can be reasonably divided according to factors such as the amount of garbage generated, geographical location, and collection and transportation frequency, ensuring that the number and distribution of garbage placement points in each area are relatively balanced. Then, for each garbage placement point information group in the above garbage placement point information group set, the garbage transfer station information is determined using the information of each garbage placement point in the above garbage placement point information group to obtain a garbage transfer station information set, wherein the garbage transfer station information in the above garbage transfer station information set includes: garbage transfer station identification, location information, number of personnel configuration, and number of vehicle configuration. Thus, the most suitable transfer station location can be accurately selected according to the actual needs of each group, and resources can be reasonably allocated to ensure efficient operation. Then, in response to receiving the newly established garbage placement point information, the above newly established garbage placement point information is added to the garbage placement point information group in the above garbage placement point information group set. Thus, the grouping of garbage placement points can be dynamically adjusted to maintain flexibility and adaptability. Finally, the control display terminal visualizes the above garbage disposal point information group set and the location information of each garbage transfer station. As a result, users can view the distribution of garbage disposal points and service areas, as well as the specific location and resource allocation of transfer stations in real time through an intuitive map interface, which facilitates management and supervision and improves the transparency and efficiency of decision-making.

[0105] Further references Figure 4 As an implementation of the methods shown in the above figures, the present disclosure provides some embodiments of a garbage transfer station site selection device based on garbage delivery points. These device embodiments are similar to Figure 1 Corresponding to the method embodiments shown, the device can be specifically applied to various electronic devices.

[0106] like Figure 4 As shown, in some embodiments, the garbage transfer station site selection device 400 based on garbage placement points includes: an acquisition unit 401, a grouping unit 402, a determination unit 403, a joining unit 404 and a display unit 405. The acquisition unit 401 is configured to acquire basic information and historical collection and transportation data of existing garbage placement points, and obtain a garbage placement point information set and a historical collection and transportation data set, wherein the garbage placement point information in the above garbage placement point information set includes: garbage placement point identification, location information, placement point type and loading volume, and the historical collection and transportation data in the above historical collection and transportation data set includes: garbage placement point identification, garbage collection and transportation volume and garbage collection and transportation times, and each historical collection and transportation data in the above historical collection and transportation data set corresponds to the same historical time period. The grouping unit 402 is configured to group the above garbage placement point information set based on the above garbage placement point information set and the above historical collection and transportation data set to obtain a garbage placement point information group set. The determination unit 403 is configured to determine the garbage transfer station information for each garbage drop point information group in the above-mentioned garbage drop point information group set using the information of each garbage drop point in the above-mentioned garbage drop point information group to obtain the garbage transfer station information set, wherein the garbage transfer station information in the above-mentioned garbage transfer station information set includes: garbage transfer station identification, location information, number of personnel configurations and number of vehicle configurations. The adding unit 404 is configured to respond to receiving the newly established garbage drop point information and add the newly established garbage drop point information to the garbage drop point information group in the above-mentioned garbage drop point information group set. The display unit 405 is configured to control the display terminal to visually display the above-mentioned garbage drop point information group set and the location information of each garbage transfer station.

[0107] It can be understood that the units recorded in the garbage transfer station site selection device 400 based on the garbage delivery point are similar to the reference Figure 1 Therefore, the operations, features and beneficial effects described above for the method are also applicable to the device 400 and the units included therein, and will not be described in detail here.

[0108] Reference below Figure 5 , which shows a structural schematic diagram of an electronic device 500 suitable for implementing some embodiments of the present disclosure. Figure 5 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0109] like Figure 5As shown, the electronic device 500 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 501, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage device 508 into a random access memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the electronic device 500 are also stored. The processing device 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.

[0110] Typically, the following devices may be connected to the I / O interface 505: an input device 506 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 507 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; and a communication device 509. The communication device 509 may allow the electronic device 500 to communicate with other devices wirelessly or by wire to exchange data. Figure 5 The electronic device 500 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead. Figure 5 Each block shown in the figure may represent one device, or may represent multiple devices as required.

[0111] In particular, according to some embodiments of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, some embodiments of the present disclosure include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In some such embodiments, the computer program can be downloaded and installed from the network through the communication device 509, or installed from the storage device 508, or installed from the ROM 502. When the computer program is executed by the processing device 501, the above-mentioned functions defined in the method of some embodiments of the present disclosure are executed.

[0112] It should be noted that the computer-readable medium recorded in some embodiments of the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In some embodiments of the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In some embodiments of the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer readable signal medium may also be any computer readable medium other than a computer readable storage medium, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer readable medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0113] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (HyperText Transfer Protocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0114] The computer-readable medium may be included in the electronic device; or it may exist independently without being installed in the electronic device. The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: obtains the basic information and historical collection and transportation data of existing garbage disposal points, and obtains a garbage disposal point information set and a historical collection and transportation data set, wherein the garbage disposal point information in the garbage disposal point information set includes: garbage disposal point identification, location information, disposal point type and loading capacity, and the historical collection and transportation data in the historical collection and transportation data set includes: garbage disposal point identification, garbage collection and transportation volume and garbage collection and transportation times, and each historical collection and transportation data in the historical collection and transportation data set corresponds to the same historical time period. Based on the garbage disposal point information set and the historical collection and transportation data set, the garbage disposal point information set is grouped to obtain a garbage disposal point information group set. For each garbage drop point information group in the above garbage drop point information group set, the garbage transfer station information is determined using the information of each garbage drop point in the above garbage drop point information group to obtain a garbage transfer station information set, wherein the garbage transfer station information in the above garbage transfer station information set includes: garbage transfer station identification, location information, number of personnel configurations, and number of vehicle configurations. In response to receiving the newly established garbage drop point information, the newly established garbage drop point information is added to the garbage drop point information group in the above garbage drop point information group set. The control display terminal is visually displayed on the above garbage drop point information group set and the location information of each garbage transfer station.

[0115] Computer program code for performing the operations of some embodiments of the present disclosure may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0116] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0117] The units described in some embodiments of the present disclosure may be implemented by software or by hardware. The described units may also be set in a processor, for example, it may be described as: a processor includes an acquisition unit, a grouping unit, a determination unit, a joining unit and a display unit. The names of these units do not constitute a limitation on the unit itself in some cases. For example, the acquisition unit may also be described as "a unit for obtaining basic information and historical collection and transportation data of existing garbage disposal points."

[0118] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

Claims

1. A method for selecting a location for a garbage transfer station based on a garbage placement point, comprising: Obtaining basic information and historical collection and transportation data of existing garbage disposal points, obtaining a garbage disposal point information set and a historical collection and transportation data set, wherein the garbage disposal point information in the garbage disposal point information set includes: garbage disposal point identification, location information, disposal point type and loading volume, and the historical collection and transportation data in the historical collection and transportation data set includes: garbage disposal point identification, garbage collection and transportation volume and garbage collection and transportation times, and each historical collection and transportation data in the historical collection and transportation data set corresponds to the same historical time period; Based on the garbage disposal point information set and the historical collection and transportation data set, the garbage disposal point information set is grouped to obtain a garbage disposal point information group set; For each garbage drop point information group in the garbage drop point information group set, determine the garbage transfer station information using the information of each garbage drop point in the garbage drop point information group to obtain a garbage transfer station information set, wherein the garbage transfer station information in the garbage transfer station information set includes: a garbage transfer station identifier, location information, a number of personnel configurations, and a number of vehicle configurations; In response to receiving the newly established garbage disposal point information, adding the newly established garbage disposal point information to the garbage disposal point information group in the garbage disposal point information group set; The control display terminal visualizes the garbage placement point information group set and the location information of each garbage transfer station.

2. The method according to claim 1, wherein: The step of grouping the garbage placement point information set based on the garbage placement point information set and the historical collection and transportation data set to obtain a garbage placement point information group set includes: Taking each piece of garbage disposal point information in the garbage disposal point information set as a garbage disposal point information cluster, to obtain a garbage disposal point information cluster set; For each garbage disposal point information cluster in the garbage disposal point information cluster set, the following merging sub-steps are performed: Determine the distance value between any two garbage disposal point information clusters in the garbage disposal point information cluster set to obtain a distance value matrix; Merge the two garbage placement point information clusters corresponding to the minimum distance value in the distance value matrix; Determine the number of garbage disposal point information clusters in the garbage disposal point information cluster set to obtain the number of clusters; In response to determining that the number of clusters is less than or equal to a preset number, determining each garbage disposal point information cluster in the garbage disposal point information cluster set as a garbage disposal point information group to obtain a garbage disposal point information group set; In response to determining that the number of clusters is greater than the preset number, the merging sub-step is continued.

3. The method according to claim 2, wherein: Before determining the garbage transfer station information for each garbage drop point information group in the garbage drop point information group set by using the information of each garbage drop point in the garbage drop point information group to obtain the garbage transfer station information set, the method further includes: According to the grouping of each garbage disposal point information in the garbage disposal point information group, the historical collection and transportation data set is grouped to obtain a historical collection and transportation data group sequence.

4. The method according to claim 3, wherein: In response to receiving the newly established garbage disposal point information, adding the newly established garbage disposal point information to the garbage disposal point information group in the garbage disposal point information group set includes: For each garbage drop point information group in the garbage drop point information group set, the following processing sub-steps are performed: Determine the garbage transfer station location information corresponding to the garbage placement point information group as the target garbage transfer station location information; Determine a second reference distance value by using the location information in the newly established garbage placement point information and the location information of the target garbage transfer station; In response to determining that the second reference distance value is less than or equal to a preset distance value, determining the target garbage transfer station location information as the garbage transfer station location information to be selected; Summing the garbage collection and transportation volumes in each of the historical collection and transportation data corresponding to the historical collection and transportation data set and the location information of the to-be-selected garbage transfer station to obtain the sum of the garbage collection and transportation volumes; The newly established garbage disposal point information is added to the garbage disposal point information group in the garbage disposal point information group set that meets the preset joining condition, wherein the preset joining condition is that the garbage disposal point information group is the garbage disposal point information corresponding to the smallest sum of the garbage collection and transportation volumes among the sums of the various garbage collection and transportation volumes.

5. The method according to claim 4, wherein: For each garbage drop point information group in the garbage drop point information group set, the garbage transfer station information is determined using the information of each garbage drop point in the garbage drop point information group to obtain the garbage transfer station information set, including: Determine the historical collection and transportation data corresponding to each garbage disposal point information in the garbage disposal point information group as the target historical collection and transportation data, and obtain a target historical collection and transportation data set; Summing the garbage collection and transportation volumes in the target historical collection and transportation data set to obtain the sum of the target garbage collection and transportation volumes; The number of garbage collection and transportation in each target historical collection and transportation data set is summed to obtain the target number of garbage collection and transportation; The product value of the sum of the target garbage collection and transportation volume and the first expansion coefficient is determined as the expanded standard garbage collection and transportation volume; The product value of the sum of the target garbage collection and transportation times and the second expansion coefficient is determined as the expanded garbage collection and transportation times; The ratio of the expanded standard garbage collection and transportation volume to the preset per capita processing volume is rounded up to obtain the number of personnel configurations; The ratio of the number of times the bulky garbage is collected and transported to the preset number of times per vehicle is rounded up to obtain the number of vehicle configurations.

6. The method according to claim 5, wherein: The control and display terminal visually displays the garbage placement point information group set and the location information of each garbage transfer station, including: Displaying the location of the garbage disposal point represented by each garbage disposal point information in the garbage disposal point information group set in the electronic map in the display terminal; The location information of each garbage transfer station is displayed on the electronic map in the display terminal.

7. A garbage transfer station site selection device based on garbage delivery points, comprising: an acquisition unit, configured to acquire basic information and historical collection and transportation data of existing garbage disposal points, and obtain a garbage disposal point information set and a historical collection and transportation data set, wherein the garbage disposal point information in the garbage disposal point information set includes: garbage disposal point identification, location information, disposal point type and loading volume, and the historical collection and transportation data in the historical collection and transportation data set includes: garbage disposal point identification, garbage collection and transportation volume and garbage collection and transportation times, and each historical collection and transportation data in the historical collection and transportation data set corresponds to the same historical time period; a grouping unit configured to group the garbage disposal point information set based on the garbage disposal point information set and the historical collection and transportation data set to obtain a garbage disposal point information group set; The determining unit is configured to determine the garbage transfer station information for each garbage drop point information group in the garbage drop point information group set by using the information of each garbage drop point in the garbage drop point information group to obtain a garbage transfer station information set, wherein the garbage transfer station information in the garbage transfer station information set includes: a garbage transfer station identifier, location information, a number of personnel configurations, and a number of vehicle configurations; an adding unit, configured to, in response to receiving the newly established garbage disposal point information, add the newly established garbage disposal point information to the garbage disposal point information group in the garbage disposal point information group set; The display unit is configured to control the display terminal to visually display the garbage delivery point information group set and the location information of each garbage transfer station.

8. An electronic device, comprising: one or more processors; a storage device having one or more programs stored thereon, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 6.

9. A computer readable medium having a computer program stored thereon, wherein: When the program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

Images