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

Abstract

The embodiment of the invention belongs to the field of artificial intelligence, and relates to a supplier share dynamic allocation method, which comprises the following steps: configuring unit element shares of suppliers, and randomly generating a hash unit element queue according to the unit element shares of the suppliers; when a dispatching action is triggered, aggregating the masters of all suppliers to the first unit element of the hash unit element queue; and analyzing the master qualification of the supplier, and determining whether to perform normal dispatching on the first unit element of the hash unit element queue according to the analyzed master qualification. The invention further provides a supplier share dynamic allocation device, computer equipment and a storage medium. According to the invention, an accurate random allocation scheme is realized, and the service quality of the master is brought into the proportion of the dispatching share, so that the proportion of suppliers with good service quality can be improved, the proportion of suppliers with poor service quality can be reduced, and the enthusiasm of the suppliers is improved.

Description

Technical Field

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

[0002] With the expansion of road rescue services, during the service process, the existing dispatching scheme is to dispatch workers by random weight shares, which has the following defects:

[0003] First, the work is simply assigned according to random weight shares. Only in the case of large numbers (extreme values) can the shares be guaranteed to tend to the allocated shares, but in reality the agreed share allocation is basically not achieved.

[0004] Second, the qualifications of the masters assigned to the work share (blacklisted, complained or high-quality service masters) affect the actual allocated shares, and this part of the impact of the work share is not digitized.

[0005] Third, no remedial measures were taken to dynamically limit the shares in response to the imbalance in the time-weighted shares of each stage. Summary of the invention

[0006] The purpose of the embodiments of the present application is to propose a method, device, computer equipment and storage medium for dynamically allocating supplier shares, the main purpose of which is to achieve accurate random allocation and dynamic balance share adjustment, thereby improving the enthusiasm of suppliers.

[0007] In order to solve the above technical problems, the embodiment of the present application provides a method for dynamically allocating supplier shares, which adopts the following technical solution:

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

[0009] Configuring a unit element share of a supplier, and randomly generating a hash unit element queue according to the unit element share of the supplier;

[0010] When the dispatching action is triggered, the masters of all suppliers are aggregated to the first unit of the hash unit queue;

[0011] The qualifications of the suppliers' masters are analyzed, and work dispatching is performed based on the qualifications of the masters obtained through the analysis.

[0012] Furthermore, the step of configuring the unit unit share of the supplier and randomly generating a hash unit unit queue according to the unit unit share of the supplier specifically includes:

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

[0014] Step 2, starting from the last unit element of each supplier, traverse the unit element queue of the supplier forward;

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

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

[0017] Step 5, continue to traverse the unit element queue forward, repeat steps 3 to 4, until all unit elements in the unit element queue of the supplier are traversed, and generate a hash unit element queue of each supplier, wherein the hash unit element queue is represented by a corresponding supplier identification character and a placeholder sequence number;

[0018] Step 6: All suppliers' hash unit queues are organized into queues in order.

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

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

[0021] When it is monitored that the percentage of work assigned to the supplier exceeds the set upper limit, the supplier's share is reduced by the upper limit factor, and the remaining suppliers' shares are increased by the upper limit factor.

[0022] Furthermore, the step of analyzing the qualifications of the suppliers' masters and performing the work dispatching operation according to the qualifications of the masters obtained by the analysis specifically includes:

[0023] Based on the multi-dimensional scoring of the service portrait of the supplier's masters, a final score of the supplier's masters is obtained;

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

[0025] If the final score is higher than the excellent score and the blacklist risk control score, the qualification of the master is general, the first unit element position of the hash unit element queue is maintained, and the work is assigned normally;

[0026] If the final score is lower than the blacklist risk control score, the master's qualification is a blacklist master. The remaining queues except the first unit element of the supplier are removed, and the first unit element of the hash unit element queue of the remaining queues is moved to the end of the hash unit element queue. The remaining master qualifications are judged in a loop. If all the aggregated masters are blacklisted masters, the masters of the supplier are re-aggregated.

[0027] Furthermore, the step of obtaining the final score of the supplier's master based on the multi-dimensional score of the supplier's master service portrait also includes:

[0028] Obtain the praise, timeliness and professional skills ratings of the suppliers’ masters;

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

