Public toilet sewage suction truck scheduling method and device based on locking mechanism and server

Abstract

The invention provides a public toilet sewage suction truck scheduling method and device based on a locking mechanism and a server, and relates to the technical field of public toilet management, and the method comprises the steps: receiving a to-be-sucked sewage task from a public toilet end; receiving a competition request from the suction-type sewer scavenger; based on a preset mechanism, the target to-be-sucked sewage task and all alternative competition requests for the target to-be-sucked sewage task, determining a target competition request in all the alternative competition requests for the target to-be-sucked sewage task, and locking a target sewage suction truck corresponding to the target competition request and the target to-be-sucked sewage task; and generating a first task planning result based on all the to-be-sucked tasks locked by the target suction-type sewer scavenger. The sewage suction efficiency of the public toilet can be effectively improved, sewage suction truck resources and the like are reduced, and meanwhile the sewage suction management accuracy and response speed of the public toilet are remarkably improved.

Description

Technical Field

[0001] The present invention relates to the technical field of public toilet management, and in particular, to a scheduling method, device and server for a public toilet sewage suction vehicle based on a locking mechanism. Background Art

[0002] Sewage suction of public toilets is an indispensable part of urban environmental sanitation work, which is of great significance for maintaining the cleanliness and hygiene of public toilets and improving the urban environmental quality. At present, the sewage suction of public toilets mainly adopts the following methods: dispatching sewage suction vehicles to public toilets for sewage suction at fixed times, or manually judging whether it is necessary to dispatch sewage suction vehicles to public toilets for sewage suction. The above methods have the following problems: low efficiency, high empty driving rate of sewage suction vehicles, and difficulty in ensuring the timeliness of sewage suction, etc. Summary of the Invention

[0003] In view of this, the purpose of the present invention is to provide a scheduling method, device and server for a public toilet sewage suction vehicle based on a locking mechanism, which can effectively improve the sewage suction efficiency of public toilets, reduce the resources of sewage suction vehicles, etc., and at the same time significantly improve the accuracy and response speed of public toilet sewage suction management.

[0004] In a first aspect, the present invention provides a scheduling method for a public toilet sewage suction vehicle based on a locking mechanism. The method is applied to a scheduling server, and the method includes:

[0005] Receiving a sewage suction task to be processed from a public toilet terminal, where the sewage suction task to be processed includes time requirements, location and capacity requirements;

[0006] Receiving a competition request from a sewage suction vehicle, where the competition request includes the sewage suction tasks that the sewage suction vehicle has locked and the capacity of the sewage suction vehicle;

[0007] Based on a preset mechanism, a target sewage suction task to be processed and all alternative competition requests for the target sewage suction task to be processed, determining a target competition request among all alternative competition requests for the target sewage suction task to be processed, and locking the target sewage suction vehicle corresponding to the target competition request with the target sewage suction task to be processed;

[0008] Generating a first task planning result based on all the sewage suction tasks locked by the target sewage suction vehicle, and sending the first task planning result to the target sewage suction vehicle. The first task planning result is used to describe the sewage suction route, the location of the public toilet terminal and the sewage suction time.

[0009] In an implementation manner, based on a preset mechanism, a target sewage suction task to be processed and all alternative competition requests for the target sewage suction task to be processed, determining a target competition request among all alternative competition requests for the target sewage suction task to be processed includes:

[0010] Generate a demand priority planning result for all alternative sewage suction trucks based on the target sewage suction task and the locked sewage suction tasks of the alternative sewage suction trucks corresponding to all alternative competing requests for the target sewage suction task. The demand priority planning result includes a second task planning result, the time consumption of the alternative sewage suction truck to execute the second task planning result, and the remaining capacity of the alternative sewage suction truck after executing the second task planning result.

[0011] Based on a pre-set mechanism and the demand priority planning results of all alternative sewage suction trucks for the target sewage suction task, determine the binding priorities corresponding to all alternative competing requests for the target sewage suction task. The binding priority is negatively correlated with the path length of the second task planning result and the time consumption of the alternative sewage suction truck to execute the second task planning result, and is positively correlated with the remaining capacity of the alternative sewage suction truck after executing the second task planning result.

[0012] Based on the binding priority, determine the target competing request among all alternative competing requests for the target sewage suction task.

[0013] In one implementation, the number of target sewage suction tasks is one; generate a demand priority planning result for all alternative sewage suction trucks based on the target sewage suction task and the locked sewage suction tasks of the alternative sewage suction trucks corresponding to all alternative competing requests for the target sewage suction task, including:

[0014] Perform the following operations on any alternative competing request for the target sewage suction task:

[0015] Pre-bind the target sewage suction task to the alternative sewage suction truck corresponding to this alternative competing request;

[0016] Based on the target sewage suction task and this alternative competing request, generate a demand priority planning result for the alternative sewage suction truck.

[0017] In one implementation, the number of target sewage suction tasks is multiple; generate a demand priority planning result for all alternative sewage suction trucks based on the target sewage suction task and the locked sewage suction tasks of the alternative sewage suction trucks corresponding to all alternative competing requests for the target sewage suction task, further including:

[0018] Take the time requirement, location, and capacity requirement of the target sewage suction task, as well as the time requirement, location, and capacity requirement of the locked sewage suction tasks of all alternative sewage suction trucks for the target sewage suction task as the public toilet end information; take the number, real-time status information, and basic attribute information of the alternative sewage suction trucks corresponding to all alternative competing requests as the sewage suction truck information;

[0019] Take the public toilet end information, sewage suction truck information, and road network data as the input parameters required for task planning;

[0020] Based on the input parameters and the set of constraint conditions, task planning is performed for all alternative sewage suction trucks through a pre-constructed task planning model to determine the second task planning results corresponding to all alternative sewage suction trucks and the time consumption for executing the second task planning results;

[0021] Based on the second task planning results, the capacities of all alternative sewage suction trucks, and the capacity requirements corresponding to the locked sewage suction tasks of all alternative sewage suction trucks, the remaining capacities of all alternative sewage suction trucks after executing the corresponding second task planning results are determined.

[0022] In one implementation, the set of constraint conditions includes one or more of the following constraints:

[0023] Public toilet coverage constraint, which is used to constrain that the locked target sewage suction tasks of all alternative sewage suction trucks can cover all target sewage suction tasks;

[0024] Time window constraint, which is used to constrain that the sewage suction time is within the time requirements at the public toilet end;

[0025] Vehicle passage condition constraint, which is used to enable alternative sewage suction trucks to pass to the public toilet end;

[0026] Vehicle load constraint, which is used to constrain that the sum of the capacity requirements of all the locked sewage suction tasks of any alternative sewage suction truck is less than the capacity of the alternative sewage suction truck;

[0027] Vehicle working duration constraint, which is used to constrain that the sum of the sewage suction times of all the locked sewage suction tasks of any alternative sewage suction truck is less than the maximum working duration limit of the alternative sewage suction truck;

[0028] Traffic rule constraint, which is used to constrain alternative sewage suction trucks to drive according to traffic rules.

[0029] In one implementation, before determining the target competition request among all alternative competition requests for the target sewage suction task based on a preset mechanism, the target sewage suction task, and all alternative competition requests for the target sewage suction task, the method further includes:

[0030] Based on the capacity requirements corresponding to the public toilet end, determine the sewage suction priority corresponding to the public toilet end, and the sewage suction priority is positively correlated with the capacity requirements;

[0031] Determine at least one public toilet end to be sewage-sucked according to the sewage suction priority, and use the sewage suction tasks of the public toilet end to be sewage-sucked as the target sewage suction tasks.

[0032] In a second aspect, the present invention further provides a public toilet sewage suction truck scheduling device based on a locking mechanism. The device is applied to a scheduling server and includes:

[0033] A task receiving module, configured to receive the sewage suction task to be processed from the public toilet terminal, where the sewage suction task to be processed includes time requirements, location, and capacity requirements;

[0034] A request receiving module, configured to receive a competition request from the sewage suction vehicle, where the competition request includes the sewage suction tasks locked by the sewage suction vehicle and the capacity of the sewage suction vehicle;

[0035] A locking module, configured to determine a target competition request from all alternative competition requests for the target sewage suction task based on a preset mechanism, the target sewage suction task, and all alternative competition requests for the target sewage suction task, and lock the target sewage suction vehicle corresponding to the target competition request with the target sewage suction task;

[0036] A planning module, configured to generate a first task planning result based on all the sewage suction tasks locked by the target sewage suction vehicle, and send the first task planning result to the target sewage suction vehicle, where the first task planning result is used to describe the sewage suction route, the location of the public toilet terminal, and the sewage suction time.

[0037] In one implementation, the locking module is specifically configured to:

[0038] Generate a demand priority planning result corresponding to all alternative sewage suction vehicles based on the target sewage suction task and the sewage suction tasks locked by the alternative sewage suction vehicles corresponding to all alternative competition requests for the target sewage suction task, where the demand priority planning result includes a second task planning result, the time consumed by the alternative sewage suction vehicle to execute the second task planning result, and the remaining capacity of the alternative sewage suction vehicle after executing the second task planning result;

[0039] Determine the binding priority corresponding to all alternative competition requests for the target sewage suction task based on a preset mechanism and the demand priority planning result corresponding to all alternative sewage suction vehicles for the target sewage suction task, where the binding priority is negatively correlated with the path length of the second task planning result and the time consumed by the alternative sewage suction vehicle to execute the second task planning result, and is positively correlated with the remaining capacity of the alternative sewage suction vehicle after executing the second task planning result;

[0040] Determine the target competition request from all alternative competition requests for the target sewage suction task based on the binding priority.

[0041] In a third aspect, the present invention further provides a server, including a processor and a memory, where the memory stores computer executable instructions that can be executed by the processor, and the processor executes the computer executable instructions to implement the method according to any one of the first aspect.

[0042] Fourthly, the present invention further provides a computer-readable storage medium storing computer-executable instructions, which, when called and executed by a processor, cause the processor to implement the method according to any one of the first aspect.

[0043] A scheduling method, device and server for a public toilet sewage suction truck based on a locking mechanism provided by the present invention. First, a sewage suction task to be processed from the public toilet end is received respectively, the sewage suction task includes time requirements, location and capacity requirements, and a competition request from the sewage suction truck is received, the competition request includes the sewage suction tasks already locked by the sewage suction truck and the capacity of the sewage suction truck; then, based on a preset mechanism, a target sewage suction task and all alternative competition requests for the target sewage suction task, a target competition request is determined among all alternative competition requests for the target sewage suction task, and the target sewage suction truck corresponding to the target competition request is locked with the target sewage suction task; finally, a first task planning result is generated based on all the sewage suction tasks locked by the target sewage suction truck, and the first task planning result is sent to the target sewage suction truck, and the first task planning result is used to describe the sewage suction route, the location of the public toilet end and the sewage suction time. After receiving the sewage suction task from the public toilet end and the competition request from the sewage suction truck, the above method combines the locking mechanism, and determines the target sewage suction truck locked with the target sewage suction task according to the preset mechanism, the target sewage suction task and all alternative competition requests for the target sewage suction task, and then obtains the corresponding first task planning result, thereby effectively improving the sewage suction efficiency of public toilets, reducing sewage suction truck resources, etc., and at the same time significantly improving the accuracy and response speed of public toilet sewage suction management.

[0044] Other features and advantages of the present invention will be described in the following specification, and in part will be obvious from the specification, or will be understood by implementing the present invention. The objectives and other advantages of the present invention are achieved and obtained by the structures specifically pointed out in the specification, claims and drawings.

[0045] In order to make the above objectives, features and advantages of the present invention more obvious and understandable, the following specific preferred embodiments are given and described in detail in conjunction with the accompanying drawings as follows. Description of the Drawings

[0046] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the following will briefly introduce the drawings required for the description of the specific embodiments or the prior art. Obviously, the following drawings are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0047] Figure 1Schematic flowchart of a public toilet sewage suction vehicle scheduling method based on a locking mechanism provided by an embodiment of the present invention;

[0048] Figure 2 Architecture diagram of a public toilet sewage suction vehicle scheduling method based on a locking mechanism provided by an embodiment of the present invention;

[0049] Figure 3 Structure diagram of a public toilet sewage suction vehicle scheduling device based on a locking mechanism provided by an embodiment of the present invention;

[0050] Figure 4 Structure diagram of a server provided by an embodiment of the present invention. Detailed implementation manners

[0051] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the present invention will be clearly and completely described below in conjunction with the embodiments. Apparently, the described embodiments are some, but not all, of the embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0052] Currently, the existing public toilet sewage suction methods have the following problems: low efficiency, high empty driving rate of sewage suction vehicles, and difficulty in ensuring sewage suction timeliness, etc. Based on this, the embodiments of the present invention provide a public toilet sewage suction vehicle scheduling method, device, and server based on a locking mechanism, which can effectively improve the public toilet sewage suction efficiency, reduce sewage suction vehicle resources, etc., and at the same time significantly improve the accuracy and response speed of public toilet sewage suction management.

[0053] For ease of understanding of this embodiment, first, a public toilet sewage suction vehicle scheduling method based on a locking mechanism disclosed in the embodiments of the present invention will be introduced in detail. The method is applied to a scheduling server. Refer to Figure 1 The schematic flowchart of a public toilet sewage suction vehicle scheduling method based on a locking mechanism shown in the following, and this method mainly includes the following steps S102 to step S108:

[0054] Step S102, receive a sewage suction task to be processed from the public toilet end.

[0055] Among them, the sewage suction task to be processed includes time requirements, location, and capacity requirements. In one example, the public toilet end can receive real-time pedestrian flow monitoring data sent by a pedestrian flow monitoring sensor installed in the public toilet, or receive a sewage suction reservation task uploaded by an associated terminal for the public toilet end, monitor its own manure storage situation in combination with the real-time pedestrian flow monitoring data and the sewage suction reservation task, and upload the sewage suction task to be processed to the scheduling server when the sewage suction condition is met.

[0056] Step S104, receive a competition request from the sewage suction vehicle.

[0057] Among them, the competition request includes the to-be-sewage-sucked tasks locked by the sewage suction truck and the capacity of the sewage suction truck. In one example, all to-be-sewage-sucked tasks can be displayed on the associated terminal of the sewage suction truck, and in response to the user's selection operation for the to-be-sewage-sucked task, the scheduling server can receive the competition request for the to-be-sewage-sucked task selected by the user.

[0058] Step S106: Based on a preset mechanism, the target to-be-sewage-sucked task, and all alternative competition requests for the target to-be-sewage-sucked task, determine the target competition request among all alternative competition requests for the target to-be-sewage-sucked task, and lock the target sewage suction truck corresponding to the target competition request with the target to-be-sewage-sucked task.

[0059] For any target to-be-sewage-sucked task, the competition requests sent for this target to-be-sewage-sucked task can be recorded as alternative competition requests, and the sewage suction trucks corresponding to the alternative competition requests can be recorded as alternative sewage suction trucks. In one example, a demand priority planning result is generated based on the target to-be-sewage-sucked task and all alternative competition requests for the target to-be-sewage-sucked task. The demand priority planning result includes the second task planning result, the time consumed for the alternative sewage suction truck to execute the second task planning result, and the remaining capacity of the alternative sewage suction truck after executing the second task planning result. The mechanism is used to allocate and bind priorities for each alternative competition request based on the above-mentioned second task planning result, time consumption, and remaining capacity, and then bind the alternative competition request with the highest binding priority to the target to-be-sewage-sucked task.

[0060] Step S108: Generate a first task planning result based on all the to-be-sewage-sucked tasks locked by the target sewage suction truck, and send the first task planning result to the target sewage suction truck.

[0061] Among them, the first task planning result is used to describe the sewage suction route, the location of the public toilet end, and the sewage suction time. In one example, since the demand priority planning result generated in step S106 already includes the second task planning result, the second task planning result corresponding to the target sewage suction truck can be directly used as the first task planning result that the target sewage suction truck can execute. In another example, a new first task planning result can also be generated again based on all the to-be-sewage-sucked tasks locked by the target sewage suction truck.

[0062] The public toilet sewage suction truck scheduling method based on the locking mechanism provided by the embodiments of the present invention, after receiving the to-be-sewage-sucked tasks of the public toilet end and the competition requests of the sewage suction truck, combines the locking mechanism, and according to a preset mechanism, the target to-be-sewage-sucked task, and all alternative competition requests for the target to-be-sewage-sucked task, determines the target sewage suction truck locked with the target to-be-sewage-sucked task, and then obtains the corresponding first task planning result, thereby effectively improving the public toilet sewage suction efficiency, reducing the sewage suction truck resources, etc., and at the same time significantly improving the accuracy and response speed of public toilet sewage suction management.

[0063] For ease of understanding, refer to Figure 2 the architecture diagram of a public toilet sewage suction truck scheduling method based on a locking mechanism shown in the figure, which includes a scheduling server, a public toilet terminal, and a sewage suction truck. The public toilet terminal is also the associated terminal of the public toilet. The scheduling server receives the sewage suction tasks to be processed from the public toilet terminal and the competition requests from the sewage suction trucks, and the scheduling server also sends the first task planning result to the sewage suction trucks. Based on this, the embodiments of the present invention provide a specific implementation manner of a public toilet sewage suction truck scheduling method based on a locking mechanism.

[0064] For the aforementioned step S102, the embodiments of the present invention provide an implementation manner for receiving competition requests from sewage suction trucks.

[0065] The public toilet terminal receives the real-time pedestrian flow monitoring data sent by the pedestrian flow monitoring sensors installed in the public toilet, and also receives the sewage suction reservation tasks uploaded by the associated terminal for the public toilet. Among them, both the real-time pedestrian flow monitoring data and the sewage suction reservation tasks carry the location of the public toilet (such as longitude and latitude). The sewage suction reservation task is used to describe the sewage suction reservation date corresponding to the public toilet and / or the manure storage situation. The manure storage situation can be described in ways such as percentage or grading.

[0066] In one example, some or all of the public toilets in the target area can be installed with pedestrian flow monitoring sensors, which can detect the pedestrian flow situation of the public toilets in real time to obtain the corresponding real-time pedestrian flow monitoring data. In addition, the inspection personnel can inspect some or all of the public toilets in the target area. The associated terminal of the inspection personnel can display a task reservation page, so that the inspection personnel can select information such as the current inspected public toilet, the sewage suction reservation date, and the manure storage situation on the task reservation page.

[0067] The public toilet terminal determines its own time requirements and capacity requirements based on the real-time pedestrian flow monitoring data and / or the sewage suction reservation tasks. Among them, the time requirement can describe the number of days until the next sewage suction of the public toilet. Therefore, in the case of knowing the date when the known data (real-time pedestrian flow monitoring data and / or sewage suction reservation tasks) is uploaded, the time requirement can also be used to describe the specific date of the next sewage suction of the public toilet. The capacity requirement is also the amount of fecal sewage reached by the public toilet on the specific date of the next sewage suction of the public toilet, and this amount of fecal sewage is estimated based on the above-mentioned manure storage situation.

[0068] In one example, if a public toilet only corresponds to real-time monitoring data of the number of people, the public toilet terminal can estimate the time demand of the public toilet by combining the chaos coefficient corresponding to the environment where the public toilet is located and the preset per capita fecal discharge amount; if a public toilet only corresponds to a sewage suction reservation task, the sewage suction reservation date uploaded by the inspection personnel can be directly determined as the time demand corresponding to the public toilet, or the sewage suction reservation date uploaded by the inspection personnel can be adjusted using the manure storage situation, and then the time demand corresponding to the public toilet can be determined based on the adjusted sewage suction reservation date. In a specific implementation manner, the time demand corresponding to the public toilet can be estimated in the following three cases:

[0069] Case 1: If only the sewage suction reservation task corresponding to the public toilet is received, the sewage suction reservation date is used as the first time demand corresponding to the public toilet, or the sewage suction reservation date is adjusted using the manure storage situation, and the adjusted sewage suction reservation date is used as the first time demand corresponding to the public toilet.

[0070] In practical applications, if a public toilet is not equipped with a sensor for monitoring the number of people, only the sewage suction reservation task uploaded by the inspection personnel can be received.

[0071] If the sewage suction reservation task only includes the sewage suction reservation date, the sewage suction reservation date can be directly used as the time demand.

[0072] If the sewage suction reservation task includes the sewage suction reservation date and the manure storage situation, the sewage suction reservation date can be adjusted according to the following Method 1 or Method 2:

[0073] Method 1: The remaining volume of the public toilet is determined by combining the manure volume that the public toilet can accommodate. If the remaining volume is less than the preset volume threshold, the sewage suction reservation date can be advanced; otherwise, the sewage suction reservation date can be postponed. The preset volume threshold can be set based on the historical sewage suction data (such as historical time demand) corresponding to the public toilet.

[0074] Method 2: The sewage suction reservation date and the manure storage situation are used as the input of a neural network model that has been pre-trained, and the adjusted sewage suction reservation date is output through the neural network model. Among them, it is necessary to collect the historical sewage suction data corresponding to the public toilet (such as the historical sewage suction reservation date, historical manure storage situation, and historical actual sewage suction date uploaded by the inspection personnel), construct a training data set based on the historical sewage suction data, and use the training data set to train the neural network model.

[0075] Case 2: If only the real-time monitoring data of the number of people corresponding to the public toilet is received, the second time demand corresponding to the public toilet is determined based on the real-time monitoring data of the number of people, the chaos coefficient corresponding to the environment where the public toilet is located, and the preset per capita fecal discharge amount.

[0076] In practical applications, if no inspection personnel are arranged to inspect a public toilet and a passenger flow monitoring sensor is installed in the public toilet, only the real-time passenger flow monitoring data uploaded by the passenger flow real-time monitoring data can be received. When specifically implemented, the following steps 1 to 2 can be referred to:

[0077] Step 1: Based on the real-time passenger flow monitoring data, the chaos coefficient corresponding to the environment where the public toilet is located, and the preset per capita fecal discharge amount, determine the second fecal storage situation corresponding to the public toilet. The real-time passenger flow monitoring data is used to describe the number of people in the public toilet during a specific time period, and the chaos coefficient is used to describe the influence of the environment (such as season, weather, etc.) where the public toilet is located on the per capita fecal discharge amount.

[0078] In one example, assuming that the passenger flow monitoring sensor uploads the real-time passenger flow monitoring data once an hour, the product of the real-time passenger flow monitoring data, the chaos coefficient corresponding to the environment where the public toilet is located, and the preset per capita fecal discharge amount can be calculated to obtain the amount of fecal pollution newly added to the public toilet within this hour, so as to dynamically update the second fecal storage situation corresponding to the public toilet by using the newly added amount of fecal pollution.

[0079] In another example, continuing to assume that the passenger flow monitoring sensor uploads the real-time passenger flow monitoring data once an hour, the average value of the real-time passenger flow monitoring data per hour within a day can be calculated, and the product of the average passenger flow value, the chaos coefficient corresponding to the environment where the public toilet is located, the preset per capita fecal discharge amount, and 24 (h) can be calculated to obtain the amount of fecal pollution newly added to the public toilet on that day, so as to dynamically update the second fecal storage situation corresponding to the public toilet by using the newly added amount of fecal pollution.

[0080] Step 2: Based on the preset fecal pollution capacity, the second fecal storage situation, and the real-time passenger flow monitoring data, estimate the time required to reach the fecal pollution capacity to determine the second time requirement corresponding to the public toilet. In one example, calculate the difference between the preset fecal pollution capacity and the second fecal storage situation to obtain the remaining volume of the public toilet, and calculate the ratio of the remaining volume to the real-time passenger flow monitoring data to obtain the time required to reach the fecal pollution capacity, so as to determine the second time requirement corresponding to the public toilet.

[0081] Situation 3: If the real-time passenger flow monitoring data and the sewage suction reservation task corresponding to the public toilet are received, fuse the first time requirement and the second time requirement to obtain the third time requirement corresponding to the public toilet. In one example, the weight values of the first time requirement and the second time requirement can be pre-configured to perform weighted fusion on the first time requirement and the second time requirement according to the weight values. Optionally, the weight value of the first time requirement is higher than the weight value of the second time requirement.

[0082] For the foregoing step S104, an embodiment of the present invention provides a specific implementation manner for receiving a competition request from a sewage suction truck. All pending sewage suction tasks are displayed on the associated terminal of the sewage suction truck, and in response to the user's selection operation for the pending sewage suction task, the scheduling server can receive a competition request for the pending sewage suction task selected by the user.

[0083] Before performing the foregoing step S106, the scheduling server may determine a target pending sewage suction request from the received pending sewage suction requests, and further screen the pending sewage suction tasks to reduce the computational complexity of task planning and reduce the number of trips of the sewage suction truck. Specifically: Based on the capacity requirements corresponding to the public toilet end, determine the sewage suction priority corresponding to the public toilet end. The sewage suction priority is positively correlated with the capacity requirements. Determine at least one public toilet end to be sewage suctioned according to the sewage suction priority, and use the pending sewage suction task of the public toilet end to be sewage suctioned as the target pending sewage suction task.

[0084] Specifically, the closer the time requirement corresponding to the pending sewage suction task is to the current date, the higher the sewage suction priority of the pending sewage suction task. In one example, a preset number of target pending sewage suction tasks may be screened based on the sewage suction priority, or only the pending sewage suction task with the highest sewage suction priority may be selected as the target pending sewage suction task.

