Scheduling method, device, electronic device, and storage medium

Abstract

The present invention provides a scheduling method, device, electronic device, and storage medium, wherein the method comprises: determining a commonly used route for each garbage truck from its historical driving routes; optimizing the transfer stations in the commonly used routes based on the distances from collection points adjacent to the transfer stations in the routes to each preset transfer station, thereby obtaining a planned route; determining a scheduling route for each garbage truck based on the daily transportation cost of the planned route for each garbage truck, and scheduling the garbage trucks based on the scheduling route. This method optimizes the driving routes of each garbage truck by analyzing its historical driving routes and combining them with its daily transportation cost, thereby reducing the daily transportation cost of each garbage truck and minimizing resource waste.

Description

Technical Field

[0001] The present invention relates to the field of Internet technology, and in particular to a scheduling method, device, electronic device and storage medium. Background Art

[0002] At present, the dispatch of garbage trucks in cities is mainly carried out in real-time, that is, the route of each garbage truck is dynamically adjusted according to the real-time status of the transfer station on the route of each garbage truck.

[0003] However, this scheduling method is based on the real-time transportation status of a single garbage truck. It is impossible to conduct big data analysis on the common routes of each garbage truck based on its historical driving routes, and thus it is impossible to optimize the routes of each garbage truck based on its historical driving routes, resulting in high total transportation costs for urban garbage and waste of resources. Summary of the Invention

[0004] The present invention provides a scheduling method, device, electronic device and storage medium to solve the defect in the prior art that each garbage truck cannot be coordinated and scheduled from the perspective of the city as a whole, resulting in high total transportation cost of urban garbage.

[0005] The present invention provides a scheduling method, comprising:

[0006] Determine the common routes of each garbage truck from its historical driving routes;

[0007] Optimizing the transfer stations in the commonly used routes based on the distances from the collection points adjacent to the transfer stations in the routes to the preset transfer stations to obtain a planned route;

[0008] Based on the daily transportation cost of the planned route of each garbage truck, a dispatching route of each garbage truck is determined, and the garbage truck is dispatched based on the dispatching route.

[0009] According to a scheduling method provided by the present invention, determining the scheduling routes of each garbage truck based on the daily transportation cost of the planned routes of each garbage truck includes:

[0010] Determining a first planning scheme based on the daily transportation cost of each planned route of the garbage truck;

[0011] If there are excess routes in the first planning scheme that contain transfer stations that exceed the maximum daily processing capacity, the first planning scheme is optimized with the constraint that the planned processing capacity of each preset transfer station is less than the maximum daily processing capacity to obtain a second planning scheme; and the second planning scheme is applied to determine the scheduling route of each garbage truck.

[0012] According to a scheduling method provided by the present invention, the first planning scheme is optimized to obtain a second planning scheme with the planned processing capacity of each preset transfer station being less than the daily maximum processing capacity as a constraint condition, including:

[0013] determining excess routes in the first planning scheme;

[0014] The planned processing capacity of each preset transfer station is less than the maximum daily processing capacity, and the excess transfer stations in the excess route are optimized in an iterative manner to obtain an optimized route. The optimized route and the non-excess route in the first planning scheme are applied to determine the optimization scheme; the iterative method is to iteratively distribute the excess garbage of the excess transfer station to the non-excess transfer stations with a distance from the excess transfer station from closest to farthest, until all the excess garbage is distributed and the iteration is completed;

[0015] The second planning scheme is determined based on the total daily transportation cost and the preset transportation cost of each scheme in the optimization scheme.

[0016] According to a scheduling method provided by the present invention, the total daily transportation cost of each scheme in the optimization scheme is determined based on the total transportation cost of each garbage truck and the transfer cost of each preset transfer station; the transfer cost of each preset transfer station is determined based on the garbage conversion rate corresponding to each preset transfer station and the distance to the garbage disposal site.

[0017] According to a scheduling method provided by the present invention, the excess routes in the first planning scheme are determined based on the following steps:

[0018] Based on the first planning scheme, determining the total number of daily train trips corresponding to each preset transfer station;

[0019] Determine the planned handling capacity corresponding to each preset transfer station based on the total number of daily trips corresponding to each preset transfer station and the average load of each trip;

[0020] Based on the planned processing volume corresponding to each preset transfer station and the daily maximum processing volume corresponding to each preset transfer station, and the first planning scheme, the excess route in the first planning scheme is determined.

[0021] According to a scheduling method provided by the present invention, the transfer stations in the commonly used routes are optimized based on the distances from the collection points adjacent to the transfer stations in the routes to the preset transfer stations to obtain a planned route, including:

[0022] Determine the current transfer station for any of each garbage truck's common routes;

[0023] Based on the distance between the collection point adjacent to the current transfer station of any route and each preset transfer station, determine the transfer station closest to the collection point adjacent to the current transfer station of any route, and use the transfer station closest to replace the current transfer station of any route, and use the transfer station next to the current transfer station of any route as the current transfer station of any route, until all transfer stations of any route are replaced, thereby obtaining a planned route corresponding to any route;