[0030] Furthermore, after the step of analyzing the qualification of the supplier's master and determining whether to normally dispatch the first unit element of the hash unit element queue according to the qualification of the master obtained by the analysis, the step further includes:

[0031] If it is determined that all the units in the hash unit element queue are simultaneously assigned to work, the supplier unit element share is reconfigured, and a hash unit element queue is randomly generated according to the supplier unit element share.

[0032] Furthermore, after the step of analyzing the qualification of the supplier's master and determining whether to normally dispatch the first unit element of the hash unit element queue according to the qualification of the master obtained by the analysis, the step further includes:

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

[0034] If it is identified that the ratio exceeds the set value, the unit cells of the supplier are replaced with the unit cells of the supplier whose share ratio is lower than the set value in the hash unit cell queue.

[0035] In order to solve the above technical problems, the embodiment of the present application also provides a supplier share dynamic allocation device, which adopts the following technical solution:

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

[0037] A configuration generation module is used to configure the unit element share of the supplier and randomly generate a hash unit element queue according to the unit element share of the supplier;

[0038] A trigger module, used for triggering the dispatching action, aggregating the workers of all suppliers to the first unit element of the hash unit element queue;

[0039] The work dispatching module is used to analyze the qualifications of the suppliers' masters, and determine whether to normally dispatch the first unit element of the hash unit element queue according to the master qualifications obtained by the analysis.

[0040] In order to solve the above technical problems, the embodiment of the present application further provides a computer device, which adopts the following technical solution:

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

[0042] In order to solve the above technical problems, the embodiment of the present application further provides a computer-readable storage medium, which adopts the following technical solution:

[0043] A 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 above.

[0044] Compared with the prior art, the embodiments of the present application mainly have the following beneficial effects: the present application configures the unit element share of the supplier, randomly generates a hash unit element queue according to the unit element share of the supplier, realizes an accurate random allocation scheme, triggers the dispatching action, and aggregates the masters of all suppliers to the first unit element of the hash unit element queue; analyzes the qualifications of the masters of the supplier, executes the dispatching operation according to the master qualifications obtained by the analysis, and incorporates the master 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. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] In order to more clearly illustrate the scheme in the present application, a brief introduction is given below to the drawings required for use in the description of the embodiments of the present application. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0046] Figure 1 is an exemplary system architecture diagram to which the present application may be applied;

[0047] Figure 2 A flowchart of an embodiment of a method for dynamically allocating supplier shares according to the present application;

[0048] Figure 3It is a scheme diagram of an embodiment of the supplier share dynamic allocation method of the present 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 implementation of step S201;

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

[0052] Figure 7 This is a schematic diagram for analyzing the qualifications of the master of the supplier of this application;

[0053] Figure 8 This is a schematic diagram of the dynamic balance share adjustment of this application;

[0054] Fig. 9 is a structural schematic diagram of an embodiment of a device for dynamically allocating supplier shares according to the present application;

[0055] Fig.10 It is a structural diagram of an embodiment of a computer device according to the present application. DETAILED DESCRIPTION

[0056] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by technicians in the technical field of the present application; the terms used in the specification of the application herein are only for the purpose of describing specific embodiments and are not intended to limit the present application; the terms "including" and "having" and any variations thereof in the specification and claims of the present application and the above-mentioned drawings are intended to cover non-exclusive inclusions. The terms "first", "second", etc. in the specification and claims of the present application or the above-mentioned drawings are used to distinguish different objects, not to describe a specific order.

[0057] Reference to "embodiments" herein means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present application. The appearance of the phrase in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.

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

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

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

[0061] Terminal devices 101, 102, 103 can be various electronic devices with display screens and supporting web browsing, including but not limited to smart phones, tablet computers, e-book readers, MP3 players (Moving Picture E perts Group Audio Layer III), MP4 (Moving Picture E perts Group Audio Layer IV) players, laptop computers and desktop computers, etc.

[0062] The server 105 may be a server that provides various services, such as a background server that provides support for web pages displayed on the terminal devices 101 , 102 , and 103 .

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

[0064] It should be understood that Figure 1 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to the implementation requirements.

[0065] Continue to refer Figure 2 and Figure 3 , shows a flow chart of an embodiment of a method for dynamically allocating supplier shares according to the present application. The method for dynamically allocating supplier shares comprises the following steps:

[0066] Step S201, configuring the unit unit share of the supplier, and randomly generating a hash unit unit queue according to the unit unit share of the supplier.

