Supplier share dynamic allocation method and device, computer equipment and storage medium

Abstract

This application, belonging to the field of artificial intelligence, relates to a method for dynamically allocating supplier shares. The method includes: configuring supplier unit shares; randomly generating a hashed unit queue based on the supplier unit shares; when a work assignment action is triggered, aggregating all suppliers' workers to the first unit in the hashed unit queue; analyzing the qualifications of the supplier's workers; and determining whether to normally assign work to the first unit in the hashed unit queue based on the analyzed qualifications. This application also provides a supplier share dynamic allocation device, a computer device, and a storage medium. This application achieves a precise random allocation scheme and incorporates worker service quality into the work assignment share weighting, which can increase the proportion of suppliers with good service quality and decrease the proportion of suppliers with poor service quality, thereby improving supplier motivation.

Description

Technical Field

[0001] This application relates to the field of artificial intelligence technology, and in particular to a method, apparatus, computer equipment, and storage medium for dynamically allocating supplier shares. Background Technology

[0002] With the expansion of roadside assistance services, the current dispatching scheme, which uses random weighted allocation, has the following drawbacks:

[0003] First, simply assigning work according to random weighted shares can only guarantee that the share will tend to the allocated share in the case of large numbers (extreme values), but in reality, the agreed share allocation is basically not achieved.

[0004] Secondly, the qualifications of the assigned workers (blacklisted, complained about, or high-quality service workers) affect the actual allocated share, and this part of the work allocation is not quantified.

[0005] Third, no remedial measures were taken to dynamically limit the weighting of different time periods. Summary of the Invention

[0006] The purpose of this application is to provide a method, apparatus, computer device and storage medium for dynamic allocation of supplier shares. Its main purpose is to achieve accurate random allocation and dynamic balance adjustment of shares, thereby improving the enthusiasm of suppliers.

[0007] To address the aforementioned technical problems, this application provides a method for dynamically allocating supplier shares, employing the following technical solution:

[0008] A method for dynamically allocating supplier shares includes the following steps:

[0009] Configure the unit share of the supplier, and randomly generate a hash unit queue based on the unit share of the supplier;

[0010] When a dispatch action is triggered, all suppliers' workers are aggregated to the first unit of the hash unit queue;

[0011] The qualifications of the suppliers' technicians are analyzed, and work assignment is performed based on the obtained qualifications.

[0012] Furthermore, the step of configuring the supplier's unit share and randomly generating a hashed unit queue based on the supplier's unit share specifically includes:

[0013] Step 1: Mark each supplier with a supplier identifier character and configure multiple unit yuan shares for each supplier;

[0014] Step 2: Traverse the unit queue of each supplier backwards, starting from the last unit of each supplier.

[0015] Step 3: For each unit element traversed, generate a random integer ranging from the current position to the starting position of the unit element queue for that supplier.

[0016] Step 4: Swap the currently traversed identity element with the identity element at the corresponding position of the random integer;

[0017] Step 5: Continue to traverse the unit queue forward, repeating steps 3 to 4 until all units in the unit queue of the supplier have been traversed, generating a hash unit queue for each supplier. The hash unit queue is represented by the corresponding supplier identifier character and placeholder sequence number.

[0018] Step 6: Assemble all the hash unit queues of all suppliers into a queue in order.

[0019] Furthermore, after the step of arranging the hash unit queues of all suppliers into a queue in sequence, the method further includes:

[0020] Configure the unit share cap factor range for all suppliers;

[0021] When the percentage of dispatched work by a supplier exceeds the set upper limit, the supplier's share is reduced by the upper limit factor, and the remaining supplier's share is increased by the upper limit factor.

[0022] Furthermore, the step of analyzing the qualifications of the supplier's technicians and executing the work assignment operation based on the analyzed technician qualifications specifically includes:

[0023] Based on the multi-dimensional scoring of the supplier's service profile, the final score of the supplier's service provider is obtained.