[0024] The planned route of each garbage truck is determined based on the planned route corresponding to each route in the common route of each garbage truck.

[0025] According to a scheduling method provided by the present invention, determining the common routes of each garbage truck from the historical driving routes of each garbage truck includes:

[0026] Determining overlapping routes in the historical driving routes of any garbage truck based on the collection points in the historical driving routes of the garbage truck; an overlapping route means that the proportion of the same collection points in two driving routes to the total number of collection points in the two driving routes is greater than a preset threshold, and the two driving routes are overlapping routes;

[0027] Based on the number of routes in the overlapping routes, a common route of any garbage truck is determined.

[0028] The present invention also provides a scheduling device, comprising:

[0029] A common route determination module is used to determine the common routes of each garbage truck from its historical driving routes;

[0030] a planned route determination module, configured to optimize the transfer stations in the commonly used routes based on the distances from the collection points adjacent to the transfer stations in the routes to the preset transfer stations, to obtain a planned route;

[0031] The scheduling module is used to determine the scheduling route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and to schedule the garbage truck based on the scheduling route.

[0032] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements any of the above-described scheduling methods when executing the program.

[0033] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which implements any of the scheduling methods described above when executed by a processor.

[0034] The present invention also provides a computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the computer program implements any of the above-mentioned scheduling methods.

[0035] The scheduling method, device, electronic device and storage medium provided by the present invention obtain the commonly used routes of each garbage truck from the historical driving routes of each garbage truck, and optimize the commonly used routes of each garbage truck according to the distance from the adjacent collection points of the transfer station to each preset transfer point in the commonly used routes to obtain the planned routes of each garbage truck, and then calculate the daily transportation cost of the planned routes of each garbage truck, determine the scheduling routes of each garbage truck, and schedule each garbage truck based on the scheduling routes of each garbage truck. This realizes the optimization of the driving routes of each garbage truck by analyzing the historical driving routes of each garbage truck and combining the daily transportation costs of each garbage truck, thereby reducing the daily transportation costs of each garbage truck and reducing the waste of resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] In order to more clearly illustrate the technical solutions in the present invention or the prior art, a brief introduction is given below to the drawings required for use in the embodiments or the description of the prior art. 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 any creative work.

[0037] Figure 1 This is one of the flow charts of the scheduling method provided by the present invention;

[0038] Figure 2 It is a flowchart of the method for obtaining a dispatch route provided by the present invention;

[0039] Figure 3 1 is a flow chart of a first planning scheme optimization method provided by an embodiment of the present invention;

[0040] Figure 4 1 is a flow chart of a method for determining excess routes in the first planning scheme provided by the present invention;

[0041] Figure 5 It is a flowchart of the method for obtaining a planned route provided by the present invention;

[0042] Figure 6 It is a flowchart of a commonly used route acquisition method provided by the present invention;

[0043] Figure 7 This is the second flow chart of the scheduling method provided by the present invention;

[0044] Figure 8 It is a structural diagram of the scheduling device provided by the present invention;

[0045] Figure 9 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION

[0046] To make the objectives, technical solutions, and advantages of the present invention more clear, the technical solutions of the present invention will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the embodiments described are only some of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts shall fall within the scope of protection of the present invention.

[0047] At present, the scheduling of garbage trucks in cities is based on the real-time status of the transfer stations on the routes of each garbage truck, and the route of each vehicle is dynamically adjusted. For example: if the transfer station A in the current route of the garbage truck exceeds its maximum processing capacity, the system will automatically plan the route based on the current status of transfer station A, the transfer station B closest to transfer station A that does not exceed the capacity, the collection point after transfer station A in the existing route, and the subsequent transfer stations to adjust the subsequent route of the current garbage truck.

[0048] However, this scheduling method is to adjust and schedule each garbage truck in real time according to the collection status, and it is impossible to coordinate and schedule each garbage truck from the overall perspective of the city, resulting in high total transportation costs for urban garbage and waste of resources.

[0049] Therefore, how to coordinate and dispatch each garbage truck from the perspective of the city as a whole to reduce the total transportation cost is a technical problem that needs to be solved urgently in this field.

[0050] In response to the above technical problems, an embodiment of the present invention provides a scheduling method. Figure 1 This is one of the flow charts of the scheduling method provided by the present invention. Figure 1 As shown, the method includes:

[0051] Step 110, determining the common routes of each garbage truck from the historical driving routes of each garbage truck;

[0052] Considering that each garbage truck has a planned route or planned garbage collection points during urban garbage collection, that is, each garbage truck has a frequently used route, optimizing each garbage truck's frequently used route can reduce the city's total daily transportation costs. Therefore, the embodiment of the present invention determines each garbage truck's frequently used route from its historical driving routes.

[0053] It should be noted that the commonly used routes of each garbage truck can be derived based on the overlap rate of each location information reporting point in the garbage truck's historical driving route, or can also be derived based on the overlap rate of collection points in the route, which is not limited in this embodiment of the present invention. Among them, commonly used routes include multiple historical driving routes with similar or identical trajectories. Positioning information can be obtained through GPS positioning or Beidou satellite positioning, which is not limited in this embodiment of the present invention.

[0054] Step 120 , optimizing the transfer stations in the commonly used routes based on the distances from the collection points adjacent to the transfer stations in the routes to the preset transfer stations, to obtain a planned route;

[0055] Step 130 : determining a dispatch route for each garbage truck based on the daily transportation cost of the planned route of each garbage truck; and dispatching the garbage truck based on the dispatch route.

[0056] Taking into account that the transfer stations in commonly used routes are not necessarily the optimal transfer stations, for example, the collection points of each route in the commonly used trajectory of each vehicle are the same, but the transfer stations in each route are different. Non-optimal transfer stations will cause the garbage truck's route to become longer, thereby increasing transportation costs. At the same time, considering that the conversion cost of garbage conversion at each garbage transfer station in the city will also affect the total daily transportation cost, the embodiment of the present invention optimizes the transfer stations in commonly used routes to reduce the transportation cost of each route in the commonly used video.

[0057] Specifically, the order in which garbage trucks pass through the collection points or transfer stations in each route of the regular routes is used to determine the collection points adjacent to the transfer stations in each route, and the distances from the collection points adjacent to the transfer stations in each route to the preset transfer stations are used to optimize the transfer stations in each route of the commonly used routes to obtain the planned routes of each garbage truck. Then, the scheduling routes of each garbage truck are determined based on the daily transportation costs of the planned routes of each garbage truck. Finally, each garbage truck is scheduled according to the scheduling routes of each garbage truck.

[0058] It should be noted that the transfer stations in each route of the commonly used routes are optimized by the distances from the adjacent collection points of the transfer stations in each route to the preset transfer stations. The planned route can be obtained by replacing the transfer stations corresponding to one or two collection points adjacent to the transfer station in the route with the transfer station with the smallest distance to each preset transfer station, thereby completing the optimization of the transfer stations corresponding to the two collection points in the route and obtaining the planned route corresponding to the route. It can also be obtained by determining the transfer station with the smallest cost to replace the transfer stations corresponding to the two collection points in the route based on the distances from the adjacent collection points of the transfer station in each route to one or two adjacent collection points to each preset transfer station, and combining the conversion costs of garbage conversion at these transfer stations. The optimization of the transfer stations corresponding to the two collection points in the route is completed and the planned route corresponding to the route is obtained. The embodiments of the present invention do not impose any restrictions on this.

[0059] In addition, the dispatching route of each garbage truck can be determined by the daily transportation cost of the planned route of each garbage truck. The total daily transportation cost of each route in the planned route corresponding to each garbage truck can be calculated, and the planned route with the lowest total daily transportation cost of each garbage truck can be directly used as the dispatching route of each garbage truck. After obtaining the planned route with the lowest total daily transportation cost of each garbage truck, the transfer stations in the planned route that exceed the daily maximum processing capacity can be replaced and adjusted based on the daily maximum processing capacity of the transfer stations in the planned route to obtain the dispatching route of each garbage truck. The embodiment of the present invention does not impose any restrictions on this.

[0060] The scheduling method provided by the embodiment of the present invention obtains the commonly used route of each garbage truck from the historical driving route of each garbage truck, and optimizes the commonly used route of each garbage truck according to the distance from the adjacent collection point of the transfer station to each preset transfer point in the commonly used route to obtain the planned route of each garbage truck, and then calculates the daily transportation cost of the planned route of each garbage truck, determines the scheduling route of each garbage truck, and schedules each garbage truck based on the scheduling route of each garbage truck. By analyzing the historical driving route of each garbage truck and combining the daily transportation cost of each garbage truck, the driving route of each garbage truck is optimized, thereby reducing the daily transportation cost of each garbage truck and reducing the waste of resources.

[0061] Based on the above embodiments, Figure 2 FIG. 1 is a flow chart of the method for obtaining a dispatching route provided by the present invention. Figure 2 As shown, in step 120, the dispatching route of each garbage truck is determined based on the daily transportation cost of the planned route of each garbage truck, including:

[0062] Step 210 , determining a first planning scheme based on the daily transportation cost of each garbage truck's planned route;

[0063] Step 220: If there are excess routes in the first planning scheme that contain transfer stations that exceed the maximum daily processing capacity, the first planning scheme is optimized with the planned processing capacity of each preset transfer station being less than the maximum daily processing capacity as a constraint condition to obtain a second planning scheme; and the second planning scheme is applied to determine the scheduling routes of each garbage truck.

[0064] Taking into account the lowest cost planned route with the lowest daily transportation cost corresponding to each garbage truck obtained according to the daily transportation cost of the planned route of each garbage truck, it is possible that the lowest cost planned route corresponding to each garbage truck may have the same transfer station planned and used for multiple lowest cost planned routes. Since each transfer station has its maximum daily processing capacity, there may be a situation where the transfer station used by multiple lowest cost planned routes is exceeded, that is, the total amount of garbage received by the transfer station every day is greater than the maximum daily processing capacity. In this way, the transfer station cannot receive the garbage due to the excess, resulting in garbage transfer, and the total daily garbage transportation cost of the city will still increase. Therefore, the embodiment of the present invention performs big data analysis on the lowest cost planned route with the lowest daily transportation cost corresponding to each garbage truck, and comprehensively adjusts the routes with excess transfer stations in the lowest cost planned routes, so that the transfer stations in the planned routes of each garbage truck can operate normally without excess.