[0067] In this embodiment, the electronic device (eg Figure 1 The server shown in the figure) can be connected by wired connection or wireless connection. It should be noted that the above wireless connection methods may include but are not limited to 3G / 4G / 5G connection, WiFi connection, Bluetooth connection, WiMA supplier share dynamic allocation connection, Zigbee connection, UWB (ultra wideband) connection, and other wireless connection methods currently known or to be developed in the future.

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

[0069] Step S2011, marking a supplier identification character for each supplier, and configuring a plurality of unit yuan shares for each supplier.

[0070] Step S2012, traverse the unit element queue of each supplier forward starting from the last unit element of the supplier.

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

[0072] Step S2014, swap the currently traversed unit element with the unit element at the corresponding position of the random integer.

[0073] Step S2015, continue to traverse the unit element queue forward until all unit elements in the unit element queue of the supplier are traversed, and generate a hash unit element queue of each supplier, wherein the hash unit element queue is represented by a corresponding supplier identification character and a placeholder serial number.

[0074] Step S2016, the hash unit element queues of all suppliers are arranged into queues in order; thereby realizing the random generation of hash unit element queues. In this embodiment, for example, the total share of suppliers is 100 unit elements, of which supplier A is 35 unit elements, marked as a, supplier B is 40 unit elements, marked as b, and supplier C is 25 unit elements, marked as c. After executing the above step S201, the hash unit element queue is randomly generated as shown in Table 1:

[0075] Table 1

[0076] a18 b20 c2 c17 ……… a34

[0077] Wherein, a, b, c represent suppliers A, B, C respectively, and the numbers are expressed in units.

[0078] This embodiment configures the unit element share of the supplier, and a hash unit element queue can be randomly generated according to the supplier's unit element share, so as to facilitate the subsequent determination of whether to normally assign work to the first unit element in the hash unit element queue according to the supplier's master qualifications.

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

[0080] A unit yuan share upper limit factor amplitude is configured for all suppliers. If the supplier's work assignment percentage exceeds the set upper limit, the supplier's share is reduced by the upper limit factor amplitude, and the remaining supplier's shares are independently increased by the upper limit factor amplitude; if the supplier's work assignment percentage is lower than the set upper limit, the supplier's share is increased by the upper limit factor amplitude.

[0081] This solution can be used to deal with a sudden increase in the dispatch share of a single supplier in a short period of time. Suppliers who exceed the configured share or have a small share cannot reach the share order volume. By setting the share upper limit factor amplitude K, the purpose of dynamic balance share adjustment can be achieved, so that the probability is maintained in a certain range, realizing the flexibility and stability of the share algorithm.

[0082] Step S202, when the dispatching action is triggered, aggregate the workers of all suppliers to the first unit element of the hash unit element queue.

[0083] For example, all registered roadside assistance technicians under the aggregation suppliers A, B, and C, including but not limited to repair technicians, towing technicians, etc.

[0084] In this embodiment, the dispatch action can be triggered by the user placing an order on the mobile APP, for example Figure 3 The aggregate suppliers A, B, C are aa, bb, cc to a18 units.

[0085] Step S203, analyzing the qualification of the supplier's workers, and determining whether to assign the first unit element of the hash unit element queue normally according to the qualification of the workers obtained by the analysis.

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

[0087] Step S2031, based on the multi-dimensional scoring of the supplier's master service portrait, obtain the final scoring of the supplier's master.

[0088] In this embodiment, the supplier's masters can be scored for their good reviews, timeliness, professional skills, etc., and then curves or character portraits can be drawn based on multiple dimensions such as good reviews, timeliness, professional skills, etc. using existing technology.

[0089] Step S2032, if the final score is higher than the set excellent score, the master qualification is recommended as high-quality, the first unit element of the hash unit element queue is moved to the end of the hash unit element queue, and the work is assigned normally.

[0090] In this embodiment, the dispatching is normally carried out as follows: Figure 3 Start at the end of the queue in, such as a34.

[0091] Step S2033, if the final score is higher than the excellent score and the blacklist risk control score, the master qualification is general, the first unit element position of the hash unit element queue is maintained, and the work is assigned normally, such as Figure 3 In the example, if the qualification of the master is average, the position of the first unit element remains unchanged. For example, if the qualification of the master of b20 is average, the position of b20 remains unchanged.