[0024] If the final score is higher than the set excellent score, the master's qualification is recommended as excellent, the first unit of the hash unit queue is moved to the end of the hash unit queue, and the work is assigned normally.

[0025] If the final score is higher than the score between the excellent score and the blacklist risk control score, then the master's qualification is average, the first unit in the hash unit queue is maintained, and work is assigned normally.

[0026] If the final score is lower than the blacklist risk control score, then the mentor's qualifications are blacklisted. Take the remaining queue after removing the first unit of the supplier, and move the first unit of the hash unit queue of the remaining queue to the end of the hash unit queue. Repeat the process to judge the qualifications of the remaining mentors. If all the mentors aggregated are blacklisted, then re-aggregate the mentors of the supplier.

[0027] Furthermore, the step of deriving the final rating of the supplier's technician based on the multi-dimensional scoring of the supplier's technician service profile also includes:

[0028] Obtain positive reviews, timeliness, and skill ratings from the supplier's technicians;

[0029] The obtained positive reviews, timeliness, and professional skills scores are calculated according to preset weights to obtain the final score of the supplier's technician.

[0030] Furthermore, after analyzing the qualifications of the supplier's technicians and determining whether to assign work normally to the first unit of the hash unit queue based on the analyzed technician qualifications, the method further includes:

[0031] If it is determined that all units in the hash unit queue are simultaneously subject to dispatch operations, the supplier unit share is reconfigured, and a hash unit queue is randomly generated based on the supplier unit share.

[0032] Furthermore, after analyzing the qualifications of the supplier's technicians and determining whether to assign work normally to the first unit of the hash unit queue based on the analyzed technician qualifications, the method further includes:

[0033] Identify the share of each supplier within a set time period;

[0034] If the ratio is found to exceed the set value, the supplier's unit will replace the unit of the supplier whose share ratio is lower than the set value in the hash unit queue.

[0035] To address the aforementioned technical problems, this application also provides a supplier share dynamic allocation device, which employs the following technical solution:

[0036] A supplier share dynamic allocation device, comprising:

[0037] The configuration generation module is used to configure the unit share of suppliers and randomly generate a hash unit queue based on the unit share of suppliers.

[0038] The triggering module is used to trigger the dispatching action, aggregating all suppliers' workers to the first unit of the hash unit queue;

[0039] The dispatch module is used to analyze the qualifications of the suppliers' workers and determine whether to dispatch the first unit in the hash unit queue normally based on the analyzed qualifications.

[0040] To address the aforementioned technical problems, this application also provides a computer device that employs the following technical solution:

[0041] A computer device includes a memory and a processor, the memory storing computer-readable instructions, the processor executing the computer-readable instructions to implement the steps of the supplier share dynamic allocation method as described above.

[0042] To address the aforementioned technical problems, this application also provides a computer-readable storage medium, employing the technical solution described below:

[0043] A computer-readable storage medium storing computer-readable instructions that, when executed by a processor, implement the steps of the supplier share dynamic allocation method as described above.

[0044] Compared with the prior art, the embodiments of this application have the following advantages: This application achieves a precise random allocation scheme by configuring the unit share of suppliers and randomly generating a hash unit queue based on the unit share of suppliers, triggering the dispatching action, and aggregating all suppliers' masters to the first unit of the hash unit queue; it analyzes the qualifications of the suppliers' masters and executes the dispatching operation based on the analyzed master qualifications, and incorporates the master's service quality into the dispatching share ratio, which can increase the proportion of suppliers with good service quality, reduce the proportion of suppliers with poor service quality, and improve the enthusiasm of suppliers. Attached Figure Description

[0045] To more clearly illustrate the solutions in this application, the accompanying drawings used in the description of the embodiments of this application will be briefly introduced below. Obviously, the accompanying drawings described below are some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0046] Figure 1 This is an exemplary system architecture diagram to which this application can be applied;

[0047] Figure 2 A flowchart of an embodiment of the supplier share dynamic allocation method according to this application;

[0048] Figure 3This is a schematic diagram of one embodiment of the supplier share dynamic allocation method of this application;

[0049] Figure 4 yes Figure 2 A flowchart of a specific implementation of step S201;

[0050] Figure 5 yes Figure 2 A schematic diagram of a specific embodiment of step S201;

[0051] Figure 6 yes Figure 2 A flowchart of a specific implementation of step S204;

[0052] Figure 7 This is a diagram illustrating the analysis of the qualifications of the suppliers' technicians in this application.

[0053] Figure 8 This is a schematic diagram illustrating the dynamic balancing share adjustment in this application;

[0054] Figure 9 This is a schematic diagram of a structure of an embodiment of the supplier share dynamic allocation device according to this application;

[0055] Figure 10 This is a schematic diagram of the structure of one embodiment of the computer device according to this application. Detailed Implementation

[0056] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application pertains; the terminology used herein in the specification of the application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application; the terms "comprising" and "having," and any variations thereof, in the specification, claims, and foregoing drawings of this application, are intended to cover non-exclusive inclusion. The terms "first," "second," etc., in the specification, claims, or foregoing drawings of this application are used to distinguish different objects, not to describe a particular order.

[0057] In this document, the term "embodiment" means that a particular feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of this application. The appearance of this phrase in various places throughout the specification does not necessarily refer to the same embodiment, nor is it a separate or alternative embodiment mutually exclusive with other embodiments. It will be explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0058] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings.

[0059] like Figure 1 As shown, system architecture 100 may include terminal devices 101, 102, and 103, a network 104, and a server 105. Network 104 serves as the medium for providing communication links between terminal devices 101, 102, and 103 and server 105. Network 104 may include various connection types, such as wired or wireless communication links, or fiber optic cables, etc.

[0060] Users can use terminal devices 101, 102, and 103 to interact with server 105 via network 104 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 101, 102, and 103, such as web browser applications, shopping applications, search applications, instant messaging tools, email clients, social media platform software, etc.

[0061] Terminal devices 101, 102, and 103 can be various electronic devices with displays and support web browsing, including but not limited to smartphones, tablets, e-book readers, MP3 players (Moving Picture Experts Group Audio Layer III), MP4 players (Moving Picture Experts Group Audio Layer IV), laptops, and desktop computers, etc.

[0062] Server 105 can be a server that provides various services, such as a backend server that supports the pages displayed on terminal devices 101, 102, and 103.

[0063] It should be noted that the supplier share dynamic allocation method provided in this application embodiment is generally executed by a server, and correspondingly, the supplier share dynamic allocation device is generally set in a terminal device.

[0064] It should be understood that Figure 1 The number of terminal devices, networks, and servers shown is merely illustrative. Depending on implementation needs, any number of terminal devices, networks, and servers can be included.

[0065] Continue to refer to Figure 2 and Figure 3 A flowchart illustrating an embodiment of a method for dynamically allocating supplier shares according to this application is shown. The method for dynamically allocating supplier shares includes the following steps:

[0066] Step S201: Configure the unit share of the supplier and randomly generate a hash unit queue based on the unit share of the supplier.

[0067] In this embodiment, the supplier share dynamic allocation method operates on electronic devices (e.g., Figure 1 The server shown can be connected via wired or wireless means. It should be noted that the aforementioned wireless connection methods may include, but are not limited to, 3G / 4G / 5G connections, WiFi connections, Bluetooth connections, WiMA provider share dynamic allocation connections, Zigbee connections, UWB (ultra wideband) connections, and other currently known or future known wireless connection methods.

[0068] refer to Figure 4 and Figure 5 As shown, step S201 specifically includes:

[0069] Step S2011: Mark each supplier with a supplier identification character and configure multiple unit share for each supplier.

[0070] Step S2012: Traverse the unit queue of each supplier backward, starting from the last unit of each supplier.

[0071] Step S2013: For each unit cell traversed, generate a random integer ranging from the current position to the starting position of the unit cell queue of that supplier.

[0072] Step S2014: Swap the currently traversed identity element with the identity element at the corresponding position of the random integer.

[0073] Step S2015: Continue to traverse the unit queue forward until all units in the unit queue of the supplier have been traversed, and generate a hash unit queue for each supplier. The hash unit queue is represented by the corresponding supplier identification character and placeholder sequence number.

[0074] Step S2016: Arrange all supplier hash unit queues into a queue in order; thereby achieving random generation of hash unit queues. In this embodiment, for example, the total share of suppliers is 100 units, where supplier A has 35 units (labeled a), supplier B has 40 units (labeled b), and supplier C has 25 units (labeled c). After executing the above step S201, the randomly generated hash unit queues are shown in Table 1 below:

[0075] Table 1

[0076] a18 b20 c2 c17 ……… a34

[0077] Where a, b, and c represent suppliers A, B, and C respectively, and the numbers are represented in units of yuan.

[0078] In this embodiment, the supplier's unit share is configured. A hash unit queue can be randomly generated based on the supplier's unit share to facilitate subsequent determination of whether to assign work normally to the first unit in the hash unit queue based on the supplier's master's qualifications.

[0079] See Figure 8 As shown, in some optional implementations of this embodiment, after step S2016, the following steps may also be performed:

[0080] Configure a unit share upper limit factor range for all suppliers. If the dispatch percentage of a supplier exceeds the set upper limit, the supplier's share is reduced by the upper limit factor range, and the remaining supplier's share is increased independently by the upper limit factor range; if the dispatch percentage of a supplier is lower than the set upper limit, the supplier's share is increased by the upper limit factor range.

[0081] This solution can be used to deal with situations where a single supplier's work allocation suddenly increases in a short period of time, resulting in a supplier exceeding the allocated allocation or having a small allocation that cannot reach the allocated number of orders. By setting the upper limit factor K of the allocation, the goal of dynamically balancing the allocation adjustment can be achieved, keeping the probability within a certain range, thus realizing the flexibility and stability of the allocation algorithm.

[0082] Step S202: When the dispatch action is triggered, all suppliers' workers are aggregated to the first unit of the hash unit queue.

[0083] For example, it aggregates all registered roadside assistance workers under suppliers A, B, and C, including but not limited to mechanics and tow truck drivers.

[0084] In this embodiment, triggering the dispatch action can be achieved by the user placing an order on a mobile app, for example... Figure 3 The aggregate supplier A, B, C, and their masters aa, bb, cc are aggregated to a18 units.

[0085] Step S203: Analyze the qualifications of the supplier's workers, and determine whether to assign work normally to the first unit of the hash unit queue based on the obtained qualifications of the workers.

[0086] In this embodiment, step S203 specifically includes:

[0087] Step S2031: Based on the multi-dimensional scoring of the supplier's service profile, the final score of the supplier's service provider is obtained.

[0088] In this embodiment, the supplier's technicians can be scored based on their positive reviews, timeliness, and professional skills. Then, curves or profiles can be drawn using existing technologies based on multiple dimensions such as positive reviews, timeliness, and professional skills.

[0089] Step S2032: If the final score is higher than the set excellent score, the master's qualification is recommended as excellent. The first unit of the hash unit queue is moved to the end of the hash unit queue, and work is assigned normally.

[0090] In this embodiment, the normal dispatching is as follows: Figure 3 It starts at the end of the queue, such as a34.

[0091] Step S2033: If the final score is higher than the score between the excellent score and the blacklist risk control score, then the mentor's qualification is considered average. Maintain the first unit position in the hash unit queue and assign tasks normally. Figure 3 In the example, if the master's qualification is average, the position of the first unit element remains unchanged. For example, if the master's qualification is average for b20, then the position of b20 remains unchanged.

[0092] Step S2034: If the final score is lower than the blacklist risk control score, then the master's qualification is a blacklist master. Take the remaining queue after removing the first unit of the supplier, and move the first unit of the hash unit queue of the remaining queue to the end of the hash unit queue. Repeatedly judge the qualification of the remaining masters. If all the masters aggregated are blacklist masters, then re-aggregate the masters of the supplier.

[0093] like Figure 3 If, for example, master b20 is a blacklisted master, then b20 will be removed, and the first unit of the remaining hash unit queue (e.g., b21) will be moved to the end of the hash unit queue.

[0094] This embodiment enables the analysis of the supplier's technician qualifications, and determines whether to assign work normally to the first unit in the hash unit queue based on the obtained technician qualifications.

[0095] For further details, please refer to [link / reference]. Figure 7 As shown, step S2031 specifically includes:

[0096] Obtain positive reviews, timeliness, and professional skill ratings from the supplier's technicians.

[0097] The obtained positive reviews, timeliness, and professional skills scores are calculated according to preset weights to obtain the final score of the supplier's technician.

[0098] For example, in this embodiment, the weight of positive reviews is set to 8%, the weight of timeliness is set to 15%, the weight of professional skills is set to 20%, and some other weights are also included.

[0099] In some optional implementations of this embodiment, after step S203, the following steps may also be performed:

[0100] Step S204: If it is determined that all units in the hash unit queue are simultaneously dispatched, that is, all units are exhausted, then return to step S201, that is, reconfigure the supplier unit share and randomly generate the hash unit queue according to the supplier unit share.

[0101] In some optional implementations of this embodiment, after step S204, the following steps may also be performed:

[0102] Step S205: Determine the share ratio of each supplier within a set time period. If the share ratio exceeds the set value, replace the unit of the supplier with the share ratio ...

[0103] In this embodiment, as Figure 3 If supplier A's share exceeds the set value, then all unit elements (a18, a34) containing supplier a will be replaced with unit elements of suppliers whose share is lower than the set value, such as unit elements b18 and b34 corresponding to supplier B.

[0104] In other words, when a supplier's share ratio is too high in a short period of time, suppliers with lower shares will be compensated, and the number of units of suppliers with high shares will be limited.

[0105] This application achieves a precise random allocation scheme by configuring the unit share of suppliers and randomly generating a hashed unit queue based on the supplier's unit share. This triggers the dispatching action, aggregating all suppliers' workers to the first unit of the hashed unit queue. The application also analyzes the qualifications of the suppliers' workers and executes the dispatching operation based on the analyzed qualifications. By incorporating the worker's service quality into the dispatching share weight, the proportion of suppliers with good service quality can be increased, while the proportion of suppliers with poor service quality can be reduced, thereby improving the enthusiasm of suppliers.

[0106] The embodiments of this application can acquire and process relevant data based on artificial intelligence technology. Artificial intelligence (AI) refers to the theories, methods, technologies, and application systems that use digital computers or machines controlled by digital computers to simulate, extend, and expand human intelligence, perceive the environment, acquire knowledge, and use that knowledge to obtain optimal results.

[0107] Foundational technologies for artificial intelligence generally include sensors, dedicated AI chips, cloud computing, distributed storage, big data processing, operating / interactive systems, and mechatronics. AI software technologies mainly encompass computer vision, robotics, biometrics, speech processing, natural language processing, and machine learning / deep learning.

[0108] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by instructing related hardware with computer-readable instructions. These computer-readable instructions can be stored in a computer-readable storage medium. When executed, the program can include the processes of the embodiments of the above methods. The aforementioned storage medium can be a non-volatile storage medium such as a magnetic disk, optical disk, or read-only memory (ROM), or random access memory (RAM).

[0109] It should be understood that although the steps in the flowcharts of the accompanying figures are shown sequentially as indicated by the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the accompanying figures may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily completed at the same time, but can be executed at different times, and their execution order is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the sub-steps or stages of other steps.

[0110] Further reference Figure 5 As a response to the above Figure 2 To implement the method shown, this application provides an embodiment of a supplier share dynamic allocation device, which is similar to... Figure 2 Corresponding to the method embodiments shown, this device can be specifically applied to various electronic devices.

[0111] like Figure 9 As shown, the supplier share dynamic allocation device 900 described in this embodiment includes: a configuration generation module 901, a triggering module 902, and a dispatching module 903. Wherein:

[0112] The configuration generation module 901 is used to configure the unit share of the supplier and randomly generate a hash unit queue based on the unit share of the supplier.

[0113] Trigger module 902 is used to trigger the dispatch action, aggregating all suppliers' workers to the first unit of the hash unit queue.

[0114] The dispatch module 903 is used to analyze the qualifications of the supplier's workers and determine whether to dispatch the first unit of the hash unit queue normally based on the analyzed qualifications.

[0115] This application configures the unit share of suppliers through the configuration generation module 901, and randomly generates a hash unit queue based on the supplier's unit share, realizing a precise random allocation scheme. The triggering module 902 triggers the dispatching action, aggregating all suppliers' masters to the first unit of the hash unit queue. The dispatching module 903 analyzes the qualifications of the suppliers' masters, and performs the dispatching operation based on the analyzed master qualifications. The service quality of the masters is included in the dispatching share ratio, which can increase the proportion of suppliers with good service quality and reduce the proportion of suppliers with poor service quality, thereby improving the enthusiasm of suppliers.

[0116] This application achieves a precise random allocation scheme by configuring the unit share of suppliers and randomly generating a hashed unit queue based on the supplier's unit share. This triggers the dispatching action, aggregating all suppliers' workers to the first unit of the hashed unit queue. The application also analyzes the qualifications of the suppliers' workers and executes the dispatching operation based on the analyzed qualifications. By incorporating the worker's service quality into the dispatching share weight, the proportion of suppliers with good service quality can be increased, while the proportion of suppliers with poor service quality can be reduced, thereby improving the enthusiasm of suppliers.

[0117] In some optional implementations of this embodiment, the supplier share dynamic allocation device further includes:

[0118] The first judgment module 904 is used to reconfigure the supplier unit share and randomly generate a hash unit queue based on the supplier unit share if it is determined that all units in the hash unit queue are simultaneously dispatched, that is, all units are exhausted.

[0119] In some optional implementations of this embodiment, the supplier share dynamic allocation device further includes:

[0120] The second judgment module 905 determines the share ratio of each supplier within a set time period. If the share ratio exceeds the set value, the unit of the supplier whose share ratio is lower than the set value is replaced by the unit of the supplier whose share ratio is lower than the set value in the hash unit queue.

[0121] In other words, when a supplier's share ratio is too high in a short period of time, suppliers with lower shares will be compensated, and the number of units of suppliers with high shares will be limited.

[0122] To address the aforementioned technical problems, embodiments of this application also provide a computer device. Please refer to [link / reference needed]. Figure 10 , Figure 10 This is a basic structural block diagram of the computer device in this embodiment.

[0123] The computer device 1000 includes a memory 1001, a processor 1002, and a network interface 1003 that are interconnected via a system bus. It should be noted that only the computer device 1000 with components 1001-1003 is shown in the figure; however, it should be understood that it is not required to implement all the shown components, and more or fewer components can be implemented alternatively. Those skilled in the art will understand that the computer device described here is a device capable of automatically performing numerical calculations and / or information processing according to pre-set or stored instructions, and its hardware includes, but is not limited to, microprocessors, application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), digital signal processors (DSPs), embedded devices, etc.

[0124] The computer device can be a desktop computer, laptop, handheld computer, or cloud server, etc. The computer device can interact with the user via a keyboard, mouse, remote control, touchpad, or voice control.

[0125] The memory 1001 includes at least one type of readable storage medium, including flash memory, hard disk, multimedia card, card-type memory (e.g., SD or D vendor share dynamically allocated memory), random access memory (RAM), static random access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, magnetic disk, optical disk, etc. In some embodiments, the memory 1001 may be an internal storage unit of the computer device 1000, such as the hard disk or memory of the computer device 1000. In other embodiments, the memory 1001 may also be an external storage device of the computer device 1000, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc. Of course, the memory 1001 may also include both the internal storage unit and the external storage device of the computer device 1000. In this embodiment, the memory 1001 is typically used to store the operating system and various application software installed on the computer device 1000, such as computer-readable instructions for a supplier share dynamic allocation method. Furthermore, the memory 1001 can also be used to temporarily store various types of data that have been output or will be output.

[0126] In some embodiments, the processor 1002 may be a central processing unit (CPU), a controller, a microcontroller, a microprocessor, or other data processing chip. The processor 1002 is typically used to control the overall operation of the computer device 1000. In this embodiment, the processor 1002 is used to execute computer-readable instructions stored in the memory 1001 or to process data, for example, to execute computer-readable instructions for the supplier share dynamic allocation method.