[0085] For the foregoing step S106, an embodiment of the present invention provides an implementation manner for determining a target competition request among all alternative competition requests for a target pending sewage suction task based on a preset mechanism, the target pending sewage suction task, and all alternative competition requests for the target pending sewage suction task. It includes the following steps 1 to step 3:

[0086] Step 1, based on the target pending sewage suction task and the pending sewage suction tasks locked by the alternative sewage suction trucks corresponding to all alternative competition requests for the target pending sewage suction task, generate a demand priority planning result corresponding to each alternative sewage suction truck. Among them, the demand priority planning result includes a second task planning result, the time consumed by the alternative sewage suction truck to execute the second task planning result, and the remaining capacity of the alternative sewage suction truck after executing the second task planning result. The second task planning result is used to describe the operation route, the location and sewage suction time of the pending sewage suction tasks locked by the alternative sewage suction truck. The sewage suction operation route is the optimal route for the sewage suction truck to drive to each pending sewage suction public toilet corresponding to it, and the sewage suction time is the specific time range for performing sewage suction operations for each locked pending sewage suction task. The sewage suction times corresponding to different pending sewage suction tasks should be within the corresponding acceptable time range.

[0087] In one implementation manner, the number of target pending sewage suction tasks is one, and the following operations are performed on any alternative competition request for the target pending sewage suction task: Pre-bind the target pending sewage suction task to the alternative sewage suction truck corresponding to the alternative competition request; Based on the target pending sewage suction task and the alternative competition request, generate a demand priority planning result for the alternative sewage suction truck.

[0088] In another implementation, if the number of target tasks to be decontaminated by suction is multiple, then the time requirements, locations, and capacity requirements of the target tasks to be decontaminated by suction, as well as the time requirements, locations, and capacity requirements corresponding to the tasks to be decontaminated by suction that have been locked for all alternative suction trucks for the target tasks to be decontaminated by suction, and the relevant information of each alternative suction truck competing for the above target tasks to be decontaminated by suction (such as the number of alternative suction trucks, real-time status information, and basic attribute information), and road network data are constructed as input parameters. Then, using the pre-constructed task planning model, task planning is performed based on the above input parameters and the set of constraint conditions. The set of constraint conditions may include one or more of the following constraints: public toilet coverage constraint, time window constraint, vehicle passing condition constraint, vehicle load constraint, vehicle working duration constraint, traffic rule constraint, to obtain the demand priority planning result corresponding to each alternative suction truck. Specifically, the following steps a to d can be referred to:

[0089] Step a: The time requirements, locations, and capacity requirements of the target tasks to be decontaminated by suction, as well as the time requirements, locations, and capacity requirements corresponding to the tasks to be decontaminated by suction that have been locked for all alternative suction trucks for the target tasks to be decontaminated by suction are used as public toilet end information; the number of alternative suction trucks, real-time status information, and basic attribute information corresponding to all alternative competition requests are used as suction truck information. Among them, the real-time status information of the suction truck includes the real-time location and operation status; the basic attribute information of the suction truck includes load, vehicle type, operation speed, running speed, etc.; the road network data includes road connection conditions, traffic conditions, traffic restriction rules, etc.

[0090] Step b: Determine the input parameters required for task planning based on the public toilet end information, suction truck information, and road network data.

[0091] Step c: Through the pre-constructed task planning model, based on the input parameters and the set of constraint conditions, task planning is performed for all alternative suction trucks to determine the second task planning result corresponding to all alternative suction trucks and the time consumed for executing the second task planning result.

[0092] The set of constraint conditions includes one or more of the following constraints:

[0093] (1) Public toilet coverage constraint, which is used to constrain the target sewage suction tasks locked by all alternative sewage suction vehicles and can cover all target sewage suction tasks; (2) Time window constraint, which is used to constrain that the sewage suction time is within the time requirement at the public toilet end; (3) Vehicle passage condition constraint, which is used for alternative sewage suction vehicles to be able to pass to the public toilet end; (4) Vehicle load constraint, which is used to constrain that the sum of the capacity requirements of all the locked sewage suction tasks of any alternative sewage suction vehicle is less than the capacity of this alternative sewage suction vehicle; (5) Vehicle working duration constraint, which is used to constrain that the sum of the sewage suction times of all the locked sewage suction tasks of any alternative sewage suction vehicle is less than the maximum working duration limit of this alternative sewage suction vehicle; (6) Traffic rule constraint, which is used to constrain alternative sewage suction vehicles to drive according to traffic rules, such as speed limits and restricted access.

[0094] Step d, based on the second task planning result, the capacities of all alternative sewage suction vehicles, and the capacity requirements corresponding to the locked sewage suction tasks of all alternative sewage suction vehicles, determine the remaining capacities of all alternative sewage suction vehicles after executing the corresponding second task planning result. In specific implementation, the remaining capacity of any alternative sewage suction vehicle is equal to the difference between the capacity of this alternative sewage suction vehicle and the capacity requirements corresponding to all the locked sewage suction tasks of it.

[0095] Step 2, based on a preset mechanism and the demand priority planning results corresponding to all alternative sewage suction vehicles for the target sewage suction tasks, determine the binding priorities corresponding to all alternative competition requests for the target sewage suction tasks. Among them, the binding priority is negatively correlated with the path length of the second task planning result and the consumption duration for the alternative sewage suction vehicle to execute the second task planning result, and is positively correlated with the remaining capacity of the alternative sewage suction vehicle after executing the second task planning result.

[0096] In one example, the first priority of each alternative competition request can be determined respectively based on the path length, the second priority of each alternative competition request can be determined based on the consumption duration, the third priority of each alternative competition request can be determined based on the remaining capacity, and then the first priority, the second priority, and the third priority are weighted and fused to obtain the binding priority corresponding to each alternative competition request.

[0097] Step 3, based on the binding priority, determine the target competition request among all alternative competition requests for the target sewage suction task.

[0098] After determining the target sewage suction vehicle corresponding to each target sewage suction task, each target sewage suction task can be locked with the corresponding target sewage suction vehicle to prevent other sewage suction vehicles from sending competition requests for this target sewage suction task again.

[0099] For the foregoing step S108, the embodiments of the present invention provide an implementation manner of generating a first task planning result based on all the sewage suction tasks locked by the target sewage suction vehicle. The second task planning result corresponding to the target sewage suction vehicle can be used as the first task planning result executable by the target sewage suction vehicle, or a new first task planning result can be generated based on all the sewage suction tasks locked by the target sewage suction vehicle. The embodiments of the present invention will not elaborate on this anymore.