[0092] Step S2034, if the final score is lower than the blacklist risk control score, the master's qualification is a blacklist master. Remove the remaining queues without the first unit element of the supplier, and move the first unit element of the hash unit element queue of the remaining queue to the end of the hash unit element queue. The remaining master qualifications are judged in a loop. If all the aggregated masters are blacklisted masters, the masters of the supplier are re-aggregated.

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

[0094] This embodiment can be used to analyze the qualifications of the suppliers' workers, and determine whether to assign work normally to the first unit element in the hash unit element queue based on the qualifications of the workers obtained by the analysis.

[0095] For further information, see Figure 7 As shown, step S2031 specifically includes:

[0096] Get the praise, timeliness and professional skills ratings of the craftsmen of the supplier.

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

[0098] For example, in this embodiment, the weight of favorable comments 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 the units in the hash unit queue are dispatched at the same time, that is, all the units are exhausted, then return to step S201, that is, reconfigure the supplier unit share, and randomly generate a 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, determining the share ratio of each supplier within a set time, if the ratio exceeds a set value, replacing the unit element of the supplier with a share ratio lower than the set value in the hash unit element queue.

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

[0104] That is to say, when the share ratio of a supplier is too high in a short period of time, suppliers with smaller shares will be compensated to limit the number of units of suppliers with higher shares.

[0105] The present application configures the unit element share of the supplier, randomly generates a hash unit element queue according to the unit element share of the supplier, realizes an accurate random allocation scheme, triggers the dispatching action, and aggregates the masters of all suppliers to the first unit element of the hash unit element queue; analyzes the qualifications of the masters of the supplier, executes the dispatching operation according to the master qualifications obtained by the analysis, 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.

[0106] The embodiments of the present application can acquire and process relevant data based on artificial intelligence technology. Among them, artificial intelligence (AI) is the theory, method, technology and application system that uses digital computers or machines controlled by digital computers to simulate, extend and expand human intelligence, perceive the environment, acquire knowledge and use knowledge to obtain the best results.

[0107] AI basic technologies generally include sensors, dedicated AI chips, cloud computing, distributed storage, big data processing technology, operation / interaction systems, mechatronics, etc. AI software technologies mainly include computer vision technology, robotics technology, biometrics technology, speech processing technology, natural language processing technology, and machine learning / deep learning.

[0108] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through computer-readable instructions, and the computer-readable instructions can be stored in a computer-readable storage medium. When the program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, the aforementioned storage medium can be a non-volatile storage medium such as a disk, an optical disk, a read-only memory (ROM), or a random access memory (RAM).

[0109] It should be understood that, although the steps in the flowchart of the accompanying drawings are displayed in sequence as indicated by the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least a part of the steps in the flowchart of the accompanying drawings may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and their execution order is not necessarily sequential, but can be executed in turn or alternately with other steps or at least a part of the sub-steps or stages of other steps.

[0110] Further references Figure 5 , as a response to the above Figure 2 The present application provides an embodiment of a device for dynamically allocating supplier shares. Figure 2 Corresponding to the method embodiment shown, the device can be specifically applied to various electronic devices.

[0111] like Fig. 9 As shown, the supplier share dynamic allocation device 900 described in this embodiment includes: a configuration generation module 901, a trigger module 902, and a work dispatching module 903. Among them:

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

[0113] The trigger module 902 is used to trigger the dispatching action, and aggregate the masters of all suppliers to the first unit element of the hash unit element queue.

[0114] The work dispatching module 903 is used to analyze the qualifications of the suppliers' masters, and determine whether to normally dispatch the first unit element of the hash unit element queue according to the master qualifications obtained by the analysis.

[0115] The present application configures the unit element share of the supplier by configuring the generation module 901, randomly generates a hash unit element queue according to the supplier unit element share, and realizes an accurate random allocation scheme. The trigger module 902 triggers the dispatching action, and aggregates the masters of all suppliers to the first unit element of the hash unit element queue; the dispatching module 903 analyzes the qualifications of the masters of the supplier, executes the dispatching operation according to the master qualifications obtained by the analysis, and incorporates the master 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.

[0116] The present application configures the unit element share of the supplier, randomly generates a hash unit element queue according to the unit element share of the supplier, realizes an accurate random allocation scheme, triggers the dispatching action, and aggregates the masters of all suppliers to the first unit element of the hash unit element queue; analyzes the qualifications of the masters of the supplier, executes the dispatching operation according to the master qualifications obtained by the analysis, 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.