[0127] The network interface 1003 may include a wireless network interface or a wired network interface, which is typically used to establish communication connections between the computer device 1000 and other electronic devices.

[0128] This application achieves a precise random allocation scheme by configuring the unit share of suppliers and randomly generating a hashed unit queue based on the supplier's unit share. This triggers the dispatching action, aggregating all suppliers' workers to the first unit of the hashed unit queue. The application also analyzes the qualifications of the suppliers' workers and executes the dispatching operation based on the analyzed qualifications. By incorporating the worker's service quality into the dispatching share weight, the proportion of suppliers with good service quality can be increased, while the proportion of suppliers with poor service quality can be reduced, thereby improving the enthusiasm of suppliers.

[0129] This application also provides another embodiment, namely, providing a computer-readable storage medium storing computer-readable instructions that can be executed by at least one processor to cause the at least one processor to perform the steps of the supplier share dynamic allocation method as described above.

[0130] This application achieves a precise random allocation scheme by configuring the unit share of suppliers and randomly generating a hashed unit queue based on the supplier's unit share. This triggers the dispatching action, aggregating all suppliers' workers to the first unit of the hashed unit queue. The application also analyzes the qualifications of the suppliers' workers and executes the dispatching operation based on the analyzed qualifications. By incorporating the worker's service quality into the dispatching share weight, the proportion of suppliers with good service quality can be increased, while the proportion of suppliers with poor service quality can be reduced, thereby improving the enthusiasm of suppliers.