[0100] Further, the first task planning result can be sent to the associated terminal corresponding to the sewage suction vehicle, so that the operator of the sewage suction vehicle can drive along the sewage suction operation route displayed on the associated terminal and go to the corresponding public toilet for sewage suction according to the location and sewage suction time. In one example, when the associated terminal of the sewage suction vehicle receives the first task planning result, it can respond to the start operation for the first task planning result, enter the navigation interface, guide the operator to drive the sewage suction vehicle according to the sewage suction operation route, and issue a prompt when reaching the corresponding public toilet to prompt the operator to perform the sewage suction function for the public toilet. In addition, it can also respond to the viewing operation for the sewage suction time to prompt the operator to perform the sewage suction operation on each public toilet within the acceptable time range.

[0101] In summary, the method for scheduling a public toilet sewage suction vehicle based on a locking mechanism provided by the embodiments of the present invention has at least the following advantages:

[0102] 1. Dynamically adjust the sewage suction frequency of public toilets according to the manure storage situation of public toilets, improve the sewage suction efficiency of public toilets, and reduce the waste of sewage suction vehicle resources and labor resources.

[0103] 2. Improve the accuracy and response speed of public toilet sewage suction management through real-time monitoring data analysis of the number of people and the locking mechanism.

[0104] 3. Reduce the workload of manual inspections, reduce labor costs, and improve the work efficiency of inspection personnel.

[0105] 4. By optimizing the sewage suction operation route of the sewage suction vehicle, reduce the driving mileage, empty driving mileage and waiting time, and reduce fuel consumption and environmental pollution.

[0106] 5. Online supervision of public toilet sewage suction operations, and online recording of operation data.

[0107] Based on the foregoing embodiments, the embodiments of the present invention provide a device for a method for scheduling a public toilet sewage suction vehicle based on a locking mechanism. The device is applied to a scheduling server. Refer to Figure 3 the structural schematic diagram of a device for a method for scheduling a public toilet sewage suction vehicle based on a locking mechanism shown in

[0108] A task receiving module 302, configured to receive a sewage suction task to be processed from a public toilet terminal, where the sewage suction task to be processed includes a time requirement, a location, and a capacity requirement;

[0109] A request receiving module 304, configured to receive a competition request from a sewage suction vehicle, where the competition request includes the sewage suction tasks locked by the sewage suction vehicle and the capacity of the sewage suction vehicle;

[0110] A locking module 306, configured to determine a target competition request from all alternative competition requests for a target sewage suction task based on a preset mechanism, the target sewage suction task, and all alternative competition requests for the target sewage suction task, and lock the target sewage suction vehicle corresponding to the target competition request with the target sewage suction task;

[0111] A planning module 308, configured to generate a first task planning result based on all the sewage suction tasks locked by the target sewage suction vehicle, and send the first task planning result to the target sewage suction vehicle, where the first task planning result is used to describe a sewage suction route, the location of the public toilet terminal, and the sewage suction time.

[0112] The public toilet sewage suction vehicle scheduling device based on a locking mechanism provided by an embodiment of the present invention, after receiving the sewage suction task to be processed from the public toilet terminal and the competition request from the sewage suction vehicle, combines the locking mechanism, and determines, according to a preset mechanism, the target sewage suction task, and all alternative competition requests for the target sewage suction task, the target sewage suction vehicle locked with the target sewage suction task, and then obtains the corresponding first task planning result, thereby effectively improving the sewage suction efficiency of the public toilet, reducing the sewage suction vehicle resources, etc., and significantly improving the accuracy and response speed of the public toilet sewage suction management.

[0113] In an implementation manner, the locking module 306 is specifically configured to:

[0114] Generate a demand priority planning result corresponding to all alternative sewage suction vehicles based on the target sewage suction task and the sewage suction tasks locked by the alternative sewage suction vehicles corresponding to all alternative competition requests for the target sewage suction task, where the demand priority planning result includes a second task planning result, the duration consumed by the alternative sewage suction vehicle to execute the second task planning result, and the remaining capacity of the alternative sewage suction vehicle after executing the second task planning result;

[0115] Determine the binding priority corresponding to all alternative competition requests for the target sewage suction task based on a preset mechanism and the demand priority planning result corresponding to all alternative sewage suction vehicles for the target sewage suction task, where the binding priority is negatively correlated with the path length of the second task planning result and the duration consumed by the alternative sewage suction vehicle to execute the second task planning result, and is positively correlated with the remaining capacity of the alternative sewage suction vehicle after executing the second task planning result;

[0116] Determine a target competition request among all alternative competition requests for the target sewage suction task based on the binding priority.

[0117] In one implementation, the number of target sewage suction tasks is one; the locking module 306 is specifically configured to:

[0118] Perform the following operations on any alternative competition request for the target sewage suction task:

[0119] Pre-bind the target sewage suction task to the alternative sewage suction vehicle corresponding to this alternative competition request;

[0120] Generate a demand priority planning result of the alternative sewage suction vehicle based on the target sewage suction task and this alternative competition request.

[0121] In one implementation, the number of target sewage suction tasks is multiple; the locking module 306 is specifically configured to:

[0122] Take the time requirement, location, and capacity requirement of the target sewage suction task, and the time requirement, location, and capacity requirement corresponding to the locked sewage suction tasks of all alternative sewage suction vehicles for the target sewage suction task as the public toilet end information; take the number, real-time status information, and basic attribute information of the alternative sewage suction vehicles corresponding to all alternative competition requests as the sewage suction vehicle information;

[0123] Determine the input parameters required for task planning from the public toilet end information, sewage suction vehicle information, and road network data;

[0124] Through a pre-constructed task planning model, perform task planning for all alternative sewage suction vehicles based on the input parameters and the set of constraint conditions to determine the second task planning results corresponding to all alternative sewage suction vehicles and the time consumed for executing the second task planning results;

[0125] Based on the second task planning results, the capacities of all alternative sewage suction vehicles, and the capacity requirements corresponding to the locked sewage suction tasks of all alternative sewage suction vehicles, determine the remaining capacities of all alternative sewage suction vehicles after executing the corresponding second task planning results.

[0126] In one implementation, the set of constraint conditions includes one or more of the following constraints:

[0127] The public toilet coverage constraint is used to ensure that the locked target sewage suction tasks of all alternative sewage suction vehicles can cover all target sewage suction tasks;

