CN113469423A - Resource allocation method, device, storage medium and electronic equipment - Google Patents
Resource allocation method, device, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN113469423A CN113469423A CN202110678213.XA CN202110678213A CN113469423A CN 113469423 A CN113469423 A CN 113469423A CN 202110678213 A CN202110678213 A CN 202110678213A CN 113469423 A CN113469423 A CN 113469423A
- Authority
- CN
- China
- Prior art keywords
- resource
- scheme
- allocation
- allocated
- resources
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 46
- 238000013468 resource allocation Methods 0.000 title claims abstract description 33
- 238000004590 computer program Methods 0.000 claims description 21
- 238000012216 screening Methods 0.000 claims description 6
- 238000004422 calculation algorithm Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000014509 gene expression Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063112—Skill-based matching of a person or a group to a task
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063118—Staff planning in a project environment
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application provides a resource allocation method, a device, a storage medium and an electronic device, wherein the resource allocation method comprises the following steps: acquiring n resource receivers and m resources to be distributed; determining an initial allocation scheme of n resource receivers and m resources to be allocated; generating a plurality of candidate allocation schemes within a neighborhood based on the initial allocation scheme; a target allocation scheme is determined based on the plurality of candidate allocation schemes. According to the method and the device, a plurality of candidate allocation schemes in each neighborhood are searched based on the initial allocation scheme until a target allocation scheme, namely an optimal allocation scheme, is determined, so that the matching degree between a resource receiver and the resource to be allocated can be effectively improved, the working efficiency of a salesman (the resource receiver) can be effectively improved, and the satisfaction degree of a customer (the resource to be allocated) can be improved.
Description
Technical Field
The present application relates to the field of resource scheduling technologies, and in particular, to a resource allocation method, an apparatus, a storage medium, and an electronic device.
Background
In the modern market economy environment, a plurality of resources are reasonably distributed in an increasing scene, for example, a business distributes a plurality of clients to a plurality of sales personnel, a logistics company distributes a plurality of distribution areas to a plurality of couriers, and the like.
In the prior art, the allocation manner is simple, for example, when an enterprise allocates a plurality of customers to a plurality of sales personnel, the enterprise usually allocates the plurality of customers to the plurality of sales personnel by adopting a random allocation manner or an allocation manner based on a single index, which results in a low matching degree between the customers and the sales personnel, and further affects the work efficiency of the sales personnel and results in a low satisfaction degree of the customers.
Disclosure of Invention
In view of this, embodiments of the present application provide a resource allocation method, a resource allocation device, a storage medium, and an electronic device, so as to solve the problem of low matching degree in the prior art.
In a first aspect, an embodiment of the present application provides a resource allocation method, where the method includes:
acquiring n resource receivers and m resources to be distributed;
determining an initial allocation scheme of the n resource receivers and the m resources to be allocated;
generating a plurality of candidate allocation schemes within a neighborhood based on the initial allocation scheme;
a target allocation scheme is determined based on a plurality of the candidate allocation schemes.
In a possible embodiment, the determining an initial allocation scheme of the n resource receivers and the m resources to be allocated includes:
calculating the matching degree of each resource receiver aiming at each resource to be distributed;
and according to the sequence from high matching degree to low matching degree, allocating a first preset number of the resources to be allocated to each resource receiver to obtain the initial allocation scheme.
In one possible implementation, the resource allocation method further includes:
determining whether there is a free resource receiver which is not allocated with the resource to be allocated;
and if so, selecting the resource to be allocated with the lowest matching degree, and allocating the resource to be allocated with the lowest matching degree to the vacant resource receiver.
In one possible embodiment, the generating a plurality of candidate allocation schemes within a neighborhood based on the initial allocation scheme comprises:
and exchanging the second preset number of the resources to be allocated in the initial allocation scheme according to a preset exchange rule to obtain the candidate allocation scheme.
In a possible implementation, the resource allocation method further includes:
and storing each candidate allocation scheme and the exchanged resources to be allocated corresponding to the candidate allocation scheme to a record table.
In one possible embodiment, the determining a target allocation scheme based on a plurality of the candidate allocation schemes includes:
screening a better allocation scheme from a plurality of the candidate allocation schemes;
in the case that the better distribution scheme is better than the optimal distribution scheme in the record table, adding the better distribution scheme into the record table, taking the better distribution scheme as the optimal distribution scheme in the record table, and replacing the initial distribution scheme with the better distribution scheme;
determining whether a stop condition is satisfied;
if so, taking the optimal distribution scheme as the target distribution scheme;
if not, generating a plurality of candidate allocation schemes in the neighborhood by using the new initial allocation scheme until the target allocation scheme is determined.
In a possible embodiment, the determining a conversation topic based on each clustering result includes:
under the condition that the optimal distribution scheme in the record table is superior to the optimal distribution scheme, selecting other distribution schemes except the record table to replace the initial distribution scheme;
determining whether a stop condition is satisfied;
if so, taking the optimal distribution scheme as the target distribution scheme;
if not, generating a plurality of candidate allocation schemes in the neighborhood by using the new initial allocation scheme until the target allocation scheme is determined.
In a second aspect, an embodiment of the present application further provides a resource allocation apparatus, where the resource allocation apparatus includes:
an acquisition module which configuratively acquires n resource receivers and m resources to be allocated;
a first determining module configured to determine an initial allocation scheme of the n resource recipients and the m resources to be allocated;
a generation module configured to generate a plurality of candidate allocation plans within a neighborhood based on the initial allocation plan;
a second determination module configured to determine a target allocation scheme based on a plurality of the candidate allocation schemes.
In a third aspect, the present disclosure also provides a storage medium, wherein the computer readable storage medium has a computer program stored thereon, and the computer program when executed by a processor performs the following steps:
acquiring n resource receivers and m resources to be distributed;
determining an initial allocation scheme of the n resource receivers and the m resources to be allocated;
generating a plurality of candidate allocation schemes within a neighborhood based on the initial allocation scheme;
a target allocation scheme is determined based on a plurality of the candidate allocation schemes.
In a fourth aspect, the present disclosure also provides an electronic device, including: a processor and a memory, the memory storing machine-readable instructions executable by the processor, the processor and the memory communicating over a bus when an electronic device is operating, the machine-readable instructions when executed by the processor performing the steps of:
acquiring n resource receivers and m resources to be distributed;
determining an initial allocation scheme of the n resource receivers and the m resources to be allocated;
generating a plurality of candidate allocation schemes within a neighborhood based on the initial allocation scheme;
a target allocation scheme is determined based on a plurality of the candidate allocation schemes.
According to the method and the device, the multiple candidate allocation schemes in each neighborhood are searched based on the initial allocation scheme until the target allocation scheme, namely the optimal allocation scheme, is determined, so that the matching degree between the resource receiver and the resource to be allocated can be effectively improved, the working efficiency of a salesman (the resource receiver) can be effectively improved, and the satisfaction degree of a customer (the resource to be allocated) can be improved.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only some embodiments described in the present disclosure, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart illustrating a resource allocation method provided herein;
FIG. 2 is a flow chart illustrating a method for determining an initial allocation scheme in a resource allocation method provided in the present application;
fig. 3 is a flowchart illustrating a method for improving the quality of an initial allocation scheme in a resource allocation method provided in the present application;
FIG. 4 is a flow chart illustrating a method for determining a target allocation scheme in resource allocation provided by the present application;
fig. 5 is a schematic structural diagram illustrating a resource allocation apparatus provided in the present application;
fig. 6 shows a schematic structural diagram of an electronic device provided in the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the drawings of the embodiments of the present application. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the described embodiments of the application without any inventive step, are within the scope of protection of the application.
Unless defined otherwise, technical or scientific terms used herein shall have the ordinary meaning as understood by one of ordinary skill in the art to which this application belongs. As used in this application, the terms "first," "second," and the like do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that the element or item listed before the word covers the element or item listed after the word and its equivalents, but does not exclude other elements or items. The terms "connected" or "coupled" and the like are not restricted to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", and the like are used merely to indicate relative positional relationships, and when the absolute position of the object being described is changed, the relative positional relationships may also be changed accordingly.
Detailed descriptions of known functions and known components are omitted in the present application in order to keep the following description of the embodiments of the present application clear and concise.
As shown in fig. 1, which is a flowchart of a resource allocation method provided in the first aspect of the present application, the specific steps include S101-S104.
S101, acquiring n resource receivers and m resources to be distributed.
In order to facilitate detailed explanation of the technical scheme, in the embodiment of the application, an enterprise allocates a plurality of clients to a plurality of salesmen as an example, and in the application scenario, the resource receiver is a salesmen and the resource to be allocated is a client.
In specific implementation, n resource receivers and m resources to be allocated are obtained, and then the m resources to be allocated can be reasonably allocated to the n resource receivers through subsequent calculation.
S102, determining n resource receivers and m initial allocation schemes of resources to be allocated.
In a specific implementation, in consideration of the importance of the initial allocation scheme to subsequent calculation, the embodiment of the application adopts a construction algorithm to generate the initial allocation scheme with better quality.
Specifically, the initial allocation schemes of n resource receivers and m resources to be allocated may be determined with reference to the method steps shown in fig. 2, specifically including S201 and S202.
S201, aiming at each resource to be distributed, calculating the matching degree of each resource receiver.
S202, distributing a first preset number of resources to be distributed to each resource receiver according to the sequence from high matching degree to low matching degree to obtain an initial distribution scheme.
And respectively calculating the matching degree between each resource to be distributed and each resource receiver according to the attribute information of each resource to be distributed and the attribute information of each resource receiver. For example, in the application scenario of the embodiment of the present application, the attribute information of the resource to be allocated includes potential value, gender, age, hobby, and development business of an enterprise, and the like of the client, and the attribute information of the resource receiver includes a business field which is good at the resource receiver, a capability level, a busyness degree, gender, age, hobby, personal interest, and business familiarity, and the like. Of course, the attribute information of the resource to be allocated and the attribute information of the resource receiver are not limited thereto, and may be adjusted according to actual requirements, and in different scenarios, the attribute information of the resource to be allocated and the attribute information of the resource receiver are different, as long as the matching degree between the resource to be allocated and the resource receiver can be calculated more accurately.
In specific implementation, each resource receiver corresponds to the number of resources to be allocated that each resource receiver can receive, that is, a first preset number, for example, each salesperson sets the number of customers that each resource receiver can accept, so as to avoid the problem that each customer cannot be docked due to too large accepting number, which results in customer dissatisfaction.
There may also be resource receivers that are not allocated with the resources to be allocated, that is, the current m resources to be allocated are not adapted to the resource receivers, that is, there is a condition that the number of the resources to be allocated by the resource receivers is greater than the corresponding first preset number, which may affect the work efficiency of the salespersons and result in low satisfaction of the customers. Therefore, the quality of the initial allocation scheme is further improved according to the method steps shown in fig. 3, wherein the specific steps include S301 and S302.
S301, determining whether a vacant resource receiver without the resource to be allocated exists.
S302, if the resource exists, the resource to be distributed with the lowest matching degree is selected, and the resource to be distributed with the lowest matching degree is distributed to the vacant resource receiver.
Specifically, whether an unoccupied resource receiver which is not allocated with the resources to be allocated exists in the current initial allocation scheme is judged, the resources to be allocated with the lowest matching degree are selected under the condition that the unoccupied resource receiver exists, and the resources to be allocated with the lowest matching degree are allocated to the unoccupied resource receiver, so that the rationality of the initial allocation scheme is ensured.
The expression form of the initial allocation scheme may be a table, for example, n is 3, and is a salesman a, a salesman B, and a salesman C; m is 10, and is respectively client 1, client 2, client 3, client 4, client 5, client 6, client 7, client 8, client 9 and client 10, and the initial allocation scheme calculated is as follows:
| A | 1 | 4 | 6 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| B | 3 | 7 | 10 | 9 | 2 | 0 | 0 | 0 | 0 | 0 |
| C | 5 | 8 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
the above table means: customer 1, customer 4, customer 6 are assigned to salesperson a, customer 3, customer 7, customer 10, customer 9 are assigned to salesperson B, and customer 5, customer 8 are assigned to salesperson C.
Of course, other expressions may be adopted to show the initial allocation scheme, and this is not specifically limited in the embodiment of the present application.
S103, a plurality of candidate allocation schemes are generated in the neighborhood based on the initial allocation scheme.
In order to avoid the technical problem that the accuracy of the final target allocation scheme is low due to the area limitation, in the embodiment of the application, after the initial allocation scheme is obtained, the resources to be allocated in the second preset number in the initial allocation scheme are exchanged according to the preset exchange rule, so that the candidate allocation scheme is obtained.
Wherein, the preset exchange rule is as follows: and randomly selecting one resource receiver, removing all the distributed resources to be distributed, distributing the resources to other resource receivers according to the maximum matching degree, and distributing the resources to be distributed with the lowest matching degree and the highest removed sales matching degree of other resource receivers to the resource receivers with all the distributed resources to be distributed removed. By adopting the method, the algorithm enters a completely new area to start searching, the local optimum is prevented from being trapped, the area limitation is eliminated, and the accuracy of the target distribution scheme is improved.
And storing each candidate allocation scheme and the exchanged resources to be allocated corresponding to the candidate allocation scheme to the record table. The record table includes a second preset number of values, resources to be allocated for each exchange, candidate allocation schemes obtained after each exchange is completed, an optimal allocation scheme in the current record table, and the like. If the value of the second preset number is too small, the algorithm is easy to fall into local optimum, namely repeated searching is carried out in the same area, and a candidate allocation scheme in a neighborhood cannot be searched by jumping out of the current area; if the value of the second preset number is too large, all candidate allocation schemes may be prohibited, that is, the candidate allocation schemes cannot be determined as the target allocation scheme, which results in long calculation time and even results in an algorithm that cannot obtain an optimal result.
Before the resource to be allocated is exchanged according to the preset exchange rule, the existing exchange in the record table is checked, and the repeated calculation field and the candidate allocation scheme are avoided.
S104, determining a target allocation scheme based on the plurality of candidate allocation schemes.
After obtaining the multiple candidate allocation schemes in the neighborhood, determining a target allocation scheme based on the multiple candidate allocation schemes, specifically, the target allocation scheme may be determined by referring to a method flowchart shown in fig. 4, where the specific steps include S401-S406.
S401, screening a better distribution scheme from a plurality of candidate distribution schemes.
S402, under the condition that the optimal distribution scheme is superior to the optimal distribution scheme in the record table, the optimal distribution scheme is added into the record table, the optimal distribution scheme is used as the optimal distribution scheme in the record table, and the initial distribution scheme is replaced by the optimal distribution scheme.
And S403, under the condition that the optimal distribution scheme in the record table is better than the optimal distribution scheme, selecting other distribution schemes except the record table to replace the initial distribution scheme.
S404, whether the stop condition is met is determined.
And S405, if so, taking the optimal distribution scheme as a target distribution scheme.
S406, if not, generating a plurality of candidate allocation schemes in the neighborhood by using the new initial allocation scheme until determining a target allocation scheme.
In specific implementation, after a plurality of candidate distribution schemes are obtained, a better distribution scheme is screened from the candidate distribution schemes, the better distribution scheme is compared with the optimal distribution scheme in the record table, if the better distribution scheme is better than the optimal distribution scheme, the better distribution scheme is added into the record table, the better distribution scheme is used as the optimal distribution scheme in the record table, and the better distribution scheme is used for replacing the initial distribution scheme; and if the optimal distribution scheme is better than the optimal distribution scheme, selecting other distribution schemes except the record table to replace the initial distribution scheme.
After updating the initial allocation scheme, it is determined whether a stop condition is satisfied. A preset threshold of the number of updates of the initial distribution scheme may be preset, and when it is determined that the number of updates of the initial distribution scheme reaches the preset threshold, it is determined that the stop condition is satisfied, otherwise, it is determined that the stop condition is not satisfied; the change condition of the optimal distribution scheme in the record table can be determined, if the optimal distribution scheme in the record table is not changed after a certain number of updating times, the stop condition is determined to be met, otherwise, the stop condition is determined not to be met, and the like.
Further, in the case that the stop condition is satisfied, the optimal allocation plan is taken as a target allocation plan; in the event that the stopping condition is not met, a plurality of candidate allocation plans are generated within the neighborhood using the new initial allocation plan until a target allocation plan is determined.
The specific algorithm can refer to formulas (1) - (4):
wherein n denotes a resource receiver, m denotes a resource to be allocated, and X denotesijIndicates that the resource j to be allocated is allocated to the resource receiver i, PijThe matching degree between the resource j to be distributed and the resource receiver i is represented, and the first preset quantity corresponding to each resource receiver is represented.
In addition, a person skilled in the art may adjust the above formula according to actual requirements, and the embodiment of the present application is not limited thereto.
According to the method and the device, the multiple candidate allocation schemes in each neighborhood are searched based on the initial allocation scheme until the target allocation scheme, namely the optimal allocation scheme, is determined, so that the matching degree between the resource receiver and the resource to be allocated can be effectively improved, the working efficiency of a salesman (the resource receiver) can be effectively improved, and the satisfaction degree of a customer (the resource to be allocated) can be improved.
Based on the same inventive concept, the second aspect of the present application further provides a resource allocation apparatus corresponding to the resource allocation method, and since the principle of the resource allocation apparatus in the present application for solving the problem is similar to the resource allocation method described above in the present application, the implementation of the resource allocation apparatus may refer to the implementation of the method, and repeated details are omitted.
Fig. 5 shows a schematic diagram of an electronic device provided in an embodiment of the present application, which specifically includes:
an obtaining module 501, configured to obtain n resource receivers and m resources to be allocated;
a first determining module 502 configured to determine an initial allocation scheme of n of the resource receivers and m of the resources to be allocated;
a generation module 503 configured to generate a plurality of candidate allocation schemes within a neighborhood based on the initial allocation scheme;
a second determination module 504 configured to determine a target allocation scheme based on a plurality of the candidate allocation schemes.
In another embodiment, the first determining module 502 is specifically configured to:
calculating the matching degree of each resource receiver aiming at each resource to be distributed;
and according to the sequence from high matching degree to low matching degree, allocating a first preset number of the resources to be allocated to each resource receiver to obtain the initial allocation scheme.
In yet another embodiment, the first determining module 502 is further configured to:
determining whether there is a free resource receiver which is not allocated with the resource to be allocated;
and if so, selecting the resource to be allocated with the lowest matching degree, and allocating the resource to be allocated with the lowest matching degree to the vacant resource receiver.
In another embodiment, the generating module 503 is specifically configured to:
and exchanging the second preset number of the resources to be allocated in the initial allocation scheme according to a preset exchange rule to obtain the candidate allocation scheme.
In yet another embodiment, the resource allocation apparatus further comprises a storage module 505 configured to:
and storing each candidate allocation scheme and the exchanged resources to be allocated corresponding to the candidate allocation scheme to a record table.
In another embodiment, the second determining module 504 is specifically configured to:
screening a better allocation scheme from a plurality of the candidate allocation schemes;
in the case that the better distribution scheme is better than the optimal distribution scheme in the record table, adding the better distribution scheme into the record table, taking the better distribution scheme as the optimal distribution scheme in the record table, and replacing the initial distribution scheme with the better distribution scheme;
determining whether a stop condition is satisfied;
if so, taking the optimal distribution scheme as the target distribution scheme;
if not, generating a plurality of candidate allocation schemes in the neighborhood by using the new initial allocation scheme until the target allocation scheme is determined.
In yet another embodiment, the second determination module 504 is further configured to:
under the condition that the optimal distribution scheme in the record table is superior to the optimal distribution scheme, selecting other distribution schemes except the record table to replace the initial distribution scheme;
determining whether a stop condition is satisfied;
if so, taking the optimal distribution scheme as the target distribution scheme;
if not, generating a plurality of candidate allocation schemes in the neighborhood by using the new initial allocation scheme until the target allocation scheme is determined.
According to the method and the device, the multiple candidate allocation schemes in each neighborhood are searched based on the initial allocation scheme until the target allocation scheme, namely the optimal allocation scheme, is determined, so that the matching degree between the resource receiver and the resource to be allocated can be effectively improved, the working efficiency of a salesman (the resource receiver) can be effectively improved, and the satisfaction degree of a customer (the resource to be allocated) can be improved.
The storage medium is a computer-readable medium, and stores a computer program, and when the computer program is executed by a processor, the method provided in any embodiment of the present application is implemented, including the following steps S11 to S14:
s11, acquiring n resource receivers and m resources to be allocated;
s12, determining the initial allocation scheme of the n resource receivers and the m resources to be allocated;
s13, generating a plurality of candidate allocation schemes in the neighborhood based on the initial allocation scheme;
s14, determining a target allocation scheme based on a plurality of the candidate allocation schemes.
When the computer program is executed by the processor to determine the initial allocation scheme of the n resource receivers and the m resources to be allocated, the processor specifically executes the following steps: calculating the matching degree of each resource receiver aiming at each resource to be distributed; and according to the sequence from high matching degree to low matching degree, allocating a first preset number of the resources to be allocated to each resource receiver to obtain the initial allocation scheme.
When the computer program is executed by the processor to perform the resource allocation method, the processor specifically executes the following steps: determining whether there is a free resource receiver which is not allocated with the resource to be allocated; and if so, selecting the resource to be allocated with the lowest matching degree, and allocating the resource to be allocated with the lowest matching degree to the vacant resource receiver.
The computer program, when executed by the processor to generate a plurality of candidate allocation schemes within the neighborhood based on the initial allocation scheme, is further executed by the processor to: and exchanging the second preset number of the resources to be allocated in the initial allocation scheme according to a preset exchange rule to obtain the candidate allocation scheme.
When the computer program is executed by the processor to perform the resource allocation method, the processor further performs the following steps: and storing each candidate allocation scheme and the exchanged resources to be allocated corresponding to the candidate allocation scheme to a record table.
The computer program, when executed by the processor to determine a target allocation scheme based on a plurality of said candidate allocation schemes, is further executable by the processor to: screening a better allocation scheme from a plurality of the candidate allocation schemes; in the case that the better distribution scheme is better than the optimal distribution scheme in the record table, adding the better distribution scheme into the record table, taking the better distribution scheme as the optimal distribution scheme in the record table, and replacing the initial distribution scheme with the better distribution scheme; determining whether a stop condition is satisfied; if so, taking the optimal distribution scheme as the target distribution scheme; if not, generating a plurality of candidate allocation schemes in the neighborhood by using the new initial allocation scheme until the target allocation scheme is determined.
When the computer program is executed by the processor to perform the resource allocation method, the processor further performs the following steps: under the condition that the optimal distribution scheme in the record table is superior to the optimal distribution scheme, selecting other distribution schemes except the record table to replace the initial distribution scheme; determining whether a stop condition is satisfied; if so, taking the optimal distribution scheme as the target distribution scheme; if not, generating a plurality of candidate allocation schemes in the neighborhood by using the new initial allocation scheme until the target allocation scheme is determined.
According to the method and the device, the multiple candidate allocation schemes in each neighborhood are searched based on the initial allocation scheme until the target allocation scheme, namely the optimal allocation scheme, is determined, so that the matching degree between the resource receiver and the resource to be allocated can be effectively improved, the working efficiency of a salesman (the resource receiver) can be effectively improved, and the satisfaction degree of a customer (the resource to be allocated) can be improved.
An embodiment of the present application provides an electronic device, a schematic structural diagram of the electronic device may be as shown in fig. 6, and the electronic device at least includes a memory 601 and a processor 602, where the memory 601 stores a computer program, and the processor 602 implements the method provided in any embodiment of the present disclosure when executing the computer program on the memory 601. Illustratively, the electronic device computer program steps are as follows S21-S24:
s21, acquiring n resource receivers and m resources to be allocated;
s22, determining the initial allocation scheme of the n resource receivers and the m resources to be allocated;
s23, generating a plurality of candidate allocation schemes in the neighborhood based on the initial allocation scheme;
s24, determining a target allocation scheme based on a plurality of the candidate allocation schemes.
The processor, when executing the initial allocation scheme stored on the memory that determines the n receivers of the resource and the m to-be-allocated resources, further executes the following computer program: calculating the matching degree of each resource receiver aiming at each resource to be distributed; and according to the sequence from high matching degree to low matching degree, allocating a first preset number of the resources to be allocated to each resource receiver to obtain the initial allocation scheme.
The processor, when executing the resource allocation method stored on the memory, further executes the following computer program: determining whether there is a free resource receiver which is not allocated with the resource to be allocated; and if so, selecting the resource to be allocated with the lowest matching degree, and allocating the resource to be allocated with the lowest matching degree to the vacant resource receiver.
The processor, in executing the computer program stored on the memory to generate a plurality of candidate allocation schemes within the neighborhood based on the initial allocation scheme, further executes: and exchanging the second preset number of the resources to be allocated in the initial allocation scheme according to a preset exchange rule to obtain the candidate allocation scheme.
The processor, when executing the resource allocation method stored on the memory, further executes the following computer program: and storing each candidate allocation scheme and the exchanged resources to be allocated corresponding to the candidate allocation scheme to a record table.
The processor, in executing the computer program stored on the memory to determine the target allocation scheme based on the plurality of candidate allocation schemes, further executes: screening a better allocation scheme from a plurality of the candidate allocation schemes; in the case that the better distribution scheme is better than the optimal distribution scheme in the record table, adding the better distribution scheme into the record table, taking the better distribution scheme as the optimal distribution scheme in the record table, and replacing the initial distribution scheme with the better distribution scheme; determining whether a stop condition is satisfied; if so, taking the optimal distribution scheme as the target distribution scheme; if not, generating a plurality of candidate allocation schemes in the neighborhood by using the new initial allocation scheme until the target allocation scheme is determined.
The processor, when executing the resource allocation method stored on the memory, further executes the following computer program: under the condition that the optimal distribution scheme in the record table is superior to the optimal distribution scheme, selecting other distribution schemes except the record table to replace the initial distribution scheme; determining whether a stop condition is satisfied; if so, taking the optimal distribution scheme as the target distribution scheme; if not, generating a plurality of candidate allocation schemes in the neighborhood by using the new initial allocation scheme until the target allocation scheme is determined.
According to the method and the device, the multiple candidate allocation schemes in each neighborhood are searched based on the initial allocation scheme until the target allocation scheme, namely the optimal allocation scheme, is determined, so that the matching degree between the resource receiver and the resource to be allocated can be effectively improved, the working efficiency of a salesman (the resource receiver) can be effectively improved, and the satisfaction degree of a customer (the resource to be allocated) can be improved.
Optionally, in this embodiment, the storage medium may include, but is not limited to: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes. Optionally, in this embodiment, the processor executes the method steps described in the above embodiments according to the program code stored in the storage medium. Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments and optional implementation manners, and this embodiment is not described herein again. It will be apparent to those skilled in the art that the modules or steps of the present application described above may be implemented by a general purpose computing device, they may be centralized on a single computing device or distributed across a network of multiple computing devices, and alternatively, they may be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by a computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, the present application is not limited to any specific combination of hardware and software.
Moreover, although exemplary embodiments have been described herein, the scope thereof includes any and all embodiments based on the present application with equivalent elements, modifications, omissions, combinations (e.g., of various embodiments across), adaptations or alterations. The elements of the claims are to be interpreted broadly based on the language employed in the claims and not limited to examples described in the present specification or during the prosecution of the application, which examples are to be construed as non-exclusive. It is intended, therefore, that the specification and examples be considered as exemplary only, with a true scope and spirit being indicated by the following claims and their full scope of equivalents.
The above description is intended to be illustrative and not restrictive. For example, the above-described examples (or one or more versions thereof) may be used in combination with each other. For example, other embodiments may be used by those of ordinary skill in the art upon reading the above description. In addition, in the above detailed description, various features may be grouped together to streamline the application. This should not be interpreted as an intention that a disclosed feature not claimed is essential to any claim. Rather, subject matter of the present application can lie in less than all features of a particular disclosed embodiment. Thus, the following claims are hereby incorporated into the detailed description as examples or embodiments, with each claim standing on its own as a separate embodiment, and it is contemplated that these embodiments may be combined with each other in various combinations or permutations. The scope of the application should be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled.
The embodiments of the present application have been described in detail, but the present application is not limited to these specific embodiments, and those skilled in the art can make various modifications and modified embodiments based on the concept of the present application, and these modifications and modified embodiments should fall within the scope of the present application.
Claims (10)
1. A method for resource allocation, comprising:
acquiring n resource receivers and m resources to be distributed;
determining an initial allocation scheme of the n resource receivers and the m resources to be allocated;
generating a plurality of candidate allocation schemes within a neighborhood based on the initial allocation scheme;
a target allocation scheme is determined based on a plurality of the candidate allocation schemes.
2. The method according to claim 1, wherein the determining an initial allocation scheme of n resource receivers and m resources to be allocated comprises:
calculating the matching degree of each resource receiver aiming at each resource to be distributed;
and according to the sequence from high matching degree to low matching degree, allocating a first preset number of the resources to be allocated to each resource receiver to obtain the initial allocation scheme.
3. The method for allocating resources according to claim 2, further comprising:
determining whether there is a free resource receiver which is not allocated with the resource to be allocated;
and if so, selecting the resource to be allocated with the lowest matching degree, and allocating the resource to be allocated with the lowest matching degree to the vacant resource receiver.
4. The method of claim 1, wherein the generating a plurality of candidate allocation schemes within a neighborhood based on the initial allocation scheme comprises:
and exchanging the second preset number of the resources to be allocated in the initial allocation scheme according to a preset exchange rule to obtain the candidate allocation scheme.
5. The method for resource allocation according to claim 4, further comprising:
and storing each candidate allocation scheme and the exchanged resources to be allocated corresponding to the candidate allocation scheme to a record table.
6. The method of claim 1, wherein the determining a target allocation scheme based on the plurality of candidate allocation schemes comprises:
screening a better allocation scheme from a plurality of the candidate allocation schemes;
in the case that the better distribution scheme is better than the optimal distribution scheme in the record table, adding the better distribution scheme into the record table, taking the better distribution scheme as the optimal distribution scheme in the record table, and replacing the initial distribution scheme with the better distribution scheme;
determining whether a stop condition is satisfied;
if so, taking the optimal distribution scheme as the target distribution scheme;
if not, generating a plurality of candidate allocation schemes in the neighborhood by using the new initial allocation scheme until the target allocation scheme is determined.
7. The method for allocating resources of claim 6, further comprising:
under the condition that the optimal distribution scheme in the record table is superior to the optimal distribution scheme, selecting other distribution schemes except the record table to replace the initial distribution scheme;
determining whether a stop condition is satisfied;
if so, taking the optimal distribution scheme as the target distribution scheme;
if not, generating a plurality of candidate allocation schemes in the neighborhood by using the new initial allocation scheme until the target allocation scheme is determined.
8. A resource allocation apparatus, comprising:
an acquisition module which configuratively acquires n resource receivers and m resources to be allocated;
a first determining module configured to determine an initial allocation scheme of the n resource recipients and the m resources to be allocated;
a generation module configured to generate a plurality of candidate allocation plans within a neighborhood based on the initial allocation plan;
a second determination module configured to determine a target allocation scheme based on a plurality of the candidate allocation schemes.
9. A storage medium, having a computer program stored thereon, the computer program when executed by a processor performing the steps of:
acquiring n resource receivers and m resources to be distributed;
determining an initial allocation scheme of the n resource receivers and the m resources to be allocated;
generating a plurality of candidate allocation schemes within a neighborhood based on the initial allocation scheme;
a target allocation scheme is determined based on a plurality of the candidate allocation schemes.
10. An electronic device, comprising: a processor and a memory, the memory storing machine-readable instructions executable by the processor, the processor and the memory communicating over a bus when an electronic device is operating, the machine-readable instructions when executed by the processor performing the steps of:
acquiring n resource receivers and m resources to be distributed;
determining an initial allocation scheme of the n resource receivers and the m resources to be allocated;
generating a plurality of candidate allocation schemes within a neighborhood based on the initial allocation scheme;
a target allocation scheme is determined based on a plurality of the candidate allocation schemes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110678213.XA CN113469423A (en) | 2021-06-18 | 2021-06-18 | Resource allocation method, device, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110678213.XA CN113469423A (en) | 2021-06-18 | 2021-06-18 | Resource allocation method, device, storage medium and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113469423A true CN113469423A (en) | 2021-10-01 |
Family
ID=77868602
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110678213.XA Pending CN113469423A (en) | 2021-06-18 | 2021-06-18 | Resource allocation method, device, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113469423A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115269206A (en) * | 2022-09-27 | 2022-11-01 | 湖南三湘银行股份有限公司 | Data processing method and platform based on resource allocation |
| CN117057577A (en) * | 2023-08-28 | 2023-11-14 | 瀚能科技有限公司 | Park emergency scheme distribution method and related device |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080005058A1 (en) * | 2006-06-29 | 2008-01-03 | Textron Financial Corporation | System and method for optimizing allocation of resources |
| WO2012167306A1 (en) * | 2011-06-06 | 2012-12-13 | Iselect Ltd | Systems and methods for use in marketing |
| CN108898306A (en) * | 2018-06-26 | 2018-11-27 | 泰康保险集团股份有限公司 | Order allocation method, device, medium and electronic equipment |
| CN111709607A (en) * | 2020-05-20 | 2020-09-25 | 北京嗨学网教育科技股份有限公司 | Client allocation method, device, electronic equipment and storage medium |
| CN112163887A (en) * | 2020-09-30 | 2021-01-01 | 深圳前海微众银行股份有限公司 | Electric sales system, electric sales list management method, device, equipment and storage medium |
| CN112200437A (en) * | 2020-09-28 | 2021-01-08 | 绿瘦健康产业集团有限公司 | Customer distribution method and device |
| CN112348402A (en) * | 2020-11-26 | 2021-02-09 | 成都金鼎时代网络科技有限公司 | Dynamic allocation method in sales system |
| KR102226939B1 (en) * | 2020-08-13 | 2021-03-10 | 김성구 | Method, apparatus and computer program for matching users using artificial intelligence model with improved effective data extraction performance |
| CN112633742A (en) * | 2020-12-30 | 2021-04-09 | 中国平安财产保险股份有限公司 | Client resource allocation method, device, equipment and storage medium |
-
2021
- 2021-06-18 CN CN202110678213.XA patent/CN113469423A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080005058A1 (en) * | 2006-06-29 | 2008-01-03 | Textron Financial Corporation | System and method for optimizing allocation of resources |
| WO2012167306A1 (en) * | 2011-06-06 | 2012-12-13 | Iselect Ltd | Systems and methods for use in marketing |
| CN108898306A (en) * | 2018-06-26 | 2018-11-27 | 泰康保险集团股份有限公司 | Order allocation method, device, medium and electronic equipment |
| CN111709607A (en) * | 2020-05-20 | 2020-09-25 | 北京嗨学网教育科技股份有限公司 | Client allocation method, device, electronic equipment and storage medium |
| KR102226939B1 (en) * | 2020-08-13 | 2021-03-10 | 김성구 | Method, apparatus and computer program for matching users using artificial intelligence model with improved effective data extraction performance |
| CN112200437A (en) * | 2020-09-28 | 2021-01-08 | 绿瘦健康产业集团有限公司 | Customer distribution method and device |
| CN112163887A (en) * | 2020-09-30 | 2021-01-01 | 深圳前海微众银行股份有限公司 | Electric sales system, electric sales list management method, device, equipment and storage medium |
| CN112348402A (en) * | 2020-11-26 | 2021-02-09 | 成都金鼎时代网络科技有限公司 | Dynamic allocation method in sales system |
| CN112633742A (en) * | 2020-12-30 | 2021-04-09 | 中国平安财产保险股份有限公司 | Client resource allocation method, device, equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| 吴严亮;张人千;方卫国;: "集中式供应链的生产与库存分配联合决策", 数学的实践与认识, no. 03 * |
| 陈丰照;刘广堂;: "企业信息化建设中客户关系管理需求分析", 能源技术与管理, no. 06 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115269206A (en) * | 2022-09-27 | 2022-11-01 | 湖南三湘银行股份有限公司 | Data processing method and platform based on resource allocation |
| CN117057577A (en) * | 2023-08-28 | 2023-11-14 | 瀚能科技有限公司 | Park emergency scheme distribution method and related device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113469423A (en) | Resource allocation method, device, storage medium and electronic equipment | |
| US20110167034A1 (en) | System and method for metric based allocation of costs | |
| US20090276281A1 (en) | Method, system, and computer program product for effective task management | |
| CN104991924A (en) | Method and apparatus for determining address of new supply point | |
| CN111368147B (en) | Graph feature processing method and device | |
| US20100023367A1 (en) | Method and system for managing worksheet priority, and method and system for processing worksheet | |
| US20080015943A1 (en) | Order fulfillment logic for a field service system | |
| US9633057B2 (en) | Method and system for collecting, searching and determining the strength of contacts from a mobile contact list | |
| US20150170078A1 (en) | System and method of allocating large numbers of tasks | |
| Mu et al. | A spatial‐knowledge‐enhanced heuristic for solving the p‐median problem | |
| Ghafori et al. | Best cloud provider selection using integrated ANP-DEMATEL and prioritizing SMI attributes | |
| CN113888229A (en) | Store data processing and order processing method and device | |
| CN111291018A (en) | Data management method, device, equipment and storage medium | |
| CN113159408A (en) | Rail transit station passenger flow prediction method and device | |
| CN111144659B (en) | Logistics scheduling method and device, computer equipment and storage medium | |
| CN115827646B (en) | Index configuration method and device and electronic equipment | |
| CN109245949B (en) | Information processing method and device | |
| US10803036B2 (en) | Non-transitory computer-readable storage medium, data distribution method, and data distribution device | |
| CN112085328B (en) | Risk assessment method, system, electronic equipment and storage medium | |
| Nadaf et al. | Data mining in telecommunication | |
| CN114691630A (en) | Smart supply chain big data sharing method and system | |
| CN110310145B (en) | Product multi-dimensional configuration method, device, computer equipment and storage medium | |
| CN115061811A (en) | Resource scheduling method, device, equipment and storage medium | |
| CN113656046A (en) | Application deployment method and device | |
| Fichera et al. | Sunk exporting costs and export market coverage |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |