Garbage scheduling method and scheduling platform

Abstract

The invention provides a garbage scheduling method and a scheduling platform, and relates to the field of garbage scheduling. The method comprises the steps that a data acquisition interface acquires the current garbage amount of a garbage transfer station; the main scheduling node determines a first scheduling task based on the current garbage amount; the first scheduling task comprises at least one second scheduling task arranged in sequence; after the master scheduling node obtains the task load information of each slave scheduling node, the master scheduling node sends the first scheduling task to a target slave scheduling node meeting a preset node decision condition for execution; in the process of executing the first scheduling task by the target slave scheduling node, determining a current second scheduling task executed in sequence, executing the current second scheduling task in a corresponding executor of an execution domain corresponding to the target slave scheduling node, and updating the execution condition of the second scheduling task in an execution domain database; the garbage of the garbage transfer station can be intelligently supervised and dispatched, the operation cost is reduced, and the working efficiency is improved.

Description

Technical Field

[0001] This application relates to the field of garbage scheduling. Specifically, it relates to a garbage scheduling method and a scheduling platform. Background Art

[0002] Whether the garbage in the existing garbage transfer station is full needs to be checked by a special person and the dispatcher is informed by phone. The dispatcher calls the driver of the garbage transfer vehicle based on experience. After confirming that there is an idle driver, the dispatcher tells the corresponding driver the location of the garbage transfer station where the garbage needs to be transferred. After the driver arrives at the designated garbage transfer station, the garbage is transferred to the disposal site. The overall garbage transfer work process is very cumbersome, time-consuming and laborious, and the efficiency is low. Summary of the Invention

[0003] The purpose of the embodiments of this application is to provide a garbage scheduling method and a scheduling platform to solve the above problems existing in the prior art and improve the transfer efficiency of the garbage in the garbage transfer station.

[0004] In a first aspect, a garbage scheduling method is provided, which is applied to a scheduling platform. The scheduling platform includes a data acquisition interface, a garbage scheduling center and at least one execution domain; the garbage scheduling center includes a main scheduling node and multiple slave scheduling nodes, each slave scheduling node corresponds to an execution domain, and each execution domain includes multiple executors; the method may include:

[0005] The data acquisition interface acquires the current garbage volume of the garbage transfer station;

[0006] The main scheduling node determines a first scheduling task based on the current garbage volume; the first scheduling task includes at least one second scheduling task arranged in sequence;

[0007] After the main scheduling node acquires the task load information of each slave scheduling node, it sends the first scheduling task to a target slave scheduling node that meets the preset node decision condition for execution;

[0008] During the execution of the first scheduling task by the target slave scheduling node, it determines the current second scheduling task to be executed in sequence, and executes the current second scheduling task in the corresponding executor of the execution domain corresponding to the target slave scheduling node, and updates the execution status of the second scheduling task in the execution domain database; where each executor corresponds to a second scheduling task.

[0009] In a possible implementation, the at least one second scheduling task arranged in sequence includes a garbage scheduling task and a transfer scheduling task arranged in sequence.

[0010] In a possible implementation, if the current second scheduling task is a garbage scheduling task, then executing the current second scheduling task in the execution domain corresponding to the target slave scheduling node includes:

[0011] Matching the current garbage volume with the garbage transfer rule;

[0012] If the matching is successful, generating a garbage scheduling task for the current garbage volume;

[0013] Executing the garbage scheduling task in the execution domain corresponding to the target slave scheduling node.

[0014] In a possible implementation, if the current second scheduling task is a transfer scheduling task, then executing the current second scheduling task in the execution domain corresponding to the target slave scheduling node includes:

[0015] Determining the target vehicle type and the target number of garbage transfer vehicles according to the number of vehicles that the garbage transfer station can accommodate and the current garbage volume;

[0016] Determining a target group of garbage transfer vehicles that meet the target number and the target vehicle type among the currently available garbage transfer vehicles;