[0128] The time window constraint is used to ensure that the sewage suction time is within the time requirement at the public toilet end;

[0129] The vehicle passage condition constraint is used to ensure that the alternative sewage suction vehicle can pass to the public toilet end;

[0130] Vehicle load constraint, which is used to constrain that the sum of the capacity requirements of all to-be-sewage-sucked tasks locked by any alternative sewage-sucking vehicle is less than the capacity of the alternative sewage-sucking vehicle;

[0131] Vehicle working duration constraint, which is used to constrain that the sum of the sewage-sucking times of all to-be-sewage-sucked tasks locked by any alternative sewage-sucking vehicle is less than the maximum working duration limit of the alternative sewage-sucking vehicle;

[0132] Traffic rule constraint, which is used to constrain the alternative sewage-sucking vehicle to drive according to traffic rules.

[0133] In one implementation, it further includes a task determination module, which is used for:

[0134] Based on the capacity requirements corresponding to the public toilet end, determine the sewage-sucking priority corresponding to the public toilet end, and the sewage-sucking priority is positively correlated with the capacity requirements;

[0135] Determine at least one public toilet end to be sewage-sucked according to the sewage-sucking priority, and use the to-be-sewage-sucked tasks of the public toilet end to be sewage-sucked as the target to-be-sewage-sucked tasks.

[0136] The device provided by the embodiment of the present invention has the same implementation principle and the same technical effects as those of the foregoing method embodiment. For the sake of brief description, for the parts not mentioned in the device embodiment, reference may be made to the corresponding content in the foregoing method embodiment.

[0137] The embodiment of the present invention provides a server. Specifically, the server includes a processor and a storage device; a computer program is stored on the storage device, and the computer program executes the method according to any one of the foregoing implementations when being run by the processor.

[0138] Figure 4 It is a schematic structural diagram of a server provided by the embodiment of the present invention. The server 100 includes: a processor 40, a memory 41, a bus 42 and a communication interface 43. The processor 40, the communication interface 43 and the memory 41 are connected through the bus 42; the processor 40 is used to execute an executable module stored in the memory 41, such as a computer program.

[0139] Among them, the memory 41 may include a high-speed random access memory (RAM, Random Access Memory), and may also include a non-volatile memory, such as at least one disk memory. Through at least one communication interface 43 (which can be wired or wireless), a communication connection between the system network element and at least one other network element is realized, and the Internet, wide area network, local area network, metropolitan area network, etc. can be used.

[0140] The bus 42 can be an ISA bus, a PCI bus, an EISA bus, or the like. The bus can be divided into an address bus, a data bus, a control bus, etc. For the sake of convenience of representation, Figure 4 only a bidirectional arrow is used in Figure 4 , but it does not mean that there is only one bus or one type of bus.

[0141] Among them, the memory 41 is used to store a program. After receiving an execution instruction, the processor 40 executes the program. The method executed by the device defined by the flow process disclosed in any of the foregoing embodiments of the present invention can be applied to the processor 40 or implemented by the processor 40.

[0142] The processor 40 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the integrated logic circuit in the hardware of the processor 40 or by instructions in the form of software. The above-mentioned processor 40 can be a general-purpose processor, including a central processing unit (CPU for short), a network processor (NP for short), etc.; it can also be a digital signal processor (DSP for short), an application specific integrated circuit (ASIC for short), a field-programmable gate array (FPGA for short), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. It can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present invention. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in combination with the embodiments of the present invention can be directly embodied as being executed and completed by a hardware decoding processor, or executed and completed by a combination of hardware and software modules in the decoding processor. The software module can be located in a mature storage medium in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. This storage medium is located in the memory 41, and the processor 40 reads the information in the memory 41 and combines its hardware to complete the steps of the above method.

[0143] The computer program product of the readable storage medium provided by the embodiments of the present invention includes a computer-readable storage medium storing program code. The instructions included in the program code can be used to execute the method described in the foregoing method embodiments. For the specific implementation, reference can be made to the foregoing method embodiments and will not be elaborated herein.

[0144] If the above-mentioned functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), magnetic disks, or optical discs that can store program codes.

[0145] Finally, it should be noted that the above-mentioned embodiments are only specific implementation manners of the present invention, used to illustrate the technical solutions of the present invention, rather than limiting them. The protection scope of the present invention is not limited thereto. Although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: any person skilled in the art within the technical scope disclosed by the present invention can still modify the technical solutions recorded in the foregoing embodiments, or can easily think of changes, or perform equivalent replacements on some of the technical features; and these modifications, changes, or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention, and should all be covered by the protection scope of the present invention. Therefore, the protection scope of the present invention should be subject to the protection scope of the claims.

Claims

1. A method for dispatching a public toilet sewage suction truck based on a locking mechanism, characterized in that: The method is applied to a scheduling server, and the method comprises: Receive a task to be sucked out from a public toilet, wherein the task to be sucked out includes time requirement, location and capacity requirement; receiving a competition request from a sewage suction truck, wherein the competition request includes the sewage suction task to be locked by the sewage suction truck and the capacity of the sewage suction truck; Based on a preset mechanism, a target sewage suction task and all candidate competing requests for the target sewage suction task, a target competing request is determined among all the candidate competing requests for the target sewage suction task, and a target sewage suction truck corresponding to the target competing request is locked with the target sewage suction task; A first task planning result is generated based on all the sewage suction tasks to be locked by the target sewage suction truck, and the first task planning result is sent to the target sewage suction truck. The first task planning result is used to describe the sewage suction route, the location of the public toilet end and the sewage suction time.

2. The method for dispatching a public toilet sewage suction vehicle based on a locking mechanism according to claim 1 is characterized in that: Based on a preset mechanism, a target sewage suction task and all candidate competing requests for the target sewage suction task, determining a target competing request from all the candidate competing requests for the target sewage suction task includes: Based on the target sewage suction task and the locked sewage suction task of the alternative sewage suction truck corresponding to all the alternative competing requests for the target sewage suction task, generate the demand priority planning results corresponding to all the alternative sewage suction trucks, the demand priority planning results including the second task planning result, the time consumed by the alternative sewage suction truck to execute the second task planning result, and the remaining capacity of the alternative sewage suction truck after executing the second task planning result; Based on a preset mechanism and the demand priority planning results corresponding to all the alternative sewage suction trucks for the target sewage suction task, a binding priority corresponding to all the alternative competing requests for the target sewage suction task is determined, wherein the binding priority is negatively correlated with the path length of the second task planning result and the time taken by the alternative sewage suction truck to execute the second task planning result, and is positively correlated with the remaining capacity of the alternative sewage suction truck after executing the second task planning result; Based on the binding priority, a target competing request is determined among all the candidate competing requests for the target sewage suction task.