[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 element share and randomly generate a hash unit element queue according to the supplier unit element share if it is determined that all unit elements in the hash unit element queue are simultaneously dispatched, that is, all unit elements are exhausted.

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

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

[0121] That is to say, when the share ratio of a supplier is too high in a short period of time, suppliers with smaller shares will be compensated to limit the number of units of suppliers with higher shares.

[0122] To solve the above technical problems, the present application also provides a computer device. Fig.10 , Fig.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 and communicated through a system bus. It should be noted that the figure only shows a computer device 1000 having components 1001-1003, but it should be understood that it is not required to implement all the components shown, and more or fewer components can be implemented instead. Among them, those skilled in the art can understand that the computer device here is a device that can automatically perform 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 (Application Specific Integrated Circuit, ASIC), field-programmable gate arrays (Field-Programmable Gate Array, FPGA), digital processors (Digital Signal Processor, DSP), embedded devices, etc.

[0124] The computer device may be a computing device such as a desktop computer, a notebook, a PDA, a cloud server, etc. The computer device may interact with a user through a keyboard, a mouse, a remote controller, a touch pad, or a voice control device.

[0125] The memory 1001 includes at least one type of readable storage medium, and the readable storage medium includes flash memory, hard disk, multimedia card, card-type memory (for example, SD or D supplier share dynamic allocation memory, etc.), 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 can be an internal storage unit of the computer device 1000, such as a hard disk or memory of the computer device 1000. In other embodiments, the memory 1001 can also be an external storage device of the computer device 1000, such as a plug-in hard disk equipped on the computer device 1000, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc. Of course, the memory 1001 can also include both the internal storage unit of the computer device 1000 and its external storage device. In this embodiment, the memory 1001 is generally used to store the operating system and various application software installed on the computer device 1000, such as computer-readable instructions of the supplier share dynamic allocation method. In addition, the memory 1001 can also be used to temporarily store various data that have been output or will be output.

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

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

[0128] The present application configures the unit element share of the supplier, randomly generates a hash unit element queue according to the unit element share of the supplier, realizes an accurate random allocation scheme, triggers the dispatching action, and aggregates the masters of all suppliers to the first unit element of the hash unit element queue; analyzes the qualifications of the masters of the supplier, executes the dispatching operation according to the master qualifications obtained by the analysis, 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.

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

[0130] The present application configures the unit element share of the supplier, randomly generates a hash unit element queue according to the unit element share of the supplier, realizes an accurate random allocation scheme, triggers the dispatching action, and aggregates the masters of all suppliers to the first unit element of the hash unit element queue; analyzes the qualifications of the masters of the supplier, executes the dispatching operation according to the master qualifications obtained by the analysis, 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.

[0131] The non-Company software tools or components appearing in the embodiments of this application are merely examples and do not represent actual use.

[0132] 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 application, 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, magnetic disk, optical disk), and includes a number of instructions for a terminal device (which can be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in each embodiment of the present application.

[0133] Obviously, the embodiments described above are only some embodiments of the present application, rather than all embodiments. The preferred embodiments of the present application are given in the accompanying drawings, but they do not limit the patent scope of the present application. The present application can be implemented in many different forms. On the contrary, the purpose of providing these embodiments is to make the understanding of the disclosure of the present application more thorough and comprehensive. Although the present application is described in detail with reference to the aforementioned embodiments, for those skilled in the art, it is still possible to modify the technical solutions recorded in the aforementioned specific implementation methods, or to perform equivalent replacement of some of the technical features therein. Any equivalent structure made using the contents of the specification and drawings of this application, directly or indirectly used in other related technical fields, is similarly within the scope of patent protection of this application.

Claims

1. A method for dynamically allocating supplier shares, characterized in that: The steps include: Configuring a unit element share of a supplier, and randomly generating a hash unit element queue according to the unit element share of the supplier; When the dispatching action is triggered, the masters of all suppliers are aggregated to the first unit of the hash unit queue; The qualification of the master of the supplier is analyzed, and according to the qualification of the master obtained by the analysis, it is determined whether to normally assign the first unit element of the hash unit element queue.

2. The method for dynamically allocating supplier shares according to claim 1, characterized in that: The step of configuring the unit element share of the supplier and randomly generating a hash unit element queue according to the unit element share of the supplier specifically includes: Step 1: Mark each supplier with a supplier identification character, and configure multiple unit yuan shares for each supplier; Step 2, starting from the last unit element of each supplier, traverse the unit element queue of the supplier forward; Step 3: for each traversed unit element, generate a random integer ranging from the current position to the starting position of the unit element queue of the supplier; Step 4: exchange the currently traversed unit element with the unit element at the corresponding position of the random integer; Step 5, continue to traverse the unit element queue forward, repeat steps 3 to 4, until all unit elements in the unit element queue of the supplier are traversed, and generate a hash unit element queue of each supplier, wherein the hash unit element queue is represented by a corresponding supplier identification character and a placeholder sequence number; Step 6: All suppliers' hash unit queues are organized into queues in order.

3. The method for dynamically allocating supplier shares according to claim 2, characterized in that: After the step of sequentially assembling the hash unit queues of all suppliers into a queue, the method further includes: Configure unit share cap factor amplitude for all suppliers; When it is monitored that the percentage of work assigned to the supplier exceeds the set upper limit, the supplier's share is reduced by the upper limit factor, and the remaining suppliers' shares are increased by the upper limit factor.

4. The method for dynamically allocating supplier shares according to claim 1, characterized in that: The step of analyzing the qualifications of the supplier's craftsmen and performing the work dispatching operation according to the qualifications of the craftsmen obtained by the analysis specifically includes: Based on the multi-dimensional scoring of the service portrait of the supplier's master, a final score of the supplier's master is obtained; If the final score is higher than the set excellent score, the master's qualification is recommended as high-quality, the first unit element of the hash unit element queue is moved to the end of the hash unit element queue, and the work is assigned normally; If the final score is higher than the excellent score and the blacklist risk control score, the qualification of the master is general, the first unit element position of the hash unit element queue is maintained, and the work is assigned normally; If the final score is lower than the blacklist risk control score, the master's qualification is a blacklist master. The remaining queues except the first unit element of the supplier are removed, and the first unit element of the hash unit element queue of the remaining queues is moved to the end of the hash unit element queue. The remaining master qualifications are judged in a loop. If all the aggregated masters are blacklisted masters, the masters of the supplier are re-aggregated.

5. The method for dynamically allocating supplier shares according to claim 4, characterized in that: The step of obtaining the final score of the supplier's master based on the multi-dimensional score of the supplier's master service portrait includes: Obtain the praise, timeliness and professional skills ratings of the suppliers’ masters; The obtained favorable comments, timeliness and professional skills scores are calculated according to the preset weights to obtain the final score of the supplier's master.

6. The method for dynamically allocating supplier shares according to claim 1, characterized in that: After the step of analyzing the qualification of the supplier's technicians and determining whether to assign the first unit element of the hash unit element queue normally according to the qualification of the technicians obtained by the analysis, the method further includes: If it is determined that all the units in the hash unit element queue are simultaneously assigned to work, the supplier unit element share is reconfigured, and a hash unit element queue is randomly generated according to the supplier unit element share.

7. The method for dynamically allocating supplier shares according to claim 6, characterized in that: After the step of reconfiguring the supplier unit element share if it is determined that all unit elements in the hash unit element queue are simultaneously assigned, and randomly generating a hash unit element queue according to the supplier unit element share, the method further includes: Identify the share ratio of each supplier within a set time period; If it is identified that the ratio exceeds the set value, the unit cells of the supplier are replaced with the unit cells of the supplier whose share ratio is lower than the set value in the hash unit cell queue.

8. A supplier share dynamic allocation device, characterized in that: include: A configuration generation module is used to configure the unit element share of the supplier and randomly generate a hash unit element queue according to the unit element share of the supplier; A trigger module, used for triggering the dispatching action, aggregating the workers of all suppliers to the first unit element of the hash unit element queue; The work dispatching module is used to analyze the qualifications of the suppliers' masters, and determine whether to normally dispatch the first unit element of the hash unit element queue according to the master qualifications obtained by the analysis.

9. 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, the steps of the method for dynamically allocating supplier shares as described in any one of claims 1 to 7 are implemented.

10. 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 method for dynamically allocating supplier shares as described in any one of claims 1 to 7.

Images