Urban road cleaning planning method and device

By using window sliding method and traffic congestion index to optimize cleaning time sheets in urban road cleaning, the problem of unreasonable cleaning time in the existing technology is solved, and the cleaning efficiency and traffic impact are improved.

CN114943457BActive Publication Date: 2024-12-03浪潮智慧城市科技有限公司
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202210616944.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-06-01
Publication Date
2024-12-03
Estimated Expiration
2042-06-01

AI Technical Summary

Technical Problem

The planning of existing urban road cleaning work mainly relies on experience, resulting in unreasonable cleaning time, affecting traffic and inefficient efficiency.

Method used

By dividing the day into multiple time periods, using the window sliding method to create a cleaning operation fitness model, combining traffic congestion index data, the shortest path algorithm is used to optimize the selection of cleaning time slices to form the optimal cleaning solution.

Benefits of technology

A more reasonable cleaning time arrangement has been achieved, traffic impact and resource consumption have been reduced, and cleaning efficiency has been improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114943457B_ABST
    Figure CN114943457B_ABST
Patent Text Reader

Abstract

Assuming that the number of cleaning operations in a day is n and the duration of the cleaning operation is s, firstly, the time of a day is divided into n time periods according to the number of urban road cleaning times n, and for each of the time periods, each of the time periods is divided into multiple time slices by window sliding, and a cleaning operation fitness model is created to obtain the fitness evaluation of each cleaning operation of the time; wherein, the size of the time slice is the duration of the cleaning time t, and then a time period is selected in each large time period with the minimum duration w of two road cleaning times as a constraint, and finally a time slice set with the highest comprehensive fitness is obtained, that is, the optimal solution for the road cleaning operation planning in a day. Compared with the prior art, the present invention is conducive to saving resources such as vehicles and labor.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of computing models, and specifically provides a method and a device for urban road cleaning planning. Background Art

[0002] With the development of cities and the continuous improvement of people's requirements for quality of life, urban sanitation is becoming more and more important. Reasonable planning of road cleaning time can not only reduce the impact of road sweeping operations on traffic conditions, but also improve work efficiency.

[0003] The current cleaning mode of urban roads mainly stipulates the number of times cleaning is required per day, and through reasonable allocation, urban roads are kept as clean as possible. However, the current planning of cleaning work is mainly based on experience, which may lead to unreasonable cleaning time, resulting in greater impact on traffic and low cleaning efficiency. Summary of the invention

[0004] The present invention aims at the above-mentioned deficiencies of the prior art and provides a highly practical urban road cleaning planning method.

[0005] A further technical task of the present invention is to provide a method for urban road cleaning planning that is reasonably designed, safe and applicable.

[0006] The technical solution adopted by the present invention to solve its technical problem is:

[0007] A method for urban road cleaning planning, assuming that the number of cleaning operations in a day is n and the duration of the cleaning operation is s, firstly, according to the number of urban road cleaning times n, a day is divided into n time periods, for each of the time periods, each of the time periods is divided into multiple time slices by means of window sliding, and a cleaning operation fitness model is created to obtain the cleaning operation fitness evaluation of each of the time slices;

[0008] The size of the time slice is the duration of the cleaning time t. Then, the minimum duration w of two road cleaning times is used as a constraint. A time period is selected in each large time period, and finally a set of time slices with the highest overall fitness is obtained, which is the optimal plan for road cleaning operations in a day.

[0009] Furthermore, when creating a cleaning operation fitness model, first obtain the road traffic congestion index data set, divide the traffic congestion index according to time, remove the outliers in each time slice data set, and obtain the average traffic congestion index of each time slice.

[0010] Furthermore, the calculation steps of the average traffic congestion index are as follows:

[0011] (1) The traffic congestion indexes obtained at the same time slice every day in the past are combined into a set;

[0012] (2) Obtain the mean and variance of each set;

[0013] (3) Use the Laida criterion method to remove abnormal data;

[0014] (4) Recalculate the mean and variance;

[0015] (5) Determine the change between the average value and the previous value. If the change is less than a certain threshold, the current average value is the average traffic congestion index. Otherwise, execute step (3).

[0016] Furthermore, when calculating the average traffic congestion index, it will be divided into two types: working days and weekends. When selecting the optimal set of time slices later, the two types of working days and weekends will also be distinguished.

[0017] Furthermore, when selecting the optimal set, the traffic condition evaluation set of the day is obtained by time slices. Next, under the constraint of the minimum time interval between two cleanings, it is necessary to find a small time period from each time period as the cleaning task execution time, and each small time period is combined to form the optimal combination of the cleaning time planning for the whole day;

[0018] A fixed time slice is selected in each time period to obtain the optimal set with the smallest total number, so it is converted into a shortest path problem for solution.