[0017] Executing the transfer scheduling task corresponding to the target group of garbage transfer vehicles in the execution domain corresponding to the target slave scheduling node.

[0018] In a possible implementation, the current garbage volume includes the weight and / or capacity of the garbage;

[0019] Determining the target vehicle type and the target number of garbage transfer vehicles according to the number of vehicles that the garbage transfer station can accommodate and the garbage volume includes:

[0020] Based on the road size of the garbage transfer station, determining at least one target vehicle type of the garbage transfer vehicle;

[0021] For any target vehicle type of the garbage transfer vehicle, virtually dividing the garbage in the garbage transfer station based on the maximum load and the maximum capacity of the corresponding garbage transfer vehicle to obtain at least one area;

[0022] Based on the number of the areas, determining an initial number;

[0023] Among multiple initial numbers, screening out the numbers that meet the number of vehicles that the garbage transfer station can accommodate to determine the target number.

[0024] In a possible implementation, after determining the target number, the method further includes:

[0025] Determine at least one transfer vehicle scheduling plan based on the correspondence between different target vehicle models of garbage transfer vehicles and the target quantities of different garbage transfer vehicles.

[0026] In one possible implementation, determining the target garbage transfer vehicles with the target quantity and the target vehicle model among the currently available garbage transfer vehicles includes:

[0027] According to at least one transfer vehicle scheduling plan, determine a group of target garbage transfer vehicles with the target quantity and the target vehicle model among the currently available garbage transfer vehicles, and generate at least one target transfer vehicle scheduling plan.

[0028] In one possible implementation, after generating at least one target transfer vehicle scheduling plan, the method further includes:

[0029] If there are multiple target transfer vehicle scheduling plans, for any one of the target transfer vehicle scheduling plans, use a preset model to process the attribute information of each target garbage transfer vehicle in the target transfer vehicle scheduling plan to determine the final transfer vehicle scheduling plan; the attribute information of the target garbage transfer vehicle includes: the distance from the garbage transfer station, the first historical average residence time at the garbage transfer station, the second historical average residence time at the disposal site after transfer, and the transfer cost.

[0030] In a second aspect, a garbage scheduling platform is provided. The scheduling platform includes a data acquisition interface, a garbage scheduling center, and at least one execution domain; the garbage scheduling center includes a main scheduling node and multiple slave scheduling nodes, each slave scheduling node corresponds to an execution domain, and each execution domain includes multiple executors;

[0031] The data acquisition interface is used to acquire the current garbage volume of the garbage transfer station;

[0032] The main scheduling node is used to determine a first scheduling task based on the current garbage volume; the first scheduling task includes at least one second scheduling task arranged in sequence;

[0033] After the main scheduling node acquires the task load information of each slave scheduling node, it sends the first scheduling task to a target slave scheduling node that meets the preset node decision condition for execution;

[0034] The target slave scheduling node is used to determine the current second scheduling task to be executed in sequence during the execution of the first scheduling task, and execute the current second scheduling task in the corresponding executor of the execution domain corresponding to the target slave scheduling node, and update the execution status of the second scheduling task in the execution domain database; where each executor corresponds to a second scheduling task.

[0035] The present application provides a garbage scheduling method, which includes: a data acquisition interface acquires the current garbage volume of a garbage transfer station; a main scheduling node determines a first scheduling task based on the current garbage volume; the first scheduling task includes at least one second scheduling task arranged in sequence; after the main scheduling node acquires the task load information of each slave scheduling node, it sends the first scheduling task to a target slave scheduling node that meets the preset node decision condition for execution; during the execution of the first scheduling task by the target slave scheduling node, it determines the current second scheduling task to be executed in sequence, and executes the current second scheduling task in the corresponding executor in the execution domain corresponding to the target slave scheduling node, and updates the execution status of the second scheduling task in the execution domain database; wherein, each executor corresponds to a second scheduling task. The present application can intelligently supervise and schedule the garbage in the garbage transfer station, reduce the operation cost, and improve the work efficiency; at the same time, it can quantify the work content of the garbage truck drivers, record the work conditions of all garbage truck drivers, and can also supervise the idle status and driving trajectory of the garbage trucks in real time, and reasonably schedule each garbage truck. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following will briefly introduce the drawings required to be used in the embodiments of the present application. It should be understood that the following drawings only show some embodiments of the present application, and therefore should not be regarded as limiting the scope. For those of ordinary skill in the art, without creative efforts, other related drawings can also be obtained based on these drawings.

