Task distribution method, device, electronic device and storage medium

Abstract

The present invention provides a task distribution method, device, electronic device and storage medium, and relates to the field of computers. The task distribution method includes: obtaining the maximum number of houses to be issued target tasks, first receivable information and first sendable information of the first house to which the target task can be issued; initializing the second receivable information and the task quantity information corresponding to the first house based on the first receivable information and the first sendable information; determining the task issuance information based on the second receivable information and the task quantity information using a backpack algorithm; and issuing the target task for the target house indicated by the target house identifier to each broker's terminal in the task issuance information. The present application uses a backpack algorithm to select at least one target house with the largest number of target tasks to be issued from the houses to which the target tasks can be issued, and then issues the target tasks for each target house, thereby ensuring the number of target tasks issued and improving the utilization rate of the target tasks.

Description

Technical Field

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

[0002] With the popularization of the Internet, there are more and more online trading platforms for providing transactions of various commodities. For example, there are real estate trading platforms for providing transactions of real estate and related industries. Real estate agents, referred to as brokers, publish house information of houses to be traded on real estate trading platforms, so that users can determine the houses they want to trade by browsing the published house information. Among them, multiple house posts published by multiple brokers may be used to display the same house, and multiple brokers may also come from different brokerage companies.

[0003] In order to better verify the accuracy of the housing information published on the real estate transaction platform, the platform management device can issue a housing information confirmation task for the target housing source published by the broker to the broker's terminal (for example, a housing status confirmation task to confirm whether the housing source is still available for rent or purchase), so that the broker responds to the housing information confirmation task through the terminal and returns the accurate housing information of the target house to the platform management device (for example, confirming that the housing source is still available for rent or purchase for the housing status confirmation task, etc.). In addition, considering the workload of the broker, there is usually an upper limit on the number of housing information confirmation tasks that each broker can receive, and the number of housing sources involved in the issued housing information confirmation tasks also has an upper limit. For example, each broker can receive up to two housing information confirmation tasks per day, and issue up to four housing information confirmation tasks per day.

[0004] At present, one or more brokers corresponding to each property on the real estate transaction platform are usually drawn in random order, and after verifying that all brokers of the same brokerage company have not reached the receiving upper limit of the property information confirmation task, a property information confirmation task is issued to the terminals of all brokers of the brokerage company. The property information confirmation task is used to verify the accuracy of the property information of the currently drawn property.

[0005] However, since there are overlaps between brokers of multiple listings on the real estate trading platform, the brokers corresponding to the listings that are drawn multiple times may be the same. However, the number of house information confirmation tasks that each broker can receive is capped, and the number of listings involved in the issued house information confirmation tasks is also capped. Therefore, there are cases where the house information confirmation tasks cannot be issued for the listings that are drawn later because the number of tasks received by the broker has reached the upper limit. This results in the house information confirmation tasks for a small number of listings taking up the broker's task receiving share first, resulting in a small number of house information confirmation tasks being issued overall and a low task utilization rate. Summary of the invention

[0006] In view of this, the present application provides a task distribution method, device, electronic device and storage medium, which to a certain extent improve the overall number of house information confirmation tasks issued, thereby increasing the task utilization rate.

[0007] According to a first aspect of the present application, a task distribution method is provided, the method comprising:

[0008] Obtaining the maximum number of properties to be issued a target task, first receivable information, and first receivable information of a first property to which the target task can be issued, wherein the target task is a task sent to a broker for a property that the broker has published, the first receivable information includes: the number of target tasks that each broker can receive and the property identifier of the target property, the target property is a property to which the target task can be issued, the first receivable information includes: the first task number and the first broker identifier, the first broker indicated by the first broker identifier has published the first property, and the number of target tasks that can be received after publishing the first property is greater than 0, and the first task number is the total number of target tasks that the first broker can receive for the first property;

[0009] Initialize second receivable information and task quantity information corresponding to the first house source based on the first receivable information and the first sendable information, wherein the second receivable information includes: when the total number of first houses to be sent target tasks is 0 to the maximum number of houses, the house source identifiers of the target houses of each of the brokers corresponding to each other, and the task quantity information includes: when the total number of the first houses is 1 to the maximum number of houses, the task quantity information corresponding to each other for the target tasks of the first houses corresponding to each other;

[0010] Based on the second receivable information and the task quantity information, a backpack algorithm is used to determine task delivery information, wherein the task delivery information includes: a target property source identifier of the target property source of each of the brokers when the task quantity of the target task to be delivered is the largest;

[0011] The target task for the target house indicated by the target house identifier is issued to each of the broker's terminals in the task issuance information.

[0012] According to a second aspect of the present application, a task distribution device is provided, the device comprising:

[0013] an acquisition module, for acquiring a maximum number of houses to be issued a target task, first receivable information, and first receivable information of a first house to which the target task can be issued, wherein the target task is a task sent to a broker for a house that the broker has published, the first receivable information includes: the number of target tasks that each broker can receive and a house identifier of a target house, the target house is a house to which the target task can be issued, the first receivable information includes: a first task number and a first broker identifier, the first broker indicated by the first broker identifier has published the first house, and the number of target tasks that can be received after publishing the first house is greater than 0, and the first task number is the total number of target tasks that the first broker can receive for the first house;

[0014] an initialization module, configured to initialize second receivable information and task quantity information corresponding to the first house source based on the first receivable information and the first sendable information, wherein the second receivable information includes: when the total number of first houses to be sent target tasks is 0 to the maximum number of houses, the house source identifiers of the target houses of each of the brokers corresponding respectively, and the task quantity information includes: when the total number of the first houses is 1 to the maximum number of houses, the task quantity information corresponding respectively to the target tasks for the first houses;

[0015] an algorithm processing module, configured to determine task delivery information by using a backpack algorithm based on the second receivable information and the task quantity information, wherein the task delivery information includes: a target property source identifier of the target property source of each of the brokers when the task quantity of the target task to be delivered is the largest;

[0016] The sending module is used to send the target task for the target house indicated by the target house identifier to each of the broker's terminals in the task sending information.

[0017] According to the third aspect of the present application, an electronic device is provided, comprising: a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein when the computer program is executed by the processor, the steps of the task distribution method described in any one of the first aspects are implemented.

[0018] According to a fourth aspect of the present application, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps of the task distribution method as described in any one of the first aspects are implemented.

[0019] According to the fifth aspect of the present application, an electronic device is provided, comprising: a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the steps of the task distribution method as described in any one of the first aspects are implemented.

[0020] With respect to the related technologies, this application has the following advantages:

[0021] The task distribution method, device and electronic device provided in the embodiments of the present application can determine the task distribution information through the backpack algorithm when the broker has a limit on the number of target tasks that can be received, and the number of houses involved in the target tasks to be distributed also has an upper limit (i.e., the maximum number of houses), so as to select at least one target house that maximizes the number of target tasks to be distributed from the houses to which the target tasks can be distributed, and then distribute the target tasks for the target houses to the terminals of the brokers corresponding to each target house. The number of target tasks distributed is guaranteed, and the utilization rate of the target tasks is improved. For example, in the case where the target task is a house information confirmation task, the technical solution of the present application guarantees a relatively high overall number of house information confirmation tasks distributed, so that the task utilization rate is relatively high. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] Figure 1 is a flowchart of a task distribution method provided by an embodiment of the present application;

[0023] Figure 2 is a flowchart of another task distribution method provided by an embodiment of the present application;

[0024] Figure 3 is a block diagram of a task distribution device provided in an embodiment of the present application;

[0025] Figure 4 It is a block diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0026] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0027] The embodiment of the present application provides an implementation environment of a task distribution method. The implementation environment includes: a platform management device and a task receiving terminal. The platform management device and the task receiving terminal are connected via a wireless network. Among them, the task receiving terminal is a broker's terminal. The broker publishes housing information with at least one house source. The platform management device is used to send a target task for a house source published by the broker to the task receiving terminal. Optionally, the platform management device can be an electronic device such as a mobile phone, a personal computer, a tablet computer, a server or a cloud server cluster. The task receiving terminal can be a terminal such as a mobile phone, a personal computer, a tablet computer or a wearable device.

[0028] In an optional housing application scenario, a housing transaction platform is run on the platform management device, which is used to perform management tasks of the housing transaction platform. The platform management device can send a target task for a house source published by a broker to the task receiving terminal regularly or after receiving a trigger operation. In this scenario, the target task can be used by the broker to verify the accuracy of the house information of the house source published by the broker on the housing transaction platform. For example, after the task receiving terminal receives the target task, the broker clicks the displayed confirmation control on the task receiving terminal, so that the task receiving terminal receives the click operation for the confirmation control, and sends a confirmation response to the platform management device, which is used to indicate that the house source information corresponding to the target task is accurate. Alternatively, the broker clicks the displayed information error control on the task receiving terminal, so that the task receiving terminal receives the click operation for the information error control, and sends an information error response to the platform management device, which is used to indicate that the house source information corresponding to the target task is incorrect.

[0029] It should be noted that a broker can publish one or more posts for the same property, and the posts are used to introduce the property information. Similarly, multiple brokers can also publish posts for the same property to introduce the property information in the posts.

[0030] Please refer to Figure 1 , which shows a flowchart of a task distribution method provided by an embodiment of the present application. The task distribution method can be applied to Figure 1 The implementation environment shown is executed by the platform management device. The following takes the application of the task distribution method to the housing application scenario as an example. Figure 1 As shown, the task distribution method includes:

[0031] Step 101: Obtain the maximum number of houses to be issued for the target task, the first receivable information, and the first deliverable information of the first house to which the target task can be issued.

[0032] Among them, the maximum number of houses refers to the maximum number of houses to be issued target tasks. That is, the maximum number of houses to be issued target tasks, that is, the upper limit of the number of houses to be issued target tasks. For example, if the platform management device allows a maximum of 5 houses to be issued during a single task distribution process, the maximum number of houses is 5. The target task is a task issued to the broker for a house that has been published. For example, the target task can be the aforementioned house information confirmation task, which is used by the house broker to verify the accuracy of the house information published on the real estate transaction platform.

[0033] The first receivable information is used to record the number of target tasks that each broker on the housing transaction platform can still receive and the housing sources that each broker has published to which the target tasks can be issued. Specifically, the first receivable information may include: the number of target tasks that each broker can receive and the housing source identification of the target housing source. The target housing source is the housing source that can issue the target task among all the housing sources that the broker has published on the housing transaction platform. That is, in the case where the target task is a housing information confirmation task, the housing source that can issue the target task may refer to the housing source whose housing information accuracy has not been verified. The first housing source is the first housing source among all the housing sources to which the target task can be issued. The first housing source is any housing source among all the housing sources that can issue the target task.

[0034] For example, on a housing transaction platform, broker A publishes listings A, B, and C; broker B publishes listings B and C. The listings to which target tasks can be issued on the housing transaction platform include: listing A, listing B, and listing C.

[0035] If the upper limit of the number of target tasks that each broker can receive is 2, and both broker A and broker B have received the target task for property B (the target task for property B has been issued), then the properties that can issue target tasks on the real estate trading platform are changed to property A and property C. The first receivable information includes: the number of target tasks that broker A can receive is 1, and broker A's target properties are property A and property C; the number of target tasks that broker B can receive is 1, and broker A's target property is property C.

[0036] The first sendable information is used to record the total number of target tasks that can be sent for the first house source and the first broker who has published the first house source. Specifically, the first sendable information includes: the number of first tasks and the first broker identifier. The first broker indicated by the first broker identifier has published the first house source, and the number of target tasks that can be received after publishing the first house source is greater than 0. The first task number is the number of first brokers, that is, the total number of target tasks that can be sent for the first house source. For example, if there are 5 brokers who have published the first house source on the housing transaction platform, and the number of target tasks that can be received by the 5 brokers is greater than 0 (that is, the number of target tasks received by the 5 brokers has not reached the receiving upper limit), then the 5 brokers can all receive the target tasks of the first house source. Accordingly, the total number of target tasks that can be sent for the first house source is 5.

[0037] In an optional implementation, the platform management device may obtain the first receivable information by the implementation process including: the platform management device determines the house source to which the target task can be issued and all the brokers associated with it. Count the first number of received target tasks of each broker among all the brokers. Determine the number of target tasks that each broker can receive according to the task issuance rule and the first number, and determine the house source identifier of the target house source of each broker, and generate the first receivable information.

[0038] The task distribution rule is also used to limit the maximum number of target tasks that each broker can receive in a single task distribution process, that is, the upper limit of the number of target tasks that each broker can receive. The number of target tasks that a broker can receive is the difference between the maximum number and the first number corresponding to the broker.

[0039] For example, the listings of the listings to which target tasks can be issued are identified as: Listing A, Listing B, and Listing C. Broker A has published Listing A. Broker B has published Listing A and Listing B. Broker C has published Listing C. Assume that the task issuance rule limits the maximum number of target tasks that each broker can receive in a single task distribution process to 2, and the first numbers of issued target tasks of Broker A, Broker B, and Broker C are 0, 1, and 2, respectively. Then the first receivable information includes: the numbers of target tasks that Broker A, Broker B, and Broker C can receive are 2, 1, and 0, respectively. And Broker A's target listing is Listing A, Broker B's target listings are Listing A and Listing B, and Broker C's target listing is Listing C.

[0040] In another optional implementation, the implementation process of the platform management device obtaining the first sendable information of the first house listing may include: obtaining the first broker identifier of the first broker who has published the first house listing from the first receivable information, and counting the number of first broker identifiers as the first task number.

[0041] Further optionally, the platform management device may also determine the first dispatchable information based on the first receivable information and the task dispatching rule, wherein the task dispatching rule is used to define the conditions for dispatching the target task to each house source.

[0042] For example, the task issuing rule is used to define the condition for issuing the target task for each house source: issuing the target task for the house source to the terminal of the target broker who has published the house source. The target broker is all brokers of the target brokerage company among all brokers who have published the house source, and the number of target tasks that can be received by all brokers of the target brokerage company is greater than 0.

[0043] The platform management device obtains the first broker who has published the first house from the first receivable information, divides the first broker according to the brokerage company to which they belong, and obtains at least one first broker set. For each first broker set, it is determined whether the number of receivable target tasks corresponding to each first broker identifier in the first broker set is greater than 0. If so, the first broker set is used as the target broker set. The second number of first broker identifiers in the target broker set is counted to generate the first sendable information. The first sendable information includes: the first broker identifier in the target broker set and the first task number, and the first task number is the second number.

[0044] If the number of receivable target tasks corresponding to each first broker identifier in each first broker set is less than or equal to 0, the platform management device can reselect the first property from the properties to which the target tasks can be issued, and re-determine the first sendable information based on the first receivable information and the task issuing rules.