[0019] Furthermore, when selecting the optimal road cleaning plan, it is necessary to select a time slice from each time period, first define a starting point and an end point, and regard each time period as a node that needs to be traveled. The average traffic congestion index of each time slice is the path size from the previous node to the current node. The time slice combination with the smallest sum can be regarded as the shortest path from the starting point to the end point.

[0020] Furthermore, the steps for selecting the optimal solution for planning road sweeping operations in a day are:

[0021] (1) Reading the average traffic congestion index data of the time slice;

[0022] (2) Convert the traffic congestion index into the path information of the shortest path;

[0023] (3) Traverse all paths and perform pruning operations on the directed graph according to the constraints to determine whether the time interval between each node is greater than the minimum time interval constraint. If so, keep the path; otherwise, delete the path.

[0024] (4) The Dijkstra algorithm is used to calculate the shortest path from the starting point to the end point. The set of time slices corresponding to the nodes passed by the path is the optimal solution for road cleaning planning.

[0025] An urban road cleaning planning device comprises: at least one memory and at least one processor;

[0026] The at least one memory is used to store a machine-readable program;

[0027] The at least one processor is used to call the machine-readable program to execute a method for planning urban road cleaning.

[0028] Compared with the prior art, the urban road cleaning planning method and device of the present invention have the following outstanding beneficial effects:

[0029] The present invention is beneficial to saving resources such as vehicles and manpower, and plans urban road cleaning schemes based on traffic congestion indexes, which is more reasonable than manually planning schemes based on experience, and is more conducive to improving the efficiency of cleaning operations.

[0030] Through more reasonable planning of road cleaning operations, the operation time can be effectively reduced, the impact of operating vehicles on traffic can be reduced, and it is more conducive to people's travel. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0032] Attached Figure 1 It is a schematic diagram of the shortest path model in the urban road cleaning planning method. DETAILED DESCRIPTION

[0033] In order to enable those skilled in the art to better understand the solution of the present invention, the present invention is further described in detail below in conjunction with specific implementation methods. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0034] A best embodiment is given below:

[0035] In the present embodiment, a method for planning urban road cleaning is firstly assumed that the number of cleaning operations required in a day is n and the duration of the cleaning operation is s.

[0036] According to the number of urban road sweeping times n, a day is divided into n large time periods. For each time period, each time period is divided into multiple time slices by window sliding, and a sweeping operation fitness model is created to obtain the sweeping operation fitness evaluation of each time slice, where the size of the time slice is the sweeping time duration t. Then, taking the minimum duration w of two road sweeping times as a constraint, a time period is selected in each large time period, and finally a set of time slices with the highest comprehensive fitness is obtained, which is the optimal solution for road sweeping operation planning in a day.

[0037] According to the number of road sweeping operations n, a day is divided into n time periods, and each time period is divided into multiple time slices using a time slice sliding method, and the start time of each time slice differs by five minutes.

[0038] In order to obtain a traffic congestion index that represents each time slice, this paper uses the road traffic congestion index dataset obtained every 30 seconds in the past year. First, the traffic congestion index is divided according to time. Since traffic conditions are affected by various random factors, in order to increase the accuracy of the results, it is necessary to remove the outliers in each time slice dataset first, and then obtain the average traffic congestion index of each time slice. The calculation steps are as follows:

[0039] (1) The traffic congestion indexes obtained at the same time slice every day in the past are combined into a set;

[0040] (2) Obtain the mean and variance of each set;

[0041] (3) Using the Laida criterion method (3δ criterion) to remove abnormal data;

[0042] (4) Recalculate the mean and variance;

[0043] (5) Determine the change between the average value and the previous one. If the change is less than 0.2, the current average value is the average traffic congestion index. Otherwise, execute step (3).

[0044] Since the road traffic conditions on weekdays and weekends are very different, we will divide the calculation of the average traffic congestion index into two types: weekdays and weekends. The subsequent selection of the optimal set of time slices will also distinguish between the two types of weekdays and weekends.

[0045] When selecting the optimal set, we obtained the traffic condition evaluation set for the day through time slices. Next, we need to find a small time period from each time period as the cleaning task execution time under the constraint of the minimum time interval between two cleanings, and each small time period combined is the optimal combination of the cleaning time planning for the whole day;

[0046] A fixed time slice is selected in each time period to obtain the optimal set with the smallest total number, so it is converted into a shortest path problem for solution.

[0047] When selecting the optimal road cleaning solution, we need to select a time slice from each time period. We can first define a starting point and an end point, and regard each time period as a node that needs to be traveled. The average traffic congestion index of each time slice is the size of the path from the previous node to the current node. Selecting the time slice combination with the smallest sum can be regarded as the shortest path from the starting point to the end point.