[0037] Figure 1 It is an architecture diagram of a scheduling platform applied to garbage provided by an embodiment of the present application;

[0038] Figure 2 It is a schematic flow chart of a garbage scheduling method provided by an embodiment of the present application;

[0039] Figure 3 It is a schematic diagram of a garbage scheduling center provided by an embodiment of the present application. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0040] The following will clearly and completely describe the technical solutions in the embodiments of the present application with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only some embodiments of the present application, not all of them. Based on the embodiments of the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts belong to the scope of protection of the present application.

[0041] Whether the garbage in the existing garbage transfer station is full requires a special person to check and tell the dispatcher by phone. The dispatcher calls the driver of the garbage transfer vehicle based on experience. After confirming that there is an idle driver, the dispatcher tells the corresponding driver the location of the garbage transfer station where the garbage needs to be transferred. After the driver arrives at the designated garbage transfer station, the garbage is transferred to the disposal site. The overall garbage transfer work process is very cumbersome, time-consuming and laborious, and the efficiency is low.

[0042] Therefore, the present application provides a garbage scheduling method and a scheduling platform to solve the above problems existing in the prior art and improve the transfer efficiency of the garbage in the garbage transfer station.

[0043] The following describes the preferred embodiments of the present application with reference to the accompanying drawings of the specification. It should be understood that the preferred embodiments described herein are only used to illustrate and explain the present application, and are not used to limit the present application. And without conflict, the embodiments in the present application and the features in the embodiments can be combined with each other.

[0044] Figure 1 It is an architecture diagram of a garbage scheduling platform provided by an embodiment of the present application, as Figure 1 shown:

[0045] The scheduling platform includes a data acquisition interface, a garbage scheduling center and at least one execution domain; the garbage scheduling center includes a main scheduling node and multiple slave scheduling nodes, each slave scheduling node corresponds to an execution domain, and each execution domain includes multiple executors.

[0046] Figure 2 It is a schematic flow diagram of a garbage scheduling method provided by an embodiment of the present application. As Figure 2 shown, this method is applied to the scheduling platform, and this method may include:

[0047] Step S210, the data acquisition interface acquires the current garbage volume of the garbage transfer station.

[0048] Step S220, the main scheduling node determines a first scheduling task based on the current garbage volume; wherein, the first scheduling task includes at least one second scheduling task arranged in sequence;

[0049] Step S230, after the main scheduling node acquires the task load information of each slave scheduling node, the first scheduling task is sent to a target slave scheduling node that meets the preset node decision condition for execution.

[0050] Among them, the task load information reflects various indicators of the current workload and processing capacity of a slave scheduling node. Specifically, it can be the number of tasks currently being executed, the task queue length, the response time / delay, or a combination of multiple of them. The preset node decision conditions are task thresholds, queue length thresholds, or response time thresholds; that is, based on the task load information and the preset node decision conditions, the target slave scheduling node is determined.

[0051] In some embodiments, the preset node decision conditions are dynamically adjusted: based on a fuzzy logic model, the thresholds can be automatically adjusted according to the actual situation to adapt to different workload changes, and a fault tolerance mechanism is added: to cope with possible abnormal situations (such as the sudden failure of a slave scheduling node), a certain amount of redundant resources can be reserved during task allocation, or quickly switched to other slave scheduling nodes. Among them, the input variables of the fuzzy logic model can be the current workload (such as the task queue length), resource utilization rate (such as CPU usage rate, memory occupancy), response time or delay, error rate, or other performance indicators. A set of fuzzy sets and corresponding membership functions are defined for each input variable. For example, for the workload, three fuzzy sets of "low", "medium", and "high" can be defined; for the resource utilization rate, there may be "idle", "moderately used", and "overloaded". Based on the configured fuzzy rules, determine how to adjust the thresholds; for example: if the workload is "high" and the resource utilization rate is "overloaded", then the task acceptance threshold should be reduced. If the response time is long and the error rate is low, the number of concurrent tasks may need to be reduced. According to the actual values of the current input variables, convert them into corresponding membership degrees through the fuzzification process, and apply the previously defined rule base for reasoning to obtain the fuzzy result of the output variable (i.e., the new threshold). The process of converting the inferred fuzzy result into a specific value is called defuzzification. Common methods include the centroid method, the maximum membership degree method, etc. Implement a loop mechanism to continuously monitor the system state and dynamically adjust the thresholds according to the above steps. At the same time, introduce a feedback mechanism to evaluate the adjustment effect and optimize the parameters or rules of the fuzzy logic system accordingly.

[0052] In this method, the master scheduling node first collects the task load information of all slave scheduling nodes to understand the current workload situation. Then, according to the pre-set conditions such as task thresholds, queue length thresholds, or response time thresholds, select the slave scheduling node that is most suitable to undertake the new task as the target slave scheduling node, and allocate the first scheduling task to it. This can ensure the effective utilization of resources and avoid overload.

[0053] Step S40: During the execution of the first scheduling task by the target slave scheduling node, determine the current second scheduling task to be executed in sequence, execute the current second scheduling task in the corresponding executor in the execution domain corresponding to the target slave scheduling node, and update the execution status of the second scheduling task in the execution domain database; wherein, each executor corresponds to a second scheduling task.

[0054] In this method, once the target slave scheduling node receives the first scheduling task, it will start to execute each second scheduling task in the predetermined order. Once each task is completed, the relevant information will be recorded and updated in the execution domain database. The purpose of this is to maintain the transparency and traceability of the system, and at the same time provide data support for subsequent analysis.

[0055] This scheduling mechanism of the present application effectively improves the efficiency and response speed of garbage disposal, and at the same time makes the resource allocation more reasonable. By dynamically adjusting the task allocation, it can not only cope with emergencies, but also minimize resource waste and service delay.

[0056] In one embodiment, the present application may specifically include: determining the garbage volume of the garbage transfer station in real time through the sensors (monitoring and weighing equipment) of the garbage transfer station, and sending the garbage volume to the scheduling platform.

[0057] The garbage volume may be the mass (weight) and / or volume of the garbage.

[0058] Combined with Figure 3 As shown, at least one second scheduling task may include: a garbage scheduling task and a transfer scheduling task arranged in sequence.

[0059] It can be understood that the current task load information can be the number of tasks of the garbage scheduling task, the length of the task queue, the response time / delay, or a combination of multiple of them.

[0060] If the current second scheduling task is a garbage scheduling task, then executing the current second scheduling task in the execution domain corresponding to the target slave scheduling node includes:

[0061] Matching the current garbage volume with the garbage transfer rule; specifically, the garbage transfer rule may be: reaching a preset ratio of the maximum capacity of the garbage transfer station; or reaching a preset ratio of the maximum load-bearing capacity of the garbage transfer station.

[0062] If the matching fails, it indicates that the current garbage volume does not reach the standard set in the garbage transfer rule, and there is no need to carry out the garbage transfer work.

[0063] If the matching is successful, generate a garbage scheduling task for the current garbage volume. That is to say, if the current garbage volume meets the garbage transfer rule, a garbage scheduling task will be generated.

[0064] Execute the garbage scheduling task in the execution domain corresponding to the target scheduling node.

[0065] After that, determine the target vehicle type and the target number of garbage transfer vehicles according to the number of vehicles that the garbage transfer station can accommodate;

[0066] Specifically, based on the road size of the garbage transfer station, determine at least one target vehicle type of the garbage transfer vehicle;