[0065] Specifically, based on the daily transportation cost of the planned route of each garbage truck, the lowest cost planned route with the lowest daily transportation cost corresponding to each garbage truck is obtained, and the lowest cost planned routes of each garbage truck are combined into a first planning scheme. According to the daily maximum processing capacity of each preset transfer station, it is judged whether there are excess transfer stations in each route of the first planning scheme. If there are excess routes containing transfer stations that exceed the daily maximum processing capacity in each planned route in the first planning scheme, the planned processing capacity of each preset transfer station is less than the daily maximum processing capacity. The first planning scheme is optimized with the constraint condition that the planned processing capacity of each preset transfer station is less than the daily maximum processing capacity to obtain a second planning scheme. According to each planned route in the second planning scheme, the scheduling route of each garbage truck is determined.

[0066] It should be noted that, with the planned processing capacity of each preset transfer station being less than the maximum daily processing capacity as a constraint condition, the first planning scheme can be optimized by enumerating all optimized routes of each excess route based on the excess transfer stations in each excess route of the first planning scheme and the non-excess transfer stations in each preset transfer station through big data calculation, and combining all optimized routes of each enumerated excess route and the non-excess routes in the first planning scheme into optimization schemes, and then determining the second planning scheme based on the total transportation cost and the preset transportation cost of each optimization scheme. The first planning scheme can also be optimized by iteratively searching for the nearest non-excess transfer station based on the nearest excess transfer station in each excess route of the first planning scheme using big data until the optimization of all excess routes is completed, and combining all optimized routes of each excess route and the non-excess routes in the first planning scheme into optimization schemes, and then determining the second planning scheme based on the total transportation cost and the preset transportation cost of each optimization scheme. The embodiment of the present invention does not limit this.

[0067] Furthermore, if none of the planned routes in the first plan include any excess routes, the first plan will be used directly as the second plan to determine the dispatch routes for each garbage truck. Alternatively, if all of the planned routes in the first plan include any excess transfer stations, an alert will be issued, indicating that the city's daily waste generation exceeds the maximum processing capacity of the city's waste transfer stations and that a new transfer station is needed. This provides a more intuitive and timely reminder to the planning department, mitigating the deterioration of the urban environment and the increase in total daily waste collection costs caused by the city's daily waste generation exceeding the maximum processing capacity of the city's waste transfer stations.

[0068] The scheduling method provided by the embodiment of the present invention optimizes the excess transfer stations in the route by determining the first planning scheme based on the planned route with the lowest daily transportation cost of each garbage truck, thereby achieving the overall optimization of the scheduling route scheme of each garbage truck from the perspective of the entire city, further reducing the total daily garbage transportation cost of the city and reducing the waste of resources.

[0069] Based on the above embodiments, Figure 3 This is a flow chart of the first planning scheme optimization method provided by the embodiment of the present invention. Figure 3 As shown, in step 220, the first planning scheme is optimized with the planned processing capacity of each preset transfer station being less than the daily maximum processing capacity as a constraint condition to obtain a second planning scheme, including:

[0070] Step 310, determining excess routes in the first planning scheme;

[0071] Step 320: Taking the planned processing volume of each preset transfer station being less than the daily maximum processing volume as a constraint condition, iteratively optimize the overloaded transfer stations in the overloaded routes to obtain optimized routes, and apply the optimized routes and the non-overloaded routes in the first planning scheme to determine an optimized scheme; the iterative method is to iteratively allocate the overloaded part of the garbage of the overloaded transfer station to the non-overloaded transfer stations in ascending order of the distance from the overloaded transfer station until the iterative process is completed after all the overloaded part of the garbage is allocated;

[0072] Step 330: Based on the daily transportation total cost and the preset transportation cost of each scheme in the optimized scheme, determine the second planning scheme. <00​​​​​​Based on the above embodiment, the total daily transportation cost of each optimization scheme in step 320 is determined based on the total transportation cost of each garbage truck and the transfer cost of each preset transfer station; the transfer cost of each preset transfer station is determined based on the garbage conversion rate corresponding to each preset transfer station and the distance to the garbage disposal site. The garbage conversion rate corresponding to the transfer station represents the proportion of garbage that is transferred to the garbage disposal site after being processed by the transfer station itself. For example, if the transfer station receives 100 tons of garbage daily, processes 20 tons through combustion, dissolution, etc., and transfers the remaining 80 tons of garbage to the garbage disposal plant, then the garbage conversion rate of the transfer station is 80%.

[0076] Preferably, assume that a garbage truck's route is from the parking lot to the collection point to the transfer station a1, with the total length of this route being s1. From the transfer station a1, it passes through the collection point to the transfer station a2, with the total length of this route being s2. From the transfer station a2 to the parking lot, the total length of this route being s3. The total daily transportation cost of the garbage truck is calculated using the following formula:

[0077] f=k*p*(s1+s2+s3)+q*k*p*(l1+l2)

[0078] Where k represents the fuel consumption per kilometer of the garbage truck, p represents the unit price of fuel, the garbage conversion rate of the garbage transfer station is q, l1 represents the total length of the route from transfer station a1 to its nearest garbage disposal plant, and l2 represents the total length of the route from transfer station a2 to its nearest garbage disposal plant.

[0079] Based on the above embodiments, Figure 4 FIG. 1 is a flow chart of the method for determining excess routes in the first planning scheme provided by the present invention. Figure 4 As shown, the method includes:

[0080] Step 410: Determine the total number of daily trips corresponding to each preset transfer station based on the first planning scheme;

[0081] Step 420 , determining the planned handling capacity corresponding to each preset transfer station based on the total number of daily trips corresponding to each preset transfer station and the average load of each trip;

[0082] Step 430 : Based on the planned throughput corresponding to each preset transfer station and the daily maximum throughput corresponding to each preset transfer station, and the first planning scheme, determine the excess routes in the first planning scheme.

[0083] Specifically, according to the number of transfer stations used by each route in the first planning scheme, the total number of daily trips corresponding to each preset transfer station is determined; the total number of daily trips of each preset transfer station and the average garbage load of each trip are multiplied to obtain the planned processing capacity corresponding to each preset transfer station, and then the excess transfer stations are determined according to the planned processing capacity corresponding to each preset transfer station and the daily maximum processing capacity corresponding to each preset transfer station. The routes containing excess transfer stations are screened out from the first planning scheme, which are the excess routes in the first planning scheme.

[0084] Based on the above embodiments, Figure 5 This is a flow chart of the method for obtaining a planned route provided by the present invention. Figure 5 As shown, step 120 includes:

[0085] Step 121, determining the current transfer station of any of the common routes of each garbage truck;

[0086] Step 122: Based on the distances between the collection points adjacent to the current transfer station of the route and each preset transfer station, determine the transfer station closest to the collection point adjacent to the current transfer station of the route, and use the transfer station closest to replace the current transfer station of the route. The next transfer station after the current transfer station of the route is used as the current transfer station of the route until all transfer stations of the route are replaced, thereby obtaining a planned route corresponding to the route.

[0087] Step 123 : determining the planned route of each garbage truck based on the planned route corresponding to each of the commonly used routes of each garbage truck.

[0088] Specifically, any route in the commonly used routes is optimized in sequence of the transfer stations along the route from the starting point to the end point, and the first transfer station along the route is taken as the current transfer station. The distance from one or two collection points adjacent to the current transfer station to each preset transfer station is calculated to obtain the transfer station closest to the route, and the calculated transfer station is used to replace the current transfer station of the route, and the next transfer station along the route after the current transfer station of the route is taken as the current transfer station of the route. The above operation is performed until the last transfer station along the route is replaced, that is, the planned route corresponding to the changed route is obtained, and then each route in the commonly used routes of each garbage truck is optimized based on the optimization logic of the above routes to obtain the planned route corresponding to each route in the commonly used routes of each garbage truck, and the planned route of each garbage truck is determined according to the planned route corresponding to each route in the commonly used routes of each garbage truck.

[0089] It should be noted that the optimization process of any of the above routes can be further illustrated by the following example. For example, a route in a commonly used route passes through parking lot t1, collection point s1, collection point s2, transfer station z1, collection point s3, collection point s4, collection point s5, transfer station z2, and parking lot t2 in sequence. The transfer station z1 is first taken as the current transfer station, and the distances between the collection points s2 and s3 adjacent to the current transfer station and each preset transfer station are calculated respectively. The sum of the distances from each preset transfer station to the collection points s2 and s3 is calculated to obtain the transfer station z1' with the closest distance, and z1' is replaced by z1. The above operation is then performed with the next transfer station z2 of the current transfer station as the current transfer station, that is, the distance from the collection point s5 adjacent to the current transfer station to each preset transfer station is calculated to obtain the transfer station z2' with the closest distance, and z2' is replaced by z2. Since there is no transfer station in the subsequent route of this route, the optimization of this route is completed to obtain the planned route corresponding to this route.

[0090] Based on the above embodiments, Figure 6 This is a flow chart of the commonly used route acquisition method provided by the present invention. Figure 6 As shown, step 110 includes:

[0091] Step 111: determining overlapping routes in any garbage truck's historical driving routes based on the collection points in the historical driving routes of the garbage truck; overlapping routes mean that two driving routes are overlapping if the proportion of the same collection points in the total number of collection points in the two driving routes is greater than a preset threshold;

[0092] Step 112 : determining the common routes of the garbage truck based on the number of routes in each overlapping route.

[0093] Specifically, if the proportion of the same collection points in two driving routes to the total number of collection points in the two driving routes is greater than a preset threshold, the two driving routes are overlapping routes. Based on the above-mentioned method for judging overlapping routes, the overlapping routes in the historical trajectory of any garbage truck are determined, and the overlapping route with the largest number of routes among the overlapping routes of the garbage truck is used as the commonly used route of the garbage truck.