[0131] The software tools or components not belonging to our company that appear in the embodiments of this application are merely examples and do not represent actual use.

[0132] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), and includes several instructions to cause a terminal device (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0133] Obviously, the embodiments described above are only some embodiments of this application, not all embodiments. The accompanying drawings show preferred embodiments of this application, but do not limit the patent scope of this application. This application can be implemented in many different forms; rather, the purpose of providing these embodiments is to provide a more thorough and comprehensive understanding of the disclosure of this application. Although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art can still modify the technical solutions described in the foregoing specific embodiments, or make equivalent substitutions for some of the technical features. Any equivalent structures made using the content of this application's specification and drawings, directly or indirectly applied to other related technical fields, are similarly within the scope of patent protection of this application.

Claims

1. A method for dynamically allocating supplier shares, characterized in that, Includes the following steps: Configure the supplier's unit share, and randomly generate a hashed unit queue based on the supplier's unit share, specifically including: Step 1: Mark each supplier with a supplier identifier character and configure multiple unit yuan shares for each supplier; Step 2: Traverse the unit queue of each supplier backwards, starting from the last unit of each supplier. Step 3: For each unit element traversed, generate a random integer ranging from the current position to the starting position of the unit element queue for that supplier. Step 4: Swap the currently traversed identity element with the identity element at the corresponding position of the random integer; Step 5: Continue to traverse the unit queue forward, repeating steps 3 to 4 until all units in the unit queue of the supplier have been traversed, generating a hash unit queue for each supplier. The hash unit queue is represented by the corresponding supplier identifier character and placeholder sequence number. Step 6: Arrange all the hash unit queues of all suppliers into a queue in order; After the step of arranging the hash unit queues of all suppliers into a queue in order, the method further includes: Configure the unit share cap factor range for all suppliers; When a dispatch action is triggered, all suppliers' workers are aggregated to the first unit of the hash unit queue, and the dispatch percentage of all suppliers is monitored. When the dispatch percentage of the current supplier exceeds the set upper limit, the share of the current supplier is reduced by the upper limit factor, and the share of the remaining suppliers is increased by the upper limit factor. The qualifications of the suppliers' technicians are analyzed, and based on the obtained qualifications, it is determined whether to assign work normally to the first unit of the hash unit queue.