[0048] like Figure 1 As shown, T i is the i-th time period (i=1,2,...,n), t ij is the jth time slice in the i-th time period. The starting point of the path is t ij The size of the path is the average traffic congestion index of the jth time slice in the ith time period. The path size of the starting point start is 0. The shortest path from the starting point (start) to the end point (end) is solved, and the time interval between the nodes in the shortest path cannot be less than the minimum interval w. This paper uses the Dijkstra algorithm to solve the shortest path problem.

[0049] The steps to select the optimal solution for planning road sweeping operations in a day are:

[0050] (1) Reading the average traffic congestion index data of the time slice;

[0051] (2) Convert the traffic congestion index into the path information of the shortest path;

[0052] (3) Traverse all paths and perform pruning operations on the directed graph according to the constraints to determine whether the time interval between each node is greater than the minimum time interval constraint. If so, keep the path; otherwise, delete the path.

[0053] (4) The Dijkstra algorithm is used to calculate the shortest path from the starting point to the end point. The set of time slices corresponding to the nodes passed by the path is the optimal solution for road cleaning planning.

[0054] An urban road cleaning planning device comprises: at least one memory and at least one processor;

[0055] The at least one memory is used to store a machine-readable program;

[0056] The at least one processor is used to call the machine-readable program to execute a method for planning urban road cleaning.

[0057] The above-mentioned specific implementations are only specific cases of the present invention. The patent protection scope of the present invention includes but is not limited to the above-mentioned specific implementations. Any appropriate changes or substitutions made by any ordinary technician in the technical field that conform to the claims of the urban road cleaning planning method and device of the present invention shall fall within the patent protection scope of the present invention.

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

Claims

1. A method for urban road cleaning planning, characterized in that: Assuming that the number of cleaning operations in a day is n and the duration of cleaning operations is s, firstly, the time of a day is divided into n time periods according to the number of urban road cleaning times n, and for each of the time periods, each of the time periods is divided into multiple time slices by means of window sliding, and a cleaning operation fitness model is created to obtain the cleaning operation fitness evaluation of each time slice; The size of the time slice is the duration of the cleaning time t. Then, with the minimum duration w of two road cleaning times as a constraint, a time period is selected in each large time period, and finally the time slice set with the highest comprehensive fitness is obtained, that is, the optimal solution for road cleaning operation planning in a day. When creating the cleaning operation fitness model, first obtain the road traffic congestion index data set, divide the traffic congestion index according to time, remove the outliers in each time slice data set, and obtain the average traffic congestion index of each time slice; The calculation steps of the average traffic congestion index are as follows: (1) The traffic congestion indexes obtained at the same time slice every day in the past are combined into a set; (2) Obtain the mean and variance of each set; (3) Use the Laida criterion method to remove abnormal data; (4) Recalculate the mean and variance; (5) Determine the change between the average value and the previous one. If the change is less than a certain threshold, the current average value is the average traffic congestion index. Otherwise, execute step (3); When calculating the average traffic congestion index, it will be divided into two types: working days and rest days. When selecting the optimal set of time slices later, the two types of working days and rest days will also be distinguished. When selecting the optimal set, we obtained the traffic condition evaluation set for the day through time slices. Next, we need to find a small time period from each time period as the cleaning task execution time under the constraint of the minimum time interval between two cleanings, and each small time period combined is the optimal combination of the cleaning time planning for the whole day; In each time period, a fixed time slice is selected to obtain the optimal set with the smallest total number, which is then converted into the shortest path problem for solution; When selecting the optimal road cleaning solution, you need to select a time slice from each time period, first define a starting point and an end point, and regard each time period as a node that needs to be traveled. The average traffic congestion index of each time slice is the path size from the previous node to the current node. The time slice combination with the smallest sum is selected as the shortest path from the starting point to the end point. The steps to select the optimal solution for planning road sweeping operations in a day are: (1) Reading the average traffic congestion index data of the time slice; (2) Convert the traffic congestion index into the path information of the shortest path; (3) Traverse all paths and perform pruning operations on the directed graph according to the constraints to determine whether the time interval between each node is greater than the minimum time interval constraint. If so, keep the path; otherwise, delete the path. (4) The Dijkstra algorithm is used to calculate the shortest path from the starting point start to the end point end. The set of time slices corresponding to the nodes passed by the path is the optimal solution for road cleaning planning.

2. A city road cleaning planning device, characterized in that: include: at least one memory and at least one processor; The at least one memory is used to store a machine-readable program; The at least one processor is configured to call the machine-readable program to execute the method of claim 1.

Citation Information

Patent Citations

  • Automatic distribution method for municipal solid waste cleaning routes

    CN112611387A

  • Urban road cleaning vehicle path planning method and device

    CN113074745A