[0094] Figure 7 This is the second flow chart of the scheduling method provided by the present invention. Figure 7 As shown, the scheduling method provided by the embodiment of the present invention includes:

[0095] In the first step, any two routes with the same collection points exceeding 80% of the total collection points in the historical driving routes of each garbage truck are considered as overlapping routes. Combined with big data statistical analysis, the routes with the largest number of overlapping routes (highest frequency) and their route mileage can be obtained, thereby obtaining the commonly used routes of each garbage truck. Combined with the preset transfer stations, the transfer stations in the original commonly used routes are replaced in turn to perform optimal planning. Specifically,

[0096] Assume that route combination 1 has m transfer stations, and each transfer station is replaced by the transfer station closest to the previous adjacent collection point and the next adjacent collection point (if the current transfer station is the closest, no replacement is performed). Then, for all replaced planned routes, the planned route with the lowest cost is obtained based on the daily transportation cost of the planned route.

[0097] The second step is to combine the lowest-cost planned routes for each garbage truck as the first planning scheme. At this time, set the average load capacity T (tons) for each trip, and count the number of daily collection trips C at each transfer station. The planned processing capacity of each transfer station is h = C * T. If there is no situation where the planned processing capacity is already greater than the maximum processing capacity m of the transfer station, then directly compare the total daily transportation cost of the first planning scheme with the preset cost. If it is less than the preset cost, the dispatching route of each garbage truck is obtained, and each garbage truck is dispatched according to the dispatching route of each garbage truck. If there is a situation where the planned processing capacity is already greater than the maximum processing capacity m of the transfer station, i represents the i-th transfer station, and the remaining total amount of the transfer stations that have not exceeded the capacity is calculated. The total number of excess transfer stations is If Hn is greater than hn, then all the garbage transfer stations in the city can no longer support the total amount of garbage generated in the city, and a new garbage transfer station is needed. If Hn is less than hn, the excess transfer stations are allocated iteratively. The specific iterative allocation rules are as follows:

[0098] A. Filter out all solutions with excess transfer stations.

[0099] B. Replace the overloaded transfer stations with the ones closest to them. The overloaded transfer station k has a handling capacity of Hk and a maximum handling capacity of Mk. The handling capacity of the underloaded transfer station m is Hm and a maximum handling capacity of Mm. The single transfer amount is ti. All solutions transfer trains a from transfer station k and transfer trains b to transfer station m. The total cost of the total solution after the transfer is ft. The iterative solution can be transformed into the constraints that must be satisfied, where n represents the number of transfer stations:

[0100] (1)Hk-a*ti≤Mk,k∈{1,2……n}

[0101] (2)Hm+b*ti≤Mm,m∈{1,2……n}

[0102] According to the above constraints, the optimization scheme is obtained after iterative allocation; and the optimization scheme with the minimum cost among the optimization schemes is obtained. If the optimization scheme with the minimum cost is less than the preset transportation cost, the optimization scheme with the minimum cost is used as the second planning scheme, and based on the planned routes in the second planning scheme, the scheduling routes of each garbage truck are determined, and then each garbage truck is scheduled according to the scheduling routes of each garbage truck.

[0103] The scheduling device provided by the present invention is described below. The scheduling device described below and the scheduling method described above can be referenced to each other.

[0104] Figure 8 This is a schematic diagram of the structure of the scheduling device provided by the present invention. Figure 8 As shown, the device includes: a common route determination module 810, a planned route determination module 820 and a scheduling module 830.

[0105] in,

[0106] Frequently used route determination module 810, for determining the frequently used routes of each garbage truck from its historical driving routes;

[0107] A planned route determination module 820 is configured to optimize the transfer stations in the commonly used routes based on the distances from the collection points adjacent to the transfer stations in the routes to the preset transfer stations, thereby obtaining a planned route;

[0108] The scheduling module 830 is used to determine the scheduling route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and schedule the garbage truck based on the scheduling route.

[0109] In an embodiment of the present invention, a commonly used route determination module is used to determine the commonly used route of each garbage truck from the historical driving route of each garbage truck; a planned route determination module is used to optimize the transfer stations in the commonly used route based on the distance from the collection point adjacent to the transfer station in the route to each preset transfer station, so as to obtain a planned route; a scheduling module is used to determine the scheduling route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and to schedule the garbage truck based on the scheduling route, thereby optimizing the driving route of each garbage truck by analyzing the historical driving route of each garbage truck and combining the daily transportation cost of each garbage truck, thereby reducing the daily transportation cost of each garbage truck and reducing the waste of resources.

[0110] Based on any of the above embodiments, the scheduling module 830 includes:

[0111] a planning scheme determination submodule, configured to determine a first planning scheme based on the daily transportation cost of the planned routes of each garbage truck;

[0112] The scheduling route determination submodule is used to optimize the first planning scheme to obtain a second planning scheme if there is an excess route containing a transfer station that exceeds the maximum daily processing capacity among the planned routes in the first planning scheme, with the planned processing capacity of each preset transfer station being less than the maximum daily processing capacity as a constraint condition; and apply the second planning scheme to determine the scheduling route of each garbage truck.