[0045] Step 102: based on the first receivable information and the first sendable information, initialize the task quantity information corresponding to the second receivable information and the first house source.

[0046] The second receivable information includes: when the total number of first houses to be issued for the target task is 0 to the maximum number of houses, the house identifiers of the target houses of each broker corresponding to each other.

[0047] Optionally, the data structure of the second receivable information may be a map. The second receivable information includes TS key-value pairs, where TS (i.e., totalSize) represents the maximum number of properties. Multiple key-value pairs correspond one-to-one to the total number of first properties for the target task to be issued, and the total number of first properties may correspond to 1 to the maximum number of properties. Any key-value group is used to store the property identifier of the target property of each broker. The key field of each key-value pair is used to store the broker identifier, and the value field is used to store the property identifier of the target property that has been published by the corresponding broker identifier.

[0048] For example, the second receivable information includes TS+1 first information, specifically including: Map<broker ID, target property ID>[0], Map<broker ID, target property ID>[1], Map<broker ID, target property ID>[p] to Map<broker ID, target property ID>[TS], a total of TS key-value pairs, TS≥p≥0. Map<broker ID, target property ID>[p] records the property ID of the target property of each broker when the total number of first properties to be issued the target task is p.

[0049] Among all the properties to be issued target tasks, the task quantity information of the i+1th property is used to record the task quantity of the target tasks corresponding to the first property number to be issued target tasks when the total number of properties to be issued target tasks is 0 to the maximum property number, and the total property number (skuNum, i.e. SN)>i≥0. The task quantity is the sum of the target tasks for the first property to the i+1th property. The total property number refers to the number of all properties to which target tasks can be issued.

[0050] Optionally, the data structure of the task quantity information can be a two-dimensional array. The element [i][j] in the two-dimensional array is the maximum number of target tasks issued for the 1st to i+1th houses when the total number of the first houses to be issued for the target tasks is j, 0≤j≤maximum number of houses TS. For example, the task quantity information for the i+1th house includes TS+1 second information, specifically including dp[i][0], dp[i][1], ..., dp[i][j], ..., dp[i][TS]. Among them, dp[i][0] is the first second information, dp[i][j] is the j+1th second information, and dp[i][TS] is the TS+1th second information.

[0051] Correspondingly, the task quantity information corresponding to the first house source includes dp[0][0], dp[0][1], ..., dp[0][j], ..., dp[0][TS]. That is, the task quantity information corresponding to the first house source includes: when the total number of first houses is 0 to the maximum number of houses, the task quantity corresponding to the target task of the first house source is respectively. For example, for the task quantity information dp[0][j] of the first house source, when the total number of first houses is 1 to the maximum number of houses, the task quantity corresponding to the first house source is dp[0][1], dp[0][2] ... dp[0][TS].

[0052] Optionally, the process of the platform management device initializing the second receivable information and the task quantity information corresponding to the first house source based on the first receivable information and the first sendable information may include the following steps 1021 to 1023.

[0053] In step 1021, the listing identifier of each broker in the second receivable information when the total number of first listings to be issued target tasks is 0 is determined as the listing identifier of the corresponding broker in the first receivable information.

[0054] For example, the platform management device determines the key-value pair corresponding to the total number of first properties to be issued the target task in the second receivable information as 0: Map<agent ID, property ID of target property>[0], as the property ID of the corresponding agent in the first receivable information.

[0055] For example, assuming that the first receivable information includes: the listing identifiers of the target listings of broker A include listing A, the listing identifiers of the target listings of broker B include listing A and listing B, and the listing identifiers of the target listings of broker C include listing C. Then, in the second receivable information, when the total number of first listings to be issued for the target task is 0, the listing identifiers of the target listings of broker A include listing A, the listing identifiers of the target listings of broker B include listing A and listing B, and the listing identifiers of the target listings of broker C include listing C.

[0056] In the second receivable information, when the total number of the first properties to be issued for the target task is 0, the corresponding key-value pair Map<broker ID, property ID of the target property>[0] includes: <broker A, property A>, <broker B, properties A and property B>, <broker C, property C>.

[0057] In step 1022, based on the first deliverable information of the first house source, the house source identifier of each broker corresponding to the second receivable information is determined when the total number of first houses to be delivered target tasks is 1 to the maximum number of houses.

[0058] In an optional implementation, the platform management device, based on the first deliverable information of the first house, determines the house source identifier of the first broker corresponding to each of the first houses in the second receivable information as the house source identifier of the first house when the total number of first houses to be sent target tasks is 1 to the maximum number of houses respectively.

[0059] In another optional implementation, the platform management device combines the first sendable information and the first receivable information to obtain combined received information, and the combined received information includes: the housing source identifier corresponding to each broker. In the combined received information, the housing source identifier corresponding to the first broker includes: the housing source identifier of the first housing source and the housing source identifier corresponding to the first broker recorded in the first receivable information.

[0060] Continuing with the above example, it is assumed that the first receivable information includes: the property identification of the target property of broker A includes property A, the property identification of the target property of broker B includes property A and property B, and the property identification of the target property of broker C includes property C. The first sendable information of the first property includes: the first broker identification is broker A.

[0061] The combined received information includes: the listing ID of the target listing of broker A includes listing A, the listing ID of the target listing of broker B includes listing A and listing B, and the listing ID of the target listing of broker C includes listing C. In the second receivable information, when the total number of first listings is 1 to the maximum number of listings, the corresponding key-value pairs Map<broker ID, listing ID of target listing>[1], Map<broker ID, listing ID of target listing>[2]...Map<broker ID, listing ID of target listing>[totalSize] all include: <broker A, listing A>, <broker B, listing A and listing B>, <broker C, listing C>.

[0062] In step 1023, in the task quantity information of the first housing source, when the total number of first housing sources to which the target tasks are to be issued is 1 to the maximum number of housing sources, the corresponding number of tasks for the first housing source is determined as the first task number.

[0063] For example, the platform management device determines the values ​​of dp[0][1], dp[0][1]...dp[0][TS] included in the task quantity information of the first house as: the first task number in the first dispatchable information. The platform management device determines the value of the first second information dp[0][1] in the task quantity information of the first house as 0. That is, the platform management device determines the corresponding task quantity for the first house as 0 in the task quantity information of the first house when the total number of the first house to be dispatched with the target task is 0.

[0064] Step 103: Based on the second receivable information and the task quantity information, a backpack algorithm is used to determine the task issuing information. The task issuing information includes: the target property source identifier of each broker's target property source when the task quantity of the target task to be issued is the largest.

[0065] Among them, the knapsack algorithm is an algorithm for solving the 0-1 knapsack problem. In the 0-1 knapsack problem, multiple items and a knapsack with a volume of V are provided, and each item has a volume c and a value w. In the process of solving the 0-1 knapsack problem, it is necessary to select items to be put into the knapsack without duplication, so that the sum of the values ​​of the items in the knapsack is the highest under the premise that the sum of the volumes of the items in the knapsack does not exceed the volume of the backpack V. 0 and 1 represent two possible states of an item, 0 represents that the item is not selected to be put into the knapsack, and 1 represents that the item is selected to be put into the knapsack.

[0066] In an embodiment of the present application, by adopting a knapsack algorithm, the process of determining task delivery information is converted into a process of solving a 0-1 knapsack problem. In the determination process, the maximum number of houses to be delivered with target tasks is equivalent to the volume V of the knapsack, and each house to which the target tasks can be delivered is equivalent to the items to be put into the knapsack. The number of tasks of the house is equivalent to the value w of the item. The number of house identifications of the house is equivalent to the volume of the item. By solving the 0-1 knapsack problem, multiple houses can be selected from multiple houses to which the target tasks can be delivered, and the sum of the number of target tasks for the selected multiple houses (i.e., the value of the items) is the largest.

[0067] Optionally, the process of the platform management device using a backpack algorithm to determine the task delivery information based on the second receivable information and the task quantity information may include the following steps 1031 to 1032. In the process of using a backpack algorithm to determine the task delivery information based on the second receivable information and the task quantity information, i is greater than 0.

[0068] In step 1031, for the i+1th house source to which the target task can be issued, the second receivable information is updated based on the second receivable information and the task quantity information corresponding to the i-th house source to which the target task can be issued.

[0069] The second receivable information includes TS+1 first information, specifically including: Map<agent ID, target property ID>[0], Map<agent ID, target property ID>[1], ..., Map<agent ID, target property ID>[TS]. The task quantity information corresponding to the i-th property includes TS+1 first information, specifically including dp[i-1][0], dp[i-1][1], ..., dp[i-1][TS]. The updated second receivable information includes: when the sum of the task quantities of the target tasks to be issued for the 1st property to the i+1th property is the largest, when the total number of the first properties to be issued for the target tasks is 1 to the maximum number of properties, the property IDs of the target properties of each agent corresponding to each agent.

[0070] In an optional implementation, the platform management device may include the following steps S1 to S7 in the process of updating the second receivable information based on the second receivable information and the task quantity information corresponding to the i-th property to which the target task can be issued.

[0071] In step S1, the total number of first listings j is determined to be 1.

[0072] In step S2, based on the jth first information in the second receivable information, the second sendable information of the i+1th house is determined.

[0073] Among them, the jth first information (Map<broker ID, target property ID>[j-1]) is the property ID of the target property of each broker in the second receivable information when the total number of first properties is j-1. The second information that can be sent includes: the second task number and the second broker ID. The second broker indicated by the second broker ID has published the i+1th property, and the number of target tasks that can be received after publishing the i+1th property is greater than 0. The second task number is the total number of target tasks that the second broker can receive for the i+1th property.

[0074] In an optional implementation, the platform management device can obtain the broker identifier who published the (i+1)th property listing from the jth first information as the second broker identifier, and count the number of second broker identifiers as the second task number to generate second sendable information.

[0075] In another optional implementation, the platform management device may determine the second sendable information of the (i+1)th property based on the jth first information and the task sending rule.

[0076] For example, the task issuing rule is used to define the condition for issuing the target task for each house source: issuing the target task for the house source to the terminal of the target broker who has published the house source. The target broker is all brokers of the target brokerage company among all brokers who have published the house source, and the number of target tasks that can be received by all brokers of the target brokerage company is greater than 0.

[0077] The platform management device obtains the broker identification of the broker who published the (i+1)th house listing from the jth first information, divides the broker identification according to the brokerage company to which the broker belongs, and obtains at least one broker set. For each broker set, it is determined whether the number of receivable target tasks corresponding to each broker identification in the broker set is greater than 0. If so, the broker set is used as the target broker set. The broker identification in the target broker set is used as the second broker identification, and the number of the second broker identification in the target broker set is counted as the second task number to generate the second sendable information.

[0078] In another optional implementation, before executing step S2 to determine the second sendable information of the i+1th property based on the jth first information in the second receivable information, the platform management device may update the second receivable information based on the second receivable information and the task quantity information corresponding to the i-th property to which the target task can be sent, and the process may also include: step S01 and step S02.

[0079] In step S01, the platform management device may first determine whether the target task for the i+1th house source can be issued based on the jth first information in the second receivable information and the task issuance rule. If yes, the platform management device executes step S2 to determine the second issueable information for the i+1th house source based on the jth first information in the second receivable information. If not, the platform management device executes step S02.

[0080] Specifically, optionally, the process of determining the second sendable information for the i+1th house source based on the jth first information in the second receivable information in step S2 may include: when it is determined that the target task for the i+1th house source can be sent based on the jth first information in the second receivable information and the task sending rule, determining the second sendable information for the i+1th house source based on the jth first information in the second receivable information.

[0081] In step S02, when it is determined that the target task for the i+1th house cannot be issued based on the jth first information in the second receivable information, the j+1th second information in the task quantity information of the i+1th house is updated to the total number of second tasks.

[0082] The j+1th second information dp[i][j] in the task quantity information of the i+1th house is updated to the total number of second tasks. The total number of second tasks is the j+1th second information dp[i-1][j] in the task quantity information of the i-th house. That is, the total number of second tasks is the sum of the task quantities of the target tasks for the 1st house to the i-th house when the total number of the first house is j.

[0083] For example, assume that the task issuing rule is used to define the condition for issuing the target task for each house source: issuing the target task for the house source to the terminal of the target broker who has published the house source. The target broker is all brokers of the target brokerage company among all brokers who have published the house source, and the number of target tasks that can be received by all brokers of the target brokerage company is greater than 0.

[0084] The platform management device obtains the broker identification of the broker who published the i+1th house from the jth first information Map<broker identification, house identification of target house>[j-1], divides the broker identification according to the brokerage company to which the broker belongs, and obtains at least one broker set. For each broker set, it is determined whether the number of receivable target tasks corresponding to each broker identification in the broker set is greater than 0. When the platform management device determines that the number of receivable target tasks corresponding to each broker identification in each broker set is less than or equal to 0, it determines that the target task for the i+1th house cannot be issued. The platform management device updates the j+1th second information in the task quantity information of the i+1th house to the total number of second tasks.

[0085] Accordingly, when it is determined that there is a broker set in which the number of target tasks that can be received corresponding to each broker identifier is greater than 0, it is determined that the target task for the i+1th house source can be issued. The platform management device uses the broker set in which the number of target tasks that can be received corresponding to each broker identifier is greater than 0 as the target broker set. The broker identifiers in the target broker set are used as the second broker identifiers, and the number of second broker identifiers in the target broker set is counted as the second task number to generate the second issueable information.

[0086] In step S3, the total number of first tasks is calculated based on the task quantity information corresponding to the i-th house source and the second task number. The total number of first tasks is the sum of the task quantities for the 1st house source to the i+1th house source when the total number of first houses source is j.

[0087] Optionally, the platform management device may determine the sum of the third task number dp[i-1][j-1] and the second task number (taskNumi-1) as the total number of the first tasks. The third task number is the data recorded in the jth second information dp[i-1][j-1] in the task quantity information of the i-th house.

[0088] In step S4, it is determined whether the total number of the first tasks is greater than the total number of the second tasks. If yes, step S5 is executed; if no, step S6 is executed.

[0089] That is to say, it is to judge whether the sum of the number of tasks for the 1st house to the i+1th house (i.e. the total number of first tasks) is greater than the sum of the number of tasks for the 1st house to the i-th house (i.e. the total number of second tasks) when the total number of the first houses to be issued is j.

[0090] In step S5, the j+1th second information in the task quantity information of the i+1th property is determined to be the total number of first tasks, and the j+1th first information in the second receivable information is updated. The property identifier of the target property of the second broker is retained in the j+1th first information in the updated second receivable information.

[0091] Wherein, when the total number of the first tasks is greater than the total number of the second tasks, it indicates that when the total number of the first houses to be issued for the target tasks is j, the number of tasks for the 1st to i+1th houses is relatively the largest. The platform management device determines that the j+1th second information dp[i][j] in the task quantity information of the i+1th house is the total number of the first tasks, updates the j+1th first information Map<broker identifier, house identifier of the target house>[j] in the second receivable information, and retains the house identifier of the target house of the second broker in the j+1th first information in the updated second receivable information. That is, the process of the platform management device updating the j+1th first information Map<broker identifier, house identifier of the target house>[j] in the second receivable information may include: the platform management device obtains the j+1th first information in the second receivable information, merges the j+1th first information with the house identifier of the target house of the second broker, and obtains the j+1th first information in the updated second receivable information.

[0092] In step S6, the j+1th second information in the task quantity information of the i+1th house is determined to be the total number of second tasks, and the j+1th first information in the second receivable information is updated. The j+1th first information in the updated second receivable information is: the jth first information in the second receivable information.

[0093] Among them, when the total number of the first tasks is less than or equal to the total number of the second tasks, it indicates that when the total number of the first houses to be issued for the target task is j, the number of tasks for the 1st to ith houses is relatively the largest. The platform management device determines that the j+1th second information dp[i][j] in the task quantity information of the i+1th house is the total number of the second tasks, updates the j+1th first information Map<agent identifier, house identifier of the target house>[j] in the second receivable information, and the j+1th first information in the updated second receivable information is: the jth first information Map<agent identifier, house identifier of the target house>[j-1] in the second receivable information.

[0094] In step S7, it is determined whether j is less than the maximum number of houses. If so, step S8 is executed; if not, step 1032 is executed.

[0095] In step S8, j is updated to j+1.

[0096] When j is less than the maximum number of listings, j is updated to j+1, and the process returns to step S2 until j is greater than or equal to the maximum number of listings.

[0097] In step 1032, it is compared whether i+1 is less than the total number of houses. If so, step 1033 is executed; if not, step 1034 is executed.

[0098] In step 1033, i is updated to i+1, and the process returns to step 1031.

[0099] Among them, when i+1 is less than the total number of properties, i is updated to i+1, and the process returns to step 1031 to execute, and for the i+1th property to which the target task can be issued, the second receivable information is updated based on the second receivable information and the task quantity information corresponding to the i-th property to which the target task can be issued.

[0100] In step 1034, task delivery information is determined based on the updated second receivable information.

[0101] In which, when i+1 is greater than or equal to the total number of houses, the task delivery information is determined based on the updated second receivable information Map<agent identifier, house identifier of the target house>[TS].

[0102] In the embodiment of the present application, the task delivery information includes: when the number of tasks of the target task to be delivered is the largest, the target property identification of the target property of each broker. That is, the task delivery information includes: when the total number of the first property of the target task to be delivered is the maximum number of properties, the target property identification of the target property of each broker.

[0103] In an optional implementation manner, the platform management device determines the j+1th first information in the updated second receivable information as the task issuing information.

[0104] In another optional implementation, before executing step 1034, the platform management device may first determine whether the value of the TS+1th second information dp[SN-1][TS] in the task quantity information of the second house is greater than 0, so as to determine whether the house to which the target task is to be issued can be matched from the houses to which the target task can be issued. When the value of the TS+1th second information in the task quantity information of the second house is greater than 0, it indicates that there are houses to which the target task is to be issued from the houses to which the target task can be issued, and step 1034 is executed. When the value of the TSth second information in the task quantity information of the second house is less than or equal to 0, it indicates that there are no houses to which the target task is to be issued from the houses to which the target task can be issued, and it is determined that there is no target task to be issued. Among them, the second house is the SNth house to which the target task can be issued.

[0105] Based on this, the process in which the platform management device performs step 1034 to determine the task delivery information based on the updated second receivable information may include:

[0106] When the value of the second information dp[SN-1][TS] of the maximum number of houses in the task quantity information of the second house is greater than 0, the platform management device determines the task sending information based on the updated second receivable information.

[0107] Step 104: Send the target task for the target property indicated by the target property identifier to each broker's terminal in the task sending information.

[0108] In the embodiment of the present application, for each target property source identifier in the task delivery information, the platform management device sends a target task for the target property source indicated by the target property source identifier to the terminal of each broker corresponding to the target property source identifier recorded in the task delivery information. The broker corresponding to the target property source identifier refers to the broker who has published the target property source indicated by the target property source identifier.

[0109] It should be noted that the task delivery information includes: the target property identification of each broker's target property when the number of target tasks to be delivered is the largest. The total number of target property identifications included in the task delivery information may be at least one, that is, the total number of target properties to be delivered as indicated by the task delivery information may be at least one. And in the task delivery information, the number of target properties for a single broker may be at least one. The platform management device delivers the target task for the target property corresponding to the broker to the terminal of each broker in the task delivery information, so that the maximum number of target tasks can be delivered in the distribution process of a single target task.

[0110] Optionally, when the task distribution method is applied to a housing application scenario, a broker can publish one or more posts for the same housing source, and the posts are used to introduce housing information. Similarly, multiple brokers can also publish posts for the same housing source to introduce housing information in the posts.

[0111] Based on this, the property source identifier may be an identifier that directly indicates the property source. Alternatively, the property source identifier may also be an identifier for a post that indicates the release of the property source. In the case where the property source identifier indicates the property source, the target task for the target property source identifier corresponding to the broker that is sent by the platform management device to the broker's terminal may refer to: sending a target task for each post corresponding to the target property source identifier to the broker's terminal. Each post corresponding to the target property source identifier refers to: all posts in which the broker has posted the house information of the target property source indicated by the target property source identifier. The target task is used by the broker to verify the content accuracy of each post that publishes the house information of a property source in the house transaction platform.

[0112] In the embodiment of the present application, the backpack algorithm can be used to determine the task issuance information when the broker has a limit on the number of target tasks that can be received, and the number of houses involved in the target tasks to be issued also has an upper limit (i.e., the maximum number of houses), so as to select at least one target house that maximizes the number of target tasks to be issued from the houses to which the target tasks can be issued, and then issue the target tasks for the target houses to the broker's terminal corresponding to each target house. The number of target tasks issued is guaranteed, and the utilization rate of the target tasks is improved. For example, in the case where the target task is a house information confirmation task, the technical solution of the present application guarantees a relatively high overall number of house information confirmation tasks issued, so that the task utilization rate is relatively high.

[0113] For ease of understanding, the task distribution method provided in the embodiment of the present application is further described with the following example. Figure 2 As shown, determine whether there is a house to which the target task can be issued.

[0114] When it is determined that there is no house to which the target task can be issued, the task distribution method is terminated.

[0115] When it is determined that there are houses to which the target tasks can be issued, the total number of houses SN to which the target tasks can be issued and the maximum number of houses TS to which the target tasks are to be issued on that day are obtained.

[0116] The number of target tasks received by each broker associated with the house to which the target task can be issued is counted. According to the task issuing rule and the number of target tasks of each broker, the number of target tasks that each broker can still receive is calculated to generate the first receivable information EN. The first receivable information EN includes: the number of target tasks that each broker can still receive, and the house source identifier of the target house to which each broker can issue the target task.

[0117] Initialize the task quantity information dp[i][j] to 0. Wherein, 0≤i<SN, 0≤j≤TS. The task quantity information corresponding to the i+1th house includes: dp[i][0], dp[i][1]...... to dp[i][TS]. dp[i][j] is the j+1th second information in the task quantity information corresponding to the i+1th house, which indicates the maximum number of target tasks to be issued for the 1st house to the i+1th house when the number of target tasks to be issued is j, also known as the maximum number of issued tasks.

[0118] Initialize the second receivable information Map <L,Set <l>>[j]. L represents the broker ID, Set <l>Indicates the broker indicated by the corresponding broker ID, to which the target property ID of the target task can be issued. Map <L,Set <l>>[j] is the j+1th first information in the second receivable information, which indicates that when the number of target tasks to be issued is j, each broker can issue the property identifier of the target property for the target task.

[0119] Write the first receivable information EN into the Map in the second receivable information <L,Set <l>>[0]。Map<L,Set <l>>[0] is the first information in the second receivable information.

[0120] Based on the first receivable information EN and the task rules, it is determined whether the target task can be issued for the first house source (ie, the first house source).

[0121] In the case that the target task can be issued for the first house source, the first issueable information of the first house source is determined based on the first receivable information EN and the task issuance rule. The first issueable information includes: a first task number sku0Num and a first broker identifier sku0Bro.

[0122] Update the task quantity information dp[0][1], dp[0][1]... to dp[0][TS] of the first house source to the first task number sku1Num, merge the first receivable information EN and the first sendable information to obtain the merged received information. <L,Set <l>>[1]、Map<L,Set <l>>[2]......To Map <L,Set <l>>[totalSize] is updated to combine received information.

[0123] Set i to 1. Determine whether i is less than the total number of listings SN.

[0124] If i is less than the total number of houses SN, j is set to 1. Determine whether j is less than or equal to the maximum number of houses TS.

[0125] If j is less than or equal to the maximum number of houses TS, then based on the Map in the second receivable information <L,Set <l>>[j-1] and the task issuance rules to determine whether the target task for the i+1th property can be issued.

[0126] If the target task for the i+1th house can be issued, then based on the Map in the second receivable information <L,Set <l>>[j-1] and the task issuing rule, determine the second issueable information of the i+1th house. The second issueable information includes: the second task number skuiNum and the second broker identifier skuiBrors.

[0127] Determine whether the sum of dp[i-1][j-1] and the second task number skuiNum (i.e., dp[i-1][j-1]+skuiNum) is greater than dp[i-1][j]. The sum of dp[i-1][j-1] and the second task number skuiNum is the total number of first tasks. dp[i-1][j] is the total number of second tasks.

[0128] If the sum of dp[i-1][j-1] and the second task number skuiNum is greater than dp[i-1][j], then update dp[i][j] to the sum of dp[i-1][j-1] and the second task number skuiNum (i.e., dp[i][j] = dp[i-1][j-1] + skuiNum), and update the Map in the second receivable information based on the second transmittable information. <L,Set <l>>[j]. Add 1 to the value of j (i.e., j=j+1), and return to the step of determining whether j is less than or equal to the maximum number of houses TS.

[0129] If the sum of dp[i-1][j-1] and skuiNum is less than or equal to dp[i-1][j], then update dp[i][j] to dp[i-1][j] (i.e., dp[i][j] = dp[i-1][j]), and replace Map in the second receivable information <L,Set <l>>[j] Update to Map <L,Set <l>>[j-1]. Add 1 to the value of j and return to the step of determining whether j is less than or equal to the maximum number of listings TS.

[0130] If the target task for the i+1th house cannot be issued, update dp[i][j] to dp[i-1][j] (i.e., dp[i][j] = dp[i-1][j]). Add 1 to the value of j, and return to the step of determining whether j is less than or equal to the maximum number of houses TS.

[0131] If j is greater than the maximum number of properties TS, the value of i is increased by 1 (i.e., i=i+1), and the process returns to the step of determining whether i is less than the total number of properties SN.

[0132] If i is greater than or equal to the total number of properties SN, determine whether dp[SN-1][TS] is greater than 0.

[0133] If dp[SN-1][TS] is greater than 0, then according to the Map in the second receivable information <L,Set <l>>[TS] performs target task distribution. That is, to Map <L,Set <l>> Each broker's terminal in [TS] issues a target task for the corresponding property ID indicating the property.

[0134] If dp[SN-1][TS] is less than or equal to 0, the task distribution method is terminated.

[0135] It should be noted that after the platform manager finishes executing the task distribution method, it can determine whether there is another batch of houses to which the target task can be issued. If so, the task distribution method can be executed again for the houses to which the target task can be issued.

[0136] In summary, the task distribution method provided in the embodiment of the present application can determine the task issuance information through the backpack algorithm when the broker has a limit on the number of target tasks that can be received, and the number of houses involved in the target tasks to be issued also has an upper limit (i.e., the maximum number of houses), so as to select at least one target house that maximizes the number of target tasks to be issued from the houses to which the target tasks can be issued, and then issue the target tasks for the target houses to the terminals of the brokers corresponding to each target house. The number of target tasks issued is guaranteed, and the utilization rate of the target tasks is improved. For example, in the case where the target task is a house information confirmation task, the technical solution of the present application guarantees a relatively high overall number of house information confirmation tasks issued, so that the task utilization rate is relatively high.

[0137] Please refer to Figure 3 , which shows a block diagram of a task distribution device provided by an embodiment of the present application. Figure 3 As shown, the task distribution device 300 includes: an acquisition module 301 , an initialization module 302 , an algorithm processing module 303 and a sending module 304 .

[0138] The acquisition module 301 is used to obtain the maximum number of houses to be issued a target task, the first receivable information, and the first receivable information of the first house to which the target task can be issued, the target task is a task sent to the broker for a house that the broker has published, the first receivable information includes: the number of target tasks that each broker can receive and the house identifier of the target house, the target house is the house to which the target task can be issued, the first receivable information includes: the first task number and the first broker identifier, the first broker indicated by the first broker identifier has published the first house, and the number of target tasks that can be received after publishing the first house is greater than 0, and the first task number is the total number of target tasks that the first broker can receive for the first house;

[0139] Initialization module 302, for initializing second receivable information and task quantity information corresponding to the first house source based on the first receivable information and the first sendable information, the second receivable information including: when the total number of first houses to be sent target tasks is 0 to the maximum number of houses, the house source identifiers of the target houses of each broker corresponding to each other, and the task quantity information including: when the total number of first houses is 1 to the maximum number of houses, the task quantity information corresponding to each other for the target tasks of the first house source;

[0140] The algorithm processing module 303 is used to determine the task issuing information by using the backpack algorithm based on the second receivable information and the task quantity information, wherein the task issuing information includes: the target house source identifier of the target house source of each broker when the task quantity of the target task to be issued is the largest;

[0141] The sending module 304 is used to send the target task for the target house indicated by the target house identifier to each broker's terminal in the task sending information.

[0142] Optionally, the algorithm processing module 303 is further used to:

[0143] For the i+1th house source to which the target task can be issued, based on the second receivable information and the task quantity information corresponding to the i-th house source to which the target task can be issued, the second receivable information is updated, and the updated second receivable information includes: when the sum of the task quantities of the target tasks to be issued for the 1st house source to the i+1th house source is the largest, when the total number of the first house sources is 1 to the maximum number of house sources in sequence, the house source identifiers of the target houses of each broker corresponding to each other, i is greater than 0;

[0144] If i+1 is less than the total number of houses, update i to i+1, and return to execute the step of updating the second receivable information for the i+1th house to which the target task can be issued based on the second receivable information and the task quantity information corresponding to the i-th house to which the target task can be issued; the total number of houses is the number of all houses to which the target task can be issued;

[0145] When i+1 is greater than or equal to the total number of listings, the task delivery information is determined based on the updated second receivable information.

[0146] Optionally, the algorithm processing module 303 is further used to:

[0147] The total number of first listings j is determined to be 1;

[0148] Based on the jth first information in the second receivable information, the second deliverable information of the i+1th house is determined, the jth first information is: the house source identifier of the target house source of each broker when the total number of first houses is j-1, the second deliverable information includes: the second task number and the second broker identifier, the second broker identifier indicates that the second broker has released the i+1th house source, and the number of target tasks that can be received after the release of the i+1th house source is greater than 0, and the second task number is the total number of target tasks that the second broker can receive for the i+1th house source,

[0149] The total number of first tasks is calculated according to the task quantity information corresponding to the i-th house source and the second task number. The total number of first tasks is the sum of the task quantities for the 1st house source to the i+1th house source when the total number of first houses source is j;

[0150] In the case where the total number of the first tasks is greater than the total number of the second tasks, the j+1th second information in the task quantity information of the i+1th house source is determined to be the total number of the first tasks, the j+1th first information in the second receivable information is updated, and the house source identifier of the target house source of the second broker is retained in the j+1th first information in the updated second receivable information. The total number of the second tasks is: the j+1th second information in the task quantity information of the i-th house source, and the total number of the second tasks is the sum of the task quantities for the 1st house source to the i-th house source when the total number of the first house source is j;

[0151] When j is less than the maximum number of listings, update j to j+1, and return to the step of determining the second sendable information for the i+1th listing based on the j-1th first information in the second receivable information, until j is greater than or equal to the maximum number of listings.

[0152] Optionally, the algorithm processing module 303 is also used to: when the total number of the first tasks is less than or equal to the total number of the second tasks, determine that the j+1th second information in the task quantity information of the i+1th house is the total number of the second tasks, and update the j+1th first information in the second receivable information. The j+1th first information in the updated second receivable information is: the jth first information in the second receivable information.

[0153] Optionally, the algorithm processing module 303 is further used to:

[0154] In the case where it is determined that the target task for the i+1th house source can be issued based on the jth first information in the second receivable information and the task issuing rule, the second issueable information for the i+1th house source is determined based on the jth first information in the second receivable information, and the task issuing rule is used to limit the conditions for issuing the target task for each house source;

[0155] When it is determined that the target task for the i+1th property cannot be issued based on the jth first information in the second receivable information and the task issuing rule, the j+1th second information in the task quantity information of the i+1th property is updated to the total number of second tasks.

[0156] Optionally, the algorithm processing module 303 is also used to: when the value of the second information of the maximum number of houses in the task quantity information of the second house is greater than 0, determine the task issuance information based on the updated second receivable information, and the second house is the house of the total number of houses to which the target task can be issued.

[0157] Optionally, the initialization module 302 is further configured to:

[0158] Determine the listing identifier of each broker in the second receivable information when the total number of first listings is 0 as the listing identifier of the corresponding broker in the first receivable information;

[0159] Based on the first transmittable information, determine, in the second receivable information, the corresponding property identification of each broker when the first total property number is 1 to the maximum property number in sequence;

[0160] In the task quantity information of the first housing source, when the total number of the first housing sources is 1 to the maximum number of housing sources, the corresponding number of tasks for the first housing source is determined as the first task number.

[0161] In summary, the task distribution device provided in the embodiment of the present application can determine the task issuance information through the backpack algorithm when the broker has a limit on the number of target tasks that can be received, and the number of houses involved in the target tasks to be issued also has an upper limit (i.e., the maximum number of houses), so as to select at least one target house that maximizes the number of target tasks to be issued from the houses to which the target tasks can be issued, and then issue the target tasks for the target houses to the terminals of the brokers corresponding to each target house. The number of target tasks issued is guaranteed, and the utilization rate of the target tasks is improved. For example, in the case where the target task is a house information confirmation task, the technical solution of the present application guarantees a relatively high overall number of house information confirmation tasks issued, so that the task utilization rate is relatively high.

[0162] The task distribution device provided in the embodiment of the present application has a functional module corresponding to the execution task distribution method, and can execute any task distribution method provided in the embodiment of the present application and achieve the same beneficial effects.

[0163] In another embodiment provided in the present application, an electronic device is also provided. The electronic device may include: a processor, a memory, and a computer program stored in the memory and executable on the processor. When the processor executes the program, each process of the above-mentioned task distribution method embodiment is implemented, and the same technical effect can be achieved. To avoid repetition, it will not be repeated here.

[0164] For example, Figure 4 As shown, in a specific embodiment provided in the present application, the electronic device may specifically include: a processor 401, a storage device 402, a display screen 403 with a touch function, an input device 404, an output device 405, and a communication device 406. The number of processors 401 in the electronic device may be one or more. Figure 4 A processor 401 is taken as an example. The processor 401, storage device 402, display screen 403, input device 404, output device 405 and communication device 406 of the electronic device can be connected via a bus or other means.

[0165] In another embodiment provided in the present application, a computer-readable storage medium is provided, in which instructions are stored. When the computer-readable storage medium is executed on a computer, the computer executes the task distribution method described in any one of the above embodiments.

[0166] In another embodiment provided by the present application, a computer program product including instructions is also provided, which, when executed on a computer, enables the computer to execute the task distribution method described in any one of the above embodiments.

[0167] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "comprise", "include" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a..." does not exclude the presence of other identical elements in the process, method, article or device including the element.

[0168] It should be noted that, in this article, the term "includes", "comprising" or any other variation thereof is intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprising a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.

[0169] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present invention, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, a magnetic disk, or an optical disk), and includes a number of instructions for enabling a terminal (which can be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to execute the methods described in each embodiment of the present invention.

[0170] The embodiments of the present invention are described above in conjunction with the accompanying drawings, but the present invention is not limited to the above-mentioned specific implementation modes, which are merely illustrative rather than restrictive. Under the guidance of the present invention, ordinary technicians in this field can also make many forms without departing from the scope of protection of the present invention and the claims, all of which are within the protection of the present invention.

[0171] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed in the embodiments of the present invention can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0172] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0173] In the embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0174] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0175] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0176] If the 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, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard disks, ROM, RAM, magnetic disks, or optical disks.

[0177] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present invention, which should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.< / l> < / l> < / l> < / l> < / l> < / l> < / l> < / l> < / l> < / l> < / l> < / l> < / l> < / l> < / l>

Claims

1. A task distribution method, characterized in that: The method comprises: Obtaining the maximum number of properties to be issued a target task, first receivable information, and first receivable information of a first property to which the target task can be issued, wherein the target task is a task sent to a broker for a property that the broker has published, the first receivable information includes: the number of target tasks that each broker can receive and the property identifier of the target property, the target property is a property to which the target task can be issued, the first receivable information includes: the first task number and the first broker identifier, the first broker indicated by the first broker identifier has published the first property, and the number of target tasks that can be received after publishing the first property is greater than 0, and the first task number is the total number of target tasks that the first broker can receive for the first property; Initialize second receivable information and task quantity information corresponding to the first house source based on the first receivable information and the first sendable information, wherein the second receivable information includes: when the total number of first houses to be sent target tasks is 0 to the maximum number of houses, the house source identifiers of the target houses of each of the brokers corresponding to each other, and the task quantity information includes: when the total number of the first houses is 1 to the maximum number of houses, the task quantity information corresponding to each other for the target tasks of the first houses corresponding to each other; Based on the second receivable information and the task quantity information, a backpack algorithm is used to determine task delivery information, wherein the task delivery information includes: a target property source identifier of the target property source of each of the brokers when the task quantity of the target task to be delivered is the largest; Sending a target task for the target property indicated by the target property identifier to each of the brokers' terminals in the task sending information; The step of using a backpack algorithm to determine task delivery information based on the second receivable information and the task quantity information includes: For the i+1th house source to which the target task can be issued, based on the second receivable information and the task quantity information corresponding to the i-th house source to which the target task can be issued, update the second receivable information; If i+1 is less than the total number of houses, update i to i+1, and return to execute the step of updating the second receivable information for the i+1th house to which the target task can be issued based on the second receivable information and the task quantity information corresponding to the i-th house to which the target task can be issued; When i+1 is greater than or equal to the total number of houses, the task issuing information is determined based on the updated second receivable information.

2. The method according to claim 1, characterized in that The updated second receivable information includes: when the sum of the number of target tasks to be issued for the 1st to i+1th housing sources is the largest, when the total number of the first housing sources is 1 to the maximum number of housing sources, the housing source identifiers of the target housing sources of each of the brokers respectively corresponding to each other, i is greater than 0; The total number of properties is the number of all properties to which the target task can be assigned.

3. The method according to claim 2, characterized in that The updating of the second receivable information based on the second receivable information and the task quantity information corresponding to the i-th house source to which the target task can be issued includes: The total number of the first housing sources j is determined to be 1; Based on the jth first information in the second receivable information, the second dispatchable information of the i+1th house is determined, the jth first information is: the house source identifier of the target house source of each of the brokers when the total number of the first houses is j-1, the second dispatchable information includes: a second task number and a second broker identifier, the second broker identifier indicates that the second broker has published the i+1th house source, and the number of target tasks that can be received after publishing the i+1th house source is greater than 0, and the second task number is the total number of target tasks that the second broker can receive for the i+1th house source, Calculate the total number of first tasks according to the task quantity information corresponding to the i-th house source and the second number of tasks, where the first total number of tasks is the sum of the task quantities for the 1st house source to the i+1th house source when the first total number of houses is j; In the case where the first total number of tasks is greater than the second total number of tasks, the j+1th second information in the task quantity information of the i+1th house source is determined to be the first total number of tasks, the j+1th first information in the second receivable information is updated, and the house source identifier of the target house source of the second broker is retained in the j+1th first information in the updated second receivable information, and the second total number of tasks is: the j+1th second information in the task quantity information of the i-th house source, and the second total number of tasks is the sum of the number of tasks for the 1st house source to the i-th house source when the first total number of houses is j; When j is less than the maximum number of properties, update j to j+1, and return to execute the step of determining the second sendable information of the i+1th property based on the j-1th first information in the second receivable information, until j is greater than or equal to the maximum number of properties.

4. The method according to claim 3, characterized in that The updating of the second receivable information based on the second receivable information and the task quantity information corresponding to the i-th house source to which the target task can be issued further includes: When the total number of the first tasks is less than or equal to the total number of the second tasks, determine that the j+1th second information in the task quantity information of the i+1th house is the total number of the second tasks, and update the j+1th first information in the second receivable information. The j+1th first information in the second receivable information after update is: the jth first information in the second receivable information.

5. The method according to claim 3, characterized in that: The determining, based on the jth first information in the second receivable information, the second sendable information of the i+1th house source includes: In a case where it is determined that the target task for the i+1th house source can be issued based on the jth first information in the second receivable information and the task issuing rule, second issueable information for the i+1th house source is determined based on the jth first information in the second receivable information, and the task issuing rule is used to define the conditions for issuing the target task for each house source; The updating of the second receivable information based on the second receivable information and the task quantity information corresponding to the i-th house source to which the target task can be issued further includes: When it is determined that the target task for the i+1th house cannot be issued based on the jth first information in the second receivable information and the task issuing rule, the j+1th second information in the task quantity information of the i+1th house is updated to the total number of the second tasks.

6. The method according to any one of claims 2 to 5, characterized in that: The determining the task delivery information based on the updated second receivable information includes: When the value of the second information of the maximum number of houses in the task quantity information of the second house source is greater than 0, the task issuing information is determined based on the updated second receivable information, and the second house source is the house of the total number of houses to which the target task can be issued.

7. The method according to claim 1, characterized in that Initializing the second receivable information and the task quantity information corresponding to the first house source based on the first receivable information and the first sendable information includes: Determine the property identification of each broker in the second receivable information when the total number of the first property sources is 0 as the property identification of the corresponding broker in the first receivable information; Based on the first transmittable information, determining, in the second receivable information, when the first total number of housing sources is 1 to the maximum number of housing sources, the housing source identifiers of each of the brokers corresponding to each of the brokers; In the task quantity information of the first housing source, when the total number of the first housing sources is 1 to the maximum number of housing sources, the corresponding number of tasks for the first housing sources is determined as the first number of tasks.

8. A task distribution device, characterized in that: The device comprises: an acquisition module, for acquiring a maximum number of houses to be issued a target task, first receivable information, and first receivable information of a first house to which the target task can be issued, wherein the target task is a task sent to a broker for a house that the broker has published, the first receivable information includes: the number of target tasks that each broker can receive and a house identifier of a target house, the target house is a house to which the target task can be issued, the first receivable information includes: a first task number and a first broker identifier, the first broker indicated by the first broker identifier has published the first house, and the number of target tasks that can be received after publishing the first house is greater than 0, and the first task number is the total number of target tasks that the first broker can receive for the first house; an initialization module, configured to initialize second receivable information and task quantity information corresponding to the first house source based on the first receivable information and the first sendable information, wherein the second receivable information includes: when the total number of first houses to be sent target tasks is 0 to the maximum number of houses, the house source identifiers of the target houses of each of the brokers corresponding respectively, and the task quantity information includes: when the total number of the first houses is 1 to the maximum number of houses, the task quantity information corresponding respectively to the target tasks for the first houses; an algorithm processing module, configured to determine task delivery information by using a backpack algorithm based on the second receivable information and the task quantity information, wherein the task delivery information includes: a target property source identifier of the target property source of each of the brokers when the task quantity of the target task to be delivered is the largest; A sending module, configured to send a target task for a target property indicated by the target property identifier to each of the broker's terminals in the task sending information; The algorithm processing module is also used for: For the i+1th house source to which the target task can be issued, based on the second receivable information and the task quantity information corresponding to the i-th house source to which the target task can be issued, update the second receivable information; If i+1 is less than the total number of houses, update i to i+1, and return to execute the step of updating the second receivable information for the i+1th house to which the target task can be issued based on the second receivable information and the task quantity information corresponding to the i-th house to which the target task can be issued; When i+1 is greater than or equal to the total number of houses, the task issuing information is determined based on the updated second receivable information.

9. An electronic device, characterized in that: include: A processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the computer program, when executed by the processor, implements the steps of the task distribution method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the task distribution method according to any one of claims 1 to 7 are implemented.

Images