[0067] For the garbage transfer vehicle of any target vehicle type, based on the maximum load and maximum capacity of the corresponding garbage transfer vehicle, virtually divide the garbage in the garbage transfer station to obtain at least one area;

[0068] Determine the initial quantity based on the number of areas;

[0069] Among the multiple initial quantities, screen the quantity that meets the number of vehicles that the garbage transfer station can accommodate to determine the target quantity.

[0070] Execute the transfer scheduling task corresponding to the target garbage transfer vehicle group in the execution domain corresponding to the target scheduling node.

[0071] In this process, it can be understood that based on the garbage transfer station parameters (road size, the number of vehicles that can be accommodated), determine the target vehicle types (transfer vehicle information) of multiple garbage transfer vehicles that can enter the garbage transfer station, and then based on the maximum load and maximum capacity (transfer vehicle information) of the garbage transfer vehicle of any target vehicle type, virtually divide the garbage in the garbage transfer station to determine the virtual areas, so that according to the number of areas and the number of vehicles that the garbage transfer station can accommodate, the target quantity corresponding to the target vehicle type can be confirmed.

[0072] In short, after this step, the corresponding relationship between different target vehicle types and different target quantities can be obtained. That is, at least one transfer vehicle scheduling plan can be determined. In some embodiments, a transfer vehicle scheduling plan includes one or more target vehicle types and the target quantity corresponding to each target vehicle type.

[0073] This method is to determine the transfer vehicle scheduling plan that can transfer the current garbage through the relevant attribute information of the garbage transfer station.

[0074] Currently, one or more transfer vehicle scheduling plans are determined, but in actual applications, it is also necessary to consider whether there are suitable and available garbage transfer vehicles.

[0075] Among them, the available garbage transfer vehicle can be understood as a completely idle garbage transfer vehicle or a garbage transfer vehicle with some remaining capacity to carry the corresponding amount of garbage (this amount of garbage is the remaining capacity of the garbage transfer vehicle, not all the garbage in the garbage transfer station).

[0076] When there is only one transfer vehicle scheduling plan, only one target transfer vehicle scheduling plan can be determined, so that the target garbage transfer vehicle group in the target transfer vehicle scheduling plan transfers the current garbage volume of the garbage transfer station according to the garbage scheduling task.

[0077] When there are multiple transfer vehicle scheduling plans, a target transfer vehicle group that meets the target quantity and target vehicle type is determined among the currently available garbage transfer vehicles, that is, one or more target transfer vehicle scheduling plans can be determined.

[0078] In some embodiments, if there are multiple target transfer vehicle scheduling plans, for any target transfer vehicle scheduling plan, a preset model is used to process the attribute information of each target garbage transfer vehicle in the target transfer vehicle scheduling plan, and the final transfer vehicle scheduling plan is determined among the multiple target transfer vehicle scheduling plans;

[0079] Among them, the attribute information of the target garbage transfer vehicle includes: the distance between the target garbage transfer vehicle and the garbage transfer station, the first historical average residence time at the garbage transfer station, the second historical average residence time at the disposal site after transfer, and the transfer cost. Among them, the transfer cost may include fuel costs, labor costs, vehicle depreciation and other costs directly related to the transfer, etc.

[0080] The first historical average residence time is determined according to the first historical residence time of the target garbage transfer vehicle each time during the historical period;

[0081] In some embodiments, the second scheduling task may also be an information collection task for the attribute information (transfer vehicle information) of the garbage transfer vehicle. If the current second scheduling task is an information collection task, then the current second scheduling task is executed in the execution domain corresponding to the target scheduling node, including: collecting the first historical residence time and the second historical residence time of the garbage transfer vehicle each time during the historical period.

[0082] The process of executing the current second scheduling task includes:

[0083] Taking the center of the garbage transfer station as the origin and the configured preset distance as the radius, determine the target range of the garbage transfer station;

[0084] During the historical period, when the target garbage transfer vehicle drives into the target range, the time point when the target garbage transfer vehicle coincides with the boundary point of the target range is determined as the start time; combined with Figure 3 As shown, the time point of boundary coincidence is determined through the GPS position of the garbage transfer vehicle.

[0085] When the garbage transfer vehicle drives out of the target range, the time point when the target garbage transfer vehicle coincides with the boundary point of the target range is determined as the end time;

[0086] Based on the start time and the end time, determine the first historical residence time, and thus calculate the first historical average residence time within the historical period.

[0087] Similarly, the second historical average residence time is calculated based on the range where the disposal site is located, and its calculation method is the same as that of the first historical average residence time.

[0088] Combined with Figure 3 As shown, synchronizing the transfer-in records in the scheduled task is to determine the first historical residence time.

[0089] Furthermore, the GPS positions of each garbage transfer truck report the position coordinates at a configured preset interval to obtain the driving track of the garbage transfer truck, so as to determine whether the garbage has entered or exited the corresponding range.

[0090] In some embodiments, the preset model can be a MILP (Mixed Integer Linear Programming) model. Combining linear programming (LP) and integer programming (IP), by setting the objective function (such as minimizing the total transportation cost) and a series of constraint conditions (such as the maximum capacity of each vehicle, working time limit, etc.), the optimal solution can be found.

[0091] In another example, a time window is added to the MLP model, enabling the MLP model to continuously update and adjust the plan according to the information at the current time point (such as road section congestion) to cope with uncertainties.

[0092] In some embodiments, the workload of the driver of the target garbage transfer truck can also be determined by obtaining the first historical residence time and the second historical residence time of the target garbage transfer truck each time within the historical period.

[0093] After that, send the garbage scheduling task to the driver terminals (transfer APP) corresponding to all the target garbage transfer trucks in the target transfer truck scheduling plan;

[0094] The driver receives a notice in the driver terminal and can respond manually or automatically through the driver terminal.

[0095] In some embodiments, after sending the garbage scheduling task to the driver terminals corresponding to all the target garbage transfer trucks in the target transfer truck scheduling plan, if there is a corresponding driver who refuses to respond in the driver terminal, then send the garbage scheduling task to other target garbage transfer trucks of the corresponding vehicle type of the target garbage transfer truck corresponding to the refusal to respond. When there is no corresponding target garbage transfer truck to respond, eliminate the target transfer truck scheduling plan to which the target garbage transfer truck corresponding vehicle type belongs, and determine the final target transfer truck scheduling plan among other target transfer truck scheduling plans.

[0096] When multiple drivers reject responses at the driver terminal, resulting in the absence of a final target transfer vehicle scheduling plan, the automatic response function configured in the driver terminal is used to automatically respond to each target garbage transfer vehicle in the final transfer vehicle scheduling plan among multiple target garbage transfer scheduling plans. Or automatically respond to each target garbage transfer vehicle in the only target garbage transfer scheduling plan.

[0097] Finally, update the execution status of the corresponding second scheduling task in the execution domain database, that is Figure 3 Update the task status in it.

[0098] This application provides a garbage scheduling method, which includes: a data acquisition interface acquires the current garbage volume of the garbage transfer station; a main scheduling node determines a first scheduling task based on the current garbage volume; the first scheduling task includes at least one second scheduling task arranged in sequence; after the main scheduling node acquires the task load information of each slave scheduling node, it sends the first scheduling task to a target slave scheduling node that meets the preset node decision conditions for execution; during the execution of the first scheduling task by the target slave scheduling node, it determines the currently executed second scheduling task in sequence, and executes the currently executed second scheduling task in the corresponding executor in the execution domain corresponding to the target slave scheduling node, and updates the execution status of the second scheduling task in the execution domain database; where each executor corresponds to a second scheduling task. This application can intelligently supervise and schedule the garbage in the garbage transfer station, reduce operation costs, and improve work efficiency; at the same time, it can quantify the work content of garbage transfer vehicle drivers, record the work conditions of all garbage transfer vehicle drivers, and can also supervise the idle and driving trajectories of garbage transfer vehicles in real time, and reasonably schedule each garbage transfer vehicle.