[0113] Based on any of the above embodiments, the scheduling route determination submodule includes:

[0114] Excess route determination submodule: determining the excess routes in the first planning scheme;

[0115] An iterative optimization submodule is used to iteratively optimize the excess transfer stations in the excess route, using the constraint that the planned processing capacity of each preset transfer station is less than the maximum daily processing capacity, to obtain an optimized route, and then apply the optimized route and the non-excess route in the first planning scheme to determine the optimization scheme; the iterative method is to iteratively allocate the excess garbage of the excess transfer station to the non-excess transfer stations with the largest distance from the excess transfer station from the nearest to the farthest, until all the excess garbage is allocated and the iteration is completed;

[0116] The planning scheme determination submodule is used to determine the second planning scheme based on the total daily transportation cost and the preset transportation cost of each scheme in the optimization scheme.

[0117] Based on any of the above embodiments, the planning scheme determination submodule includes:

[0118] The transportation cost calculation submodule is used to determine the total daily transportation cost of each plan in the optimization plan based on the total transportation cost of each garbage truck and the transfer cost of each preset transfer station;

[0119] The transfer cost calculation submodule is used to determine the transfer cost of each preset transfer station based on the garbage conversion rate corresponding to each preset transfer station and the distance to the garbage disposal site.

[0120] Based on any of the above embodiments, the excess route determination submodule includes:

[0121] The train number determination submodule is used to determine the total number of daily trains corresponding to each preset transfer station based on the first planning scheme;

[0122] A planned throughput determination submodule is used to determine the planned throughput corresponding to each preset transfer station based on the total number of daily trips corresponding to each preset transfer station and the average load of each trip;

[0123] The excess route determination submodule is configured to determine the excess routes in the first planning scheme based on the planned processing volume corresponding to each preset transfer station and the daily maximum processing volume corresponding to each preset transfer station, as well as the first planning scheme.

[0124] Based on any of the above embodiments, the planned route determination module 820 includes:

[0125] The current transfer station determination submodule is used to determine the current transfer station of any of the common routes of each garbage truck;

[0126] The common route optimization submodule is used to determine the transfer station closest to the collection point adjacent to the current transfer station of the route based on the distance between the collection point adjacent to the current transfer station of the route and each preset transfer station, and use the transfer station closest to replace the current transfer station of the route, and use the transfer station next to the current transfer station of the route as the current transfer station of the route until all transfer stations of the route are replaced, thereby obtaining the planned route corresponding to the route;

[0127] The planned route determination submodule is used to determine the planned route of each garbage truck based on the planned route corresponding to each route in the common routes of each garbage truck.

[0128] Based on any of the above embodiments, the common route determination module 810 includes:

[0129] The overlapping route determination submodule is used to determine the overlapping routes in the historical driving routes of any garbage truck based on the collection points in the historical driving routes of the garbage truck; overlapping routes mean that the proportion of the same collection points in the two driving routes to the total number of collection points in the two driving routes is greater than a preset threshold, and the two driving routes are overlapping routes;

[0130] The common route determination submodule is used to determine the common route of the garbage truck based on the number of routes in each overlapping route.

[0131] Figure 9 An example of a physical structure diagram of an electronic device is shown below. Figure 9As shown, the electronic device may include: a processor 910, a communication interface 920, a memory 930, and a communication bus 940, wherein the processor 910, the communication interface 920, and the memory 930 communicate with each other via the communication bus 940. The processor 910 may call logic instructions in the memory 930 to execute a scheduling method, which includes: determining a common route for each garbage truck from its historical driving routes; optimizing the transfer stations in the common routes based on the distances from collection points adjacent to the transfer stations in the common routes to each preset transfer station to obtain a planned route; determining a scheduling route for each garbage truck based on the daily transportation cost of the planned route for each garbage truck, and scheduling the garbage truck based on the scheduling route.

[0132] In addition, the logic instructions in the above-mentioned memory 930 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when sold or used as an independent product. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0133] On the other hand, the present invention also provides a computer program product, which includes a computer program, which can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the scheduling method provided by the above-mentioned methods, which includes: determining the commonly used routes of each garbage truck from the historical driving routes of each garbage truck; optimizing the transfer stations in the commonly used routes based on the distances from the collection points adjacent to the transfer stations in the routes to each preset transfer station to obtain a planned route; determining the scheduling route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and scheduling the garbage truck based on the scheduling route.

[0134] On the other hand, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, is implemented to execute the scheduling method provided by the above-mentioned methods, the method comprising: determining the commonly used routes of each garbage truck from the historical driving routes of each garbage truck; optimizing the transfer stations in the commonly used routes based on the distances from the collection points adjacent to the transfer stations in the routes to each preset transfer station to obtain a planned route; determining the scheduling route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and scheduling the garbage truck based on the scheduling route.

[0135] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, i.e., they may be located in one location or distributed across multiple network units. Some or all of the modules may be selected based on actual needs to achieve the objectives of the present embodiment. Persons of ordinary skill in the art will be able to understand and implement the present invention without inventive effort.

[0136] Through the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, or of course, by hardware. Based on this understanding, the essence of the above technical solution or the part that contributes to the existing technology can be embodied in the form of a software product. The computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a magnetic disk, an optical disk, etc., and includes a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or certain parts of the embodiments.

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

Claims

1. A scheduling method, characterized in that: include: Determine the common routes of each garbage truck from its historical driving routes; Optimizing the transfer stations in the commonly used routes based on the distances from the collection points adjacent to the transfer stations in the routes to the preset transfer stations to obtain a planned route; Determining a dispatch route for each garbage truck based on the daily transportation cost of the planned route for each garbage truck, and dispatching the garbage truck based on the dispatch route; Determining the common routes of each garbage truck from the historical driving routes of each garbage truck includes: Determining overlapping routes in the historical driving routes of any garbage truck based on the collection points in the historical driving routes of the garbage truck; an overlapping route means that the proportion of the same collection points in two driving routes to the total number of collection points in the two driving routes is greater than a preset threshold, and the two driving routes are overlapping routes; Based on the number of routes in the overlapping routes, a common route of any garbage truck is determined.

2. The scheduling method according to claim 1, characterized in that: The method of determining the dispatching route of each garbage truck based on the daily transportation cost of the planned route of each garbage truck includes: Determining a first planning scheme based on the daily transportation cost of each planned route of the garbage truck; If there are excess routes in the first planning scheme that contain transfer stations that exceed the maximum daily processing capacity, the first planning scheme is optimized with the constraint that the planned processing capacity of each preset transfer station is less than the maximum daily processing capacity to obtain a second planning scheme; and the second planning scheme is applied to determine the scheduling route of each garbage truck.

3. The scheduling method according to claim 2, characterized in that: The first planning scheme is optimized based on the constraint that the planned processing capacity of each preset transfer station is less than the daily maximum processing capacity to obtain the second planning scheme, including: determining excess routes in the first planning scheme; The planned processing capacity of each preset transfer station is less than the maximum daily processing capacity, and the excess transfer stations in the excess route are optimized in an iterative manner to obtain an optimized route. The optimized route and the non-excess route in the first planning scheme are applied to determine the optimization scheme; the iterative method is to iteratively distribute the excess garbage of the excess transfer station to the non-excess transfer stations with a distance from the excess transfer station from closest to farthest, until all the excess garbage is distributed and the iteration is completed; The second planning scheme is determined based on the total daily transportation cost and the preset transportation cost of each scheme in the optimization scheme.

4. The scheduling method according to claim 3, characterized in that: The total daily transportation cost of each scheme in the optimization scheme is determined based on the total transportation cost of each garbage truck and the transfer cost of each preset transfer station; the transfer cost of each preset transfer station is determined based on the garbage conversion rate corresponding to each preset transfer station and the distance to the garbage disposal site.

5. The scheduling method according to claim 3, characterized in that: The excess routes in the first planning scheme are determined based on the following steps: Based on the first planning scheme, determining the total number of daily train trips corresponding to each preset transfer station; Determine the planned handling capacity corresponding to each preset transfer station based on the total number of daily trips corresponding to each preset transfer station and the average load of each trip; Based on the planned processing volume corresponding to each preset transfer station and the daily maximum processing volume corresponding to each preset transfer station, and the first planning scheme, the excess route in the first planning scheme is determined.

6. The scheduling method according to any one of claims 1 to 5, characterized in that: The step of optimizing the transfer stations in the commonly used routes based on the distances from the collection points adjacent to the transfer stations in the routes to the preset transfer stations to obtain the planned routes includes: Determine the current transfer station for any of each garbage truck's common routes; Based on the distance between the collection point adjacent to the current transfer station of any route and each preset transfer station, determine the transfer station closest to the collection point adjacent to the current transfer station of any route, and use the transfer station closest to replace the current transfer station of any route, and use the transfer station next to the current transfer station of any route as the current transfer station of any route, until all transfer stations of any route are replaced, thereby obtaining a planned route corresponding to any route; The planned route of each garbage truck is determined based on the planned route corresponding to each route in the common route of each garbage truck.

7. A scheduling device, characterized in that: include: A common route determination module is used to determine the common routes of each garbage truck from its historical driving routes; a planned route determination module, configured to optimize the transfer stations in the commonly used route based on the distances from the collection points adjacent to the transfer stations in the route to the preset transfer stations, to obtain a planned route; a scheduling module, configured to determine a scheduling route for each garbage truck based on the daily transportation cost of the planned route of each garbage truck, and to schedule the garbage truck based on the scheduling route; Determining the common routes of each garbage truck from the historical driving routes of each garbage truck includes: Determining overlapping routes in the historical driving routes of any garbage truck based on the collection points in the historical driving routes of the garbage truck; an overlapping route means that the proportion of the same collection points in two driving routes to the total number of collection points in the two driving routes is greater than a preset threshold, and the two driving routes are overlapping routes; Based on the number of routes in the overlapping routes, a common route of any garbage truck is determined.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the scheduling method according to any one of claims 1 to 6 is implemented.

9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the scheduling method according to any one of claims 1 to 6 is implemented.

Images