2. The supplier share dynamic allocation method according to claim 1, characterized in that, The steps of analyzing the qualifications of the supplier's technicians and executing work assignment operations based on the analyzed technician qualifications specifically include: Based on the multi-dimensional scoring of the supplier's service profile, the final score of the supplier's service provider is obtained. If the final score is higher than the set excellent score, the master's qualification is recommended as excellent, the first unit of the hash unit queue is moved to the end of the hash unit queue, and the work is assigned normally. If the final score is higher than the score between the excellent score and the blacklist risk control score, then the master's qualification is average, the first unit in the hash unit queue is maintained, and work is assigned normally. If the final score is lower than the blacklist risk control score, then the mentor's qualifications are blacklisted. Take the remaining queue after removing the first unit of the supplier, and move the first unit of the hash unit queue of the remaining queue to the end of the hash unit queue. Repeat the process to judge the qualifications of the remaining mentors. If all the mentors aggregated are blacklisted, then re-aggregate the mentors of the supplier.

3. The supplier share dynamic allocation method according to claim 2, characterized in that, The step of deriving the final rating of the supplier's technicians based on the multi-dimensional scoring of the technician service profile includes: Obtain positive reviews, timeliness, and skill ratings from the supplier's technicians; The obtained positive reviews, timeliness, and professional skills scores are calculated according to preset weights to obtain the final score of the supplier's technician.

4. The supplier share dynamic allocation method according to claim 1, characterized in that, After analyzing the supplier's skilled worker qualifications and determining whether to assign work normally to the first unit of the hash unit queue based on the analyzed qualifications, the method further includes: If it is determined that all units in the hash unit queue are simultaneously subject to dispatch operations, the supplier unit share is reconfigured, and a hash unit queue is randomly generated based on the supplier unit share.

5. The supplier share dynamic allocation method according to claim 4, characterized in that, After the step of reconfiguring the supplier unit share and randomly generating a hash unit queue based on the supplier unit share if it is determined that all units in the hash unit queue are simultaneously subject to dispatch operations, the method further includes: Identify the share of each supplier within a set time period; If the ratio is found to exceed the set value, the supplier's unit will replace the unit of the supplier whose share ratio is lower than the set value in the hash unit queue.

6. A supplier share dynamic allocation device, characterized in that, The supplier share dynamic allocation device implements the steps of the supplier share dynamic allocation method as described in any one of claims 1 to 5, wherein the supplier share dynamic allocation device comprises: The configuration generation module is used to configure the unit share of suppliers and randomly generate a hash unit queue based on the unit share of suppliers. The triggering module is used to trigger the dispatching action, aggregating all suppliers' workers to the first unit of the hash unit queue; The dispatch module is used to analyze the qualifications of the suppliers' workers and determine whether to dispatch the first unit of the hash unit queue normally based on the analyzed qualifications.

7. A computer device, comprising a memory and a processor, characterized in that, The memory stores computer-readable instructions, and when the processor executes the computer-readable instructions, it implements the steps of the supplier share dynamic allocation method as described in any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-readable instructions, which, when executed by a processor, implement the steps of the supplier share dynamic allocation method as described in any one of claims 1 to 5.

Images