[0099] In another embodiment provided by this application, a computer-readable storage medium is further provided. Instructions are stored in the computer-readable storage medium, and when it runs on a computer, it causes the computer to execute a garbage scheduling method described in any one of the above embodiments.

[0100] In another embodiment provided by this application, a computer program product containing instructions is further provided. When it runs on a computer, it causes the computer to execute a garbage scheduling method described in any one of the above embodiments.

[0101] Those skilled in the art should understand that the embodiments in the embodiments of the present application can be provided as methods, systems, or computer program products. Therefore, the embodiments in the embodiments of the present application can take the form of all-hardware embodiments, all-software embodiments, or embodiments combining software and hardware aspects. Moreover, the embodiments in the embodiments of the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0102] The embodiments in the embodiments of the present application are described with reference to the flowcharts and / or block diagrams of methods, apparatuses (systems), and computer program products according to the embodiments in the embodiments of the present application. It should be understood that each flow and / or block in the flowchart and / or block diagram, and the combination of flows and / or blocks in the flowchart and / or block diagram, can be realized by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing devices generate means for realizing the functions specified in Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0103] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory generate a manufactured article including instruction means, and the instruction means realizes the functions specified in Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0104] These computer program instructions can also be loaded onto a computer or other programmable data processing device, so that a series of operation steps are executed on the computer or other programmable device to generate a computer-implemented process, and thus the instructions executed on the computer or other programmable device provide steps for realizing the functions specified in Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0105] Unless otherwise defined, technical terms or scientific terms used in this application shall have the ordinary meanings as understood by those of ordinary skill in the art to which this invention pertains. The terms "first", "second" and similar terms used in this application do not denote any order, quantity or importance, but are merely used to distinguish different components. Words such as "comprising" or "including" mean that the elements or items appearing before this word cover the elements or items listed after this word and their equivalents, without excluding other elements or items. Words such as "connected", "coupled" or "linked" are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "Upper", "lower", "left", "right", etc. are only used to indicate relative positional relationships, and when the absolute position of the object being described changes, the relative positional relationship may also change accordingly.

[0106] Although the preferred embodiments in the embodiments of this application have been described, those skilled in the art can make additional changes and modifications once they learn the basic creative concepts. Therefore, the embodiments of this application are intended to be interpreted as including the preferred embodiments and all changes and modifications falling within the scope of the embodiments of this application.

[0107] Obviously, those skilled in the art can make various changes and modifications to the embodiments in the embodiments of this application without departing from the spirit and scope of the embodiments in the embodiments of this application. Thus, if these modifications and variations of the embodiments in the embodiments of this application fall within the scope of the embodiments of this application and their equivalent technologies, the embodiments of this application are also intended to include these changes and variations.

Claims

1. A garbage dispatching method, characterized in that: Applied to a scheduling platform, the scheduling platform includes a data acquisition interface, a garbage scheduling center and at least one execution domain; the garbage scheduling center includes a master scheduling node and multiple slave scheduling nodes, each slave scheduling node corresponds to an execution domain, and each execution domain includes multiple executors; the method includes: The data acquisition interface acquires the current amount of garbage at the garbage transfer station; The main scheduling node determines a first scheduling task based on the current garbage amount; the first scheduling task includes at least one second scheduling task arranged in sequence; After acquiring the task load information of each slave scheduling node, the master scheduling node sends the first scheduling task to a target slave scheduling node that meets a preset node decision condition for execution; During the execution of the first scheduling task, the target slave scheduling node determines the current second scheduling task to be executed in sequence, executes the current second scheduling task in the corresponding executor of the execution domain corresponding to the target slave scheduling node, and updates the execution status of the second scheduling task in the execution domain database; wherein each executor corresponds to a second scheduling task.

2. The method according to claim 1, characterized in that The at least one second scheduling task arranged in sequence includes a garbage scheduling task and a transfer scheduling task arranged in sequence.

3. The method according to claim 2, characterized in that If the current second scheduling task is a garbage scheduling task, executing the current second scheduling task in the execution domain corresponding to the target slave scheduling node includes: Matching the current garbage volume with the garbage transfer rules; If the match is successful, a garbage scheduling task for the current amount of garbage is generated; The garbage scheduling task is executed in the execution domain corresponding to the target slave scheduling node.

4. The method according to claim 2, characterized in that If the current second scheduling task is a transfer scheduling task, executing the current second scheduling task in the execution domain corresponding to the target slave scheduling node includes: Determining a target model of garbage transfer vehicles and a target number of garbage transfer vehicles according to the number of vehicles that the garbage transfer station can accommodate and the current amount of garbage; Determine a target garbage transfer vehicle group that meets the target number and the target vehicle model among currently available garbage transfer vehicles; The transfer scheduling task corresponding to the target garbage transfer vehicle group is executed in the execution domain corresponding to the target slave scheduling node.

5. The method according to claim 4, characterized in that The current garbage amount includes the weight and / or volume of the garbage; According to the number of vehicles that the garbage transfer station can accommodate and the amount of garbage, the target model of garbage transfer vehicles and the target number of garbage transfer vehicles are determined, including: Determine at least one target model of garbage transfer vehicle based on the road size of the garbage transfer station; For any of the target garbage transfer vehicles, based on the maximum load and maximum capacity of the corresponding garbage transfer vehicle, the garbage at the garbage transfer station is virtually divided to obtain at least one area; determining an initial quantity based on the quantity of the regions; Among the multiple initial quantities, the number of vehicles that can be accommodated by the garbage transfer station is screened to determine the target number.

6. The method according to claim 5, characterized in that After determining the target quantity, the method further includes: Based on the correspondence between different target types of garbage transfer vehicles and the target numbers of different garbage transfer vehicles, at least one transfer vehicle scheduling plan is determined.

7. The method according to claim 6, characterized in that Determining the target number and target model of target garbage transfer vehicles from currently available garbage transfer vehicles includes: According to at least one transfer vehicle scheduling plan, a target garbage transfer vehicle group having the target number and the target vehicle model is determined among currently available garbage transfer vehicles, and at least one target transfer vehicle scheduling plan is generated.

8. The method according to claim 7, characterized in that After generating at least one target transfer vehicle scheduling plan, the method further includes: If there are multiple target transfer vehicle scheduling plans, then for any target transfer vehicle scheduling plan, a preset model is used to process the attribute information of each target garbage transfer vehicle in the target transfer vehicle scheduling plan to determine the final transfer vehicle scheduling plan; the attribute information of the target garbage transfer vehicle includes: the distance from the garbage transfer station, the first historical average stay time at the garbage transfer station, the second historical average stay time at the disposal site after transfer, and the transfer cost.

9. A garbage dispatching platform, characterized in that: The scheduling platform includes a data acquisition interface, a garbage scheduling center and at least one execution domain; the garbage scheduling center includes a master scheduling node and multiple slave scheduling nodes, each slave scheduling node corresponds to an execution domain, and each execution domain includes multiple executors; The data acquisition interface is used to obtain the current amount of garbage at the garbage transfer station; The main scheduling node is used to determine a first scheduling task based on the current garbage amount; The first scheduling task includes at least one second scheduling task arranged in sequence; After acquiring the task load information of each slave scheduling node, the master scheduling node sends the first scheduling task to a target slave scheduling node that meets a preset node decision condition for execution; The target slave scheduling node is used to determine the current second scheduling task to be executed in sequence during the execution of the first scheduling task, and execute the current second scheduling task in the corresponding executor of the execution domain corresponding to the target slave scheduling node, and update the execution status of the second scheduling task in the execution domain database; wherein each executor corresponds to a second scheduling task.

Images