3. The method for dispatching a public toilet sewage suction vehicle based on a locking mechanism according to claim 2 is characterized in that: The number of the target sewage suction tasks to be sucked is one; based on the target sewage suction tasks to be sucked and the sewage suction tasks to be sucked that have been locked by the alternative sewage suction trucks corresponding to all the alternative competing requests for the target sewage suction tasks, the demand priority planning results corresponding to all the alternative sewage suction trucks are generated, including: The following operations are performed on any candidate competing request for the target sewage suction task: Pre-binding the target sewage suction task to be processed to the alternative sewage suction truck corresponding to the alternative competition request; Based on the target sewage suction task and the alternative competition request, a demand priority planning result of the alternative sewage suction truck is generated.

4. The method for dispatching a public toilet sewage suction vehicle based on a locking mechanism according to claim 2 is characterized in that: The number of the target sewage suction tasks to be sucked is multiple; based on the target sewage suction tasks to be sucked and the sewage suction tasks to be sucked that have been locked by the alternative sewage suction trucks corresponding to all the alternative competitive requests for the target sewage suction tasks, the demand priority planning results corresponding to all the alternative sewage suction trucks are generated, and further comprising: The time requirement, location and capacity requirement of the target task to be sucked away, as well as the time requirement, location and capacity requirement corresponding to the task to be sucked away that all the candidate sewage suction trucks have locked for the target task to be sucked away are used as public toilet end information; the number, real-time status information and basic attribute information of the candidate sewage suction trucks corresponding to all the candidate competition requests are used as sewage suction truck information; Determine the input parameters required for task planning by using the public toilet information, the sewage suction truck information and the road network data; Through the pre-constructed task planning model, based on the input parameters and the constraint condition set, task planning is performed for all the candidate sewage suction trucks to determine the second task planning results corresponding to all the candidate sewage suction trucks and the time consumed to execute the second task planning results; Based on the second task planning result, the capacity of all the alternative sewage suction trucks, and the capacity requirements corresponding to the pending sewage suction tasks that have been locked by all the alternative sewage suction trucks, the remaining capacity of all the alternative sewage suction trucks after executing the corresponding second task planning result is determined.

5. The method for dispatching a public toilet sewage suction vehicle based on a locking mechanism according to claim 4 is characterized in that: The constraint set includes one or more of the following constraints: The public toilet coverage constraint is used to constrain the target sewage suction tasks that have been locked by all the alternative sewage suction vehicles, and can cover all the target sewage suction tasks; A time window constraint, used to constrain the sewage suction time to be within the time requirement at the public toilet end; Vehicle traffic condition constraints, used for the alternative sewage suction truck to pass to the public toilet end; The vehicle load constraint is used to constrain the sum of the capacity requirements of all the pending sewage suction tasks locked by any of the alternative sewage suction trucks to be less than the capacity of the alternative sewage suction truck; The vehicle working time constraint is used to constrain the sum of the sewage suction time of all the sewage suction tasks to be locked by any of the alternative sewage suction vehicles to be less than the maximum working time limit of the alternative sewage suction vehicle; Traffic rule constraints are used to constrain the alternative sewage suction truck to travel in accordance with traffic rules.

6. The method for dispatching a public toilet sewage suction vehicle based on a locking mechanism according to claim 1, characterized in that: Based on a preset mechanism, a target task to be sucked out, and all candidate competing requests for the target task to be sucked out, before determining a target competing request from all the candidate competing requests for the target task to be sucked out, the method further includes: Based on the capacity demand corresponding to the public toilet end, determining the sewage suction priority corresponding to the public toilet end, wherein the sewage suction priority is positively correlated with the capacity demand; At least one public toilet end to be sucked out is determined according to the sewage suction priority, and the sewage suction task to be sucked out of the public toilet end to be sucked out is used as a target sewage suction task.

7. A public toilet sewage suction truck dispatching device based on a locking mechanism, characterized in that: The device is applied to a scheduling server, and the device includes: A task receiving module is used to receive the task of sewage suction from the public toilet, wherein the task of sewage suction includes time requirement, location and capacity requirement; A request receiving module, used for receiving a competition request from a sewage suction truck, wherein the competition request includes the sewage suction task to be locked by the sewage suction truck and the capacity of the sewage suction truck; A locking module, for determining a target competing request among all the alternative competing requests for the target sewage suction task based on a preset mechanism, a target sewage suction task, and all the alternative competing requests for the target sewage suction task, and locking a target sewage suction truck corresponding to the target competing request with the target sewage suction task; A planning module is used to generate a first task planning result based on all the sewage suction tasks to be locked by the target sewage suction truck, and send the first task planning result to the target sewage suction truck. The first task planning result is used to describe the sewage suction route, the location of the public toilet end and the sewage suction time.

8. The public toilet sewage suction vehicle dispatching device based on the locking mechanism according to claim 7 is characterized in that: The locking module is specifically used for: Based on the target sewage suction task and the locked sewage suction task of the alternative sewage suction truck corresponding to all the alternative competing requests for the target sewage suction task, generate the demand priority planning results corresponding to all the alternative sewage suction trucks, the demand priority planning results including the second task planning result, the time consumed by the alternative sewage suction truck to execute the second task planning result, and the remaining capacity of the alternative sewage suction truck after executing the second task planning result; Based on a preset mechanism and the demand priority planning results corresponding to all the alternative sewage suction trucks for the target sewage suction task, a binding priority corresponding to all the alternative competing requests for the target sewage suction task is determined, wherein the binding priority is negatively correlated with the path length of the second task planning result and the time taken by the alternative sewage suction truck to execute the second task planning result, and is positively correlated with the remaining capacity of the alternative sewage suction truck after executing the second task planning result; Based on the binding priority, a target competing request is determined among all the candidate competing requests for the target sewage suction task.

9. A server, characterized in that: The method comprises a processor and a memory, wherein the memory stores computer executable instructions that can be executed by the processor, and the processor executes the computer executable instructions to implement the method according to any one of claims 1 to 6.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are called and executed by a processor, the computer-executable instructions prompt the processor to implement the method according to any one of claims 1 to 6.

Images