CN106557871A - A kind of method for allocating tasks in gunz system based on stable matching algorithm - Google Patents
A kind of method for allocating tasks in gunz system based on stable matching algorithm Download PDFInfo
- Publication number
- CN106557871A CN106557871A CN201610985542.8A CN201610985542A CN106557871A CN 106557871 A CN106557871 A CN 106557871A CN 201610985542 A CN201610985542 A CN 201610985542A CN 106557871 A CN106557871 A CN 106557871A
- Authority
- CN
- China
- Prior art keywords
- workman
- task
- gunz
- prescription
- list
- 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
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/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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses the method for allocating tasks in a kind of gunz system based on stable matching algorithm, considers the prescription and budget limit of the quality level and preference and task of workman comprehensively, there is strict coboundary to require by former problem is converted into one（Budget limit）Require with loose lower boundary（Prescription）Many-one matching problem, realize stably effectively task allocation result.
Description
Technical field
The invention belongs to the guarantee in gunz systems technology field, more particularly to a kind of gunz system based on matching algorithm is appointed
The method for allocating tasks of business prescription.
Background technology
Gunz system be a kind of opening, it is voluntary, be that company or individual provide the new modality for co-operation of reliable environment.Group
Intelligence system has a sharing, each company can in gunz system RELEASE PROBLEM or task, individual can select problem or
Task, the scale of numerous personal user's contributions can reach the target for being difficult to complete in the past.By the wisdom for gathering everybody, group
Intelligence system can complete the tasks such as environmental data collection and design evaluation new product with low cost and high-quality.
As people's experience, proficiency level, technical ability and Professional knowledge have multiformity, they have different inclined to task
It is good, and it is also different to complete the quality of particular task.It is to pass for specific one group of suitable workman of task choosing
Important, this problem is referred to as task distribution in gunz system.In the task distribution of gunz system, need to consider to issue
Task different prescriptions and budget, while ability and preference that workman is considered in workman's selection.
In gunz system, the difference of technology, experience and proficiency level according to workman, the quality level of different workmans is not
Together.Hypothesis task publisher knows the technical merit of all workmans.One workman for having high quality level is performing a job
When often may require that higher remuneration because these workmans need the training that spends more time, and task publisher is also more willing to
The result to can more trust of anticipating pays more remunerations.Due to completing by workpeople's collective wisdom for gunz task, therefore,
If a task is successful, it is necessary to recruit enough workmans.It is enough that task publisher must assure that he can be attracted to
Workman is reaching prescription, and recruits substantial amounts of workman and can reach higher quality level, but task publisher's is pre-
It is limited at last, which also limits him and recruit the quantity of workman, therefore, the gross mass level of task recruitment a to workman is big
In the prescription of task, and the remuneration for paying workman is less than the budget fund value of task.
Each workman has the list of preferences of oneself in the face of all tasks.For example, if two task publishers are two
Individual different site collection transport information, workman are more willing to select near that position in oneself residence.Similarly, each task
Publisher also has oneself corresponding list of preferences according to the quality level of workman to all workmans.
In sum, the task allocative decision of a preference for considering prescription, budgetary restraints and workman is gunz
The key point that system normally can be run.For gunz system task distribution be one it is popular study a question, a lot
Reliable Task Assigned Policy in mobile gunz system is proposed in document.Ensure gratifying distribution, be related to matter
Amount requires the preference with workman, and workman and task are not made matching well by solution in the past.What is had proposes
Many-one matching problem, although it is contemplated that the preference and budget limit of workman, but do not account for prescription.
The content of the invention
Deficiency of the present invention for existing gunz system task allocative decision, it is proposed that a kind of workman's preference of consideration comprehensively,
Task Quality requires the stable method for allocating tasks with budget limit.
The technical solution adopted in the present invention is：A kind of task distribution side in gunz system based on stable matching algorithm
Method, comprises the following steps：
Step 1：Obtain the quality level { r of each workman ss}s∈SAnd its list of preferences { ＞s}S, wherein S is all works
People gathers；Obtain the list of preferences { ＞ of each task tt}τ, prescription { qt}t∈τWith budget limit { bt}t∈τ, wherein τ is institute
There is the set of task；
Step 2：According to the list of preferences { ＞ of workman ss}SThe preference ordering of s is write in application list p (s) of s；
Step 3：Whether application list p (s) for judging workman s is empty；
If so, then perform following step 4；
If it is not, then process ends；
Step 4：First task t of application list p (s) is taken, and t is removed in p (s)；
Step 5：Judge that task t is currently assigned to the prescription whether the gross mass level of workman is less than task t；
If so, then perform following step 6；
If it is not, then performing following step 7；
Step 6：Perform REDA algorithms；
Step 7：Prescription that a part of difference △ Q and all unallocated workman are not reached in calculating all tasks also
The horizontal △ R of gross mass；
Step 8：Judge △ R-rsWith the size of △ Q；
If △ is R-rsMore than difference △ Q, then REDA algorithms are performed；
If △ is R-rsLess than difference △ Q, then execution step 9
Step 9：Workman s can not distribute to task t, take next workman's information as workman s, and turn round the execution step
Rapid 3；
The REDA algorithms, comprise the following steps：
Step 6.1：Obtain workman s and task t information, workman s ∈ S, task t ∈ τ；
Step 6.2：Judge whether the residual of task is more than the remuneration of workman；
If so, workman s is distributed to into task t then, next workman's information is then taken as workman s, and turn round execution institute
State step 3；
If it is not, then performing following step 6.3；
Step 6.3：Workman set A of the quality level less than workman s is found out in task the t currently workman of distribution；
Step 6.4：Workman's subset of workman's s minimum level of qualities is less than in judging set Α with the presence or absence of gross mass level
Close B；
If so, then choose the minimum set B of workman's gross mass level in all set for meeting step 6.4min, release and appoint
Business t and set BminIn all workmans the relations of distribution, workman s is distributed to into task t, next workman's information conduct is then taken
Workman s, and turn round the execution step 3；
If it is not, then workman s can not distribute to task t, next workman's information is taken as workman s, and it is described to turn round execution
Step 3.
Present invention assumes that gunz system each task publisher issues a particular task.In practice, in gunz system
In each task publisher allow issue multiple tasks, task publisher in this case can be regarded as multiple virtual tasks
Publisher, a virtual task publisher only issue a particular task.
In the present invention, the workman of each task publisher more preference high quality level, therefore all tasks sends out
The list of preferences of cloth person is all identical (sorting according to workman's quality level height).
In the present invention, if a workman is unwilling to do some tasks, he can be inserted in the list of preferences of oneself
One empty task, and all unacceptable tasks are placed on behind the task of sky.
The present invention utilizes stable matching algorithm, considers the preference of workman and task publisher in gunz system comprehensively, appoints
The budget limit and prescription and the quality level of workman of business, in realizing gunz system, stable task is distributed.
Description of the drawings
The flow chart of Fig. 1 embodiment of the present invention；
The REDA algorithm flow charts of Fig. 2 embodiment of the present invention；
The TAQR algorithms of Fig. 3 embodiment of the present invention and benchmark algorithm success rate comparative experimentss result figure, wherein (a) M=8
(b) N=50；
The TAQR algorithms of Fig. 4 embodiment of the present invention and workman's satisfaction comparative experimentss result figure of benchmark algorithm, wherein (a)
M=12 (b) N=40；
The TAQR algorithms of Fig. 5 embodiment of the present invention and the time complexity comparative experimentss result figure of benchmark algorithm, wherein (a)
M=4, (b) N=40.
Specific embodiment
Understand for the ease of those of ordinary skill in the art and implement the present invention, below in conjunction with the accompanying drawings and embodiment is to this
It is bright to be described in further detail, it will be appreciated that enforcement example described herein is merely to illustrate and explains the present invention, not
For limiting the present invention.
It is an object of the present invention to consider workman and the preference of task publisher, the budget limit of task and prescription with
And the quality level of workman, realize the stable allocation of task in gunz platform.It is to solve this problem, of the invention by gunz platform
Task Allocation Problem have strict coboundary to require (budget limit) and loose lower boundary requirement (prescription) as one
Many-one matching problem, it is proposed that respective algorithms simultaneously prove that the allocation result of the algorithm is stable and effective.
Make first and being defined as below：
Define 1：The task distribution μ of (task distribution) gunz platform is mapping S ∪ τ → 2 for meeting following 5 conditionsS∪
τ：
1) to all of workman s ∈ S, there are μ (s) ∈ τ；
2) to all task publisher t ∈ τ, there are μ (t) ∈ S；
3) to any s ∈ S and t ∈ τ, as s ∈ μ (t), μ (s)=t, wherein μ (t) refer to the work of task t that matches
The set of people；
4) strict lower boundary (budget limit)：There is ∑ to all t ∈ τs∈μ(t)rs≤bt；
5) under loose coboundary (prescription)：Α={ t:t∈Α,∑s∈μ(t)rs≥qtRepresent that prescription can be by
The set of tasks of satisfaction.Success rate is represented, |. | represent the element number in set.As Suc=1, μ is one
Completely task distribution, is otherwise exactly a partial task distribution.
This model is by the gunz platform made joint efforts, the many-one matching in most of documents comprising prescription
Model is no to consider that as model in the present invention lower limit is constrained.All assume that often in view of the many-one Matching Model of lower limit constraint
The quality level of individual workman is all identical, i.e. rs=1, in the model of this simplification, the gross mass level of and if only if workman is big
In the quality level ∑ of mission requirementss∈Srs≥∑t∈τqt, can just reach complete task distribution.But when the quality level of workman
When different, ∑s∈Srs≥∑t∈τqt, can no longer meet the prescription of each task.For example, if the quality water of two workmans
Flat ratio is 0.3:0.7, the prescription ratio of two tasks is 0.4:0.5, despite 0.3+0.7>0.4+0.5, but do not appoint
What the task method of salary distribution can meet the prescription of the two tasks simultaneously.Verify whether there is completely task distribution quite
Whether there is feasible program in the following linear programming problem of inspection.
Wherein, as μ (s)=t, xs,t=1, otherwise xs,t=0.
In fact, the present invention only focuses on whether object function has feasible solution, this is a NP difficult problem.Therefore, the present invention
The success rate of task distribution is improved as much as possible can.
If no any workman or task publisher have the more preferable selection different from allocation result, then this distribution
It is exactly stable, because workman and task publisher can abandon this allocation result if preferably selection.In workman certainly
Freely recruited on the gunz platform of workman by selection task, task publisher, only allocation result could stably realize task point
Match somebody with somebody.The characteristics of stable task is distributed be individual rationality, fairness, without wasteness.
Define 2：(individual rationality), when distribution μ meets condition, this distribution is with individual rationality.
1) it is during each workman is ready to be assigned to current task rather than unassigned, i.e.,
2) subclass of workman's set rather than the set of the currently distribution of each task publisher preference, i.e.,
Individual rationality is the minimum requirements of task distribution.In order to be defined to fairness, I types obstruction is introduced first right
Concept.
Define 3：(I types obstruction to) is if there is task publisher t, workman s and nonvoid subsetAnd meet with
During lower condition, workman s and task t constitute an I type and block right.
1) workman in task publisher t more preference workman s rather than set Α, and workman s also more preference task t and
It is not the task of his current distribution.
2) in the case where the budgetary restraints of task t are not violated, workman s can substitute the workman in subset Α.
3) workman s leaves the prescription for not interfering with his current task μ (s) being allocated.
By its mathematicization, i.e., when there is task publisher t, workman s and nonvoid subsetAnd meet following condition
When, it is right that workman and task t can make up an I types obstruction.Actual conditions is as follows：
1)tsμ (s), and r (s) >=∑s'∈Αrs'
2)rs+∑s'∈μ(t)\Αrs'≤bt
3)∑s'∈μ(u(s))rs'-rs≥qt
I types obstruction is to causing distribution unstable, because workman can consider that changing preferring for a task replaces currently quilt
This task being assigned to.
Define 4：(fairness), only when there is no I types obstruction pair, task distribution μ just has fairness.
Define 5：(II types obstruction to) when certain condition is met, workman s and task t constitute an II types obstruction to (s,
t).Actual conditions is as follows：
1) task of workman s more preference tasks t rather than his current distribution；
2) workman s is added in task t the budget limit without departing from t.
If 3) workman s leaves, the gross mass level requirement of current distributed task μ (s) is not interfered with.
By its mathematicization, i.e., in distribution, if meeting certain condition, workman s and task t can constitute an II types obstruction
It is right.Actual conditions is as follows：
1)tsμ(s)
2)rs+∑s'∈μ(t)rs'≤bt
3)∑s'∈μ(u(s))rs'-rs≥qt
II types block to distribution can be caused unstable, because task publisher has enough budgets to recruit all feeling like doing
The workman of this task.
Define 6：(without wasteness), when there is no II types obstruction pair, task distribution μ is just with without wasteness.
The algorithm for being proposed is the calculation come what is realized based on traditional stable matching algorithm -- postponement receives algorithm (DA) --
Method can realize stable matching result under classical many-one matching problem.But this traditional algorithm has two defects.
First, the workman in gunz system has heterogeneity, and remuneration and the technical merit for being embodied in workman is different, therefore adopts
The task allocation result produced with DA algorithms is unstable.Second, DA algorithm does not consider prescription lower boundary, and allocation result is caused
The success rate that task is completed is relatively low.Distributed algorithm proposed by the present invention can produce a stable task distribution, the distribution
Strictly meet budget limit, and improve the task of having prescription complete success rate.
In the present invention, limit a workman and can only receive a task, but each task can distribute to multiple works
People.In the present invention, it is assumed that each workman is constant to the quality level of same task and gunz system on all of participant
(including workman and task publisher) both knows about all of list of preferences, and list of preferences is fixed.
Ask for an interview Fig. 1, the method for allocating tasks in a kind of gunz system that the present invention is provided based on stable matching algorithm, including
Following steps：
Step 1：Obtain the quality level { r of each workman ss}s∈SAnd its list of preferences { ＞s}S, wherein S is all works
People gathers；Obtain the list of preferences { ＞ of each task tt}τ, prescription { qt}t∈τWith budget limit { bt}t∈τ, wherein τ is institute
There is the set of task；
Step 2：According to the list of preferences { ＞ of workman ss}SThe preference ordering of s is write in application list p (s) of s；
Step 3：Whether application list p (s) for judging workman s is empty；
If so, then perform following step 4；
If it is not, then process ends；
Step 4：First task t of application list p (s) is taken, and t is removed in p (s)；
Step 5：Judge that task t is currently assigned to the prescription whether the gross mass level of workman is less than task t；
If so, then perform following step 6；
If it is not, then performing following step 7；
Step 6：Perform REDA algorithms；
Step 7：Prescription that a part of difference △ Q and all unallocated workman are not reached in calculating all tasks also
The horizontal △ R of gross mass；
Step 8：Judge △ R-rsWith the size of △ Q；
If △ is R-rsMore than difference △ Q, then REDA algorithms are performed；
If △ is R-rsLess than difference △ Q, then execution step 9
Step 9：Workman s can not distribute to task t, take next workman's information as workman s, and turn round the execution step
Rapid 3；
Fig. 2 is asked for an interview, the REDA algorithms that the present embodiment is adopted are comprised the following steps：
Step 6.1：Obtain workman s and task t information, workman s ∈ S, task t ∈ τ；
Step 6.2：Judge whether the residual of task is more than the remuneration of workman；
If so, workman s is distributed to into task t then, next workman's information is then taken as workman s, and turn round execution institute
State step 3；
If it is not, then performing following step 6.3；
Step 6.3：Workman set A of the quality level less than workman s is found out in task the t currently workman of distribution；
Step 6.4：Workman's subset of workman's s minimum level of qualities is less than in judging set Α with the presence or absence of gross mass level
Close B；
If so, then choose the minimum set B of workman's gross mass level in all set for meeting step 6.4min, release and appoint
Business t and set BminIn all workmans the relations of distribution, workman s is distributed to into task t, next workman's information conduct is then taken
Workman s, and turn round the execution step 3；
If it is not, then workman s can not distribute to task t, next workman's information is taken as workman s, and it is described to turn round execution
Step 3.
The allocation result of algorithm is analyzed.May certify that out following theorem.
Theorem 1：The time complexity of the task allocation algorithms for being proposed is O (| S | | τ | d), and wherein d refers to REDA calculations
β is searched in methodminRun time.
Theorem 2：The task distribution of (individual rationality) algorithm is with individual rationality.
Theorem 3：The allocation result of (without wasteness) algorithm is with without wasteness.
Theorem 4：The task allocation algorithms proposed by (fairness) have fairness.
Theorem 5：The task allocation algorithms proposed by (stability) are stable.
The detailed process to this algorithm of illustrating is described, and result is analyzed.It is as shown in table 1 below, there are 6 workmans
And its correspondence list of preferences and quality level, 2 tasks and corresponding budget limit and prescription.Obviously all of task is sent out
The list of preferences of cloth person can be s5t s2t s6t s3t s4t s1。
Table 1
Task allocation algorithms running is as follows：
The first round：Workman s1Application task t1：t1Prescription do not meet and budget fund is sufficient.By s1Distribute to
t1, then have μ (s1)=t1,μ(t1)=s1。
Second wheel:Workman s2Application task t2：t2Prescription do not meet and budget fund is sufficient.By s2Distribute to
t2, then have μ (s2)=t2,μ(t2)=s2。
Third round：Workman s3Application task t2：t2Prescription do not meet and budget fund is sufficient.By s3Distribute to
t2, then have μ (s3)=t2,μ(t2)={ s2,s3}。
Fourth round：Workman s4Application task t2：t2Prescription do not meet and budget fund is sufficient.By s4Distribute to
t2, then have μ (s4)=t2,μ(t2)={ s2,s3,s4}。
5th wheel：Workman s5Application task t2：t2Prescription do not meet, but budget fund is not enough to pay
s5, compare s5The little workman set Α={ s of priority2,s3,s4, in Α, the quality level of workman is less than s5And can be s5Vacate foot
The set of enough budgets has two, is { s respectively2And { s3,s4}.Due to { s3,s4Gross mass level be less than { s2, then βmin=
{s3,s4, from task t2Matching set in remove βmin, by s5Distribute to t2, i.e. μ (s5)=t2,μ(t2)={ s2,s5}。
6th wheel：Workman s6Application task t2：t2There are enough budgets, but its prescription has met, through sentencing
It is disconnected, by workman s6Distribute to task t2The prescription for causing other tasks is not being met.Therefore s6By t2Refusal.
7th wheel：Workman s3Application task t1：t1Prescription do not meet and budget fund is sufficient.By s3Distribute to
t1, then have μ (s3)=t1,μ(t1)={ s1,s3}。
8th wheel：Workman s4Application task t1：t1Prescription do not meet and budget fund is sufficient.By s4Distribute to
t1, then have μ (s4)=t1,μ(t1)={ s1,s3,s4}。
9th wheel：Workman s5Application task t1：t1Prescription do not meet and budget fund is sufficient.By s5Distribute to
t1, then have μ (s5)=t1,μ(t1)={ s1,s3,s4,s5}。
Final task allocation result is μ (t1)={ s1,s3,s4,s5, μ (t2)={ s2,s5}。
Algorithm performance for being proposed is estimated at this, task allocation algorithms abbreviation TAQR proposed by the present invention is calculated
Method, benchmark as a comparison is Anchor algorithms.Each emulation experiment is run 500 times to eliminate system randomness.
Experiment 1：Validation task completes success rate
Emulation experiment shows that TAQR has higher task to complete success rate than Anchor.The premise of one Mission Success is work
Prescription of people's gross mass level higher than task.Success rate is the ratio that successfully completing for task accounts for general assignment.Q, b, r distinguish
Be from [3,5], [6,10], the numeral selected in [1,2] at random.Fig. 3 (a) is that task completes success rate as number of workers becomes
The curve of change, shows in figure that the success rate of TAQR improves 16% than Anchor.Fig. 3 (b) is that task completes success rate with task
Number change curve, the success rate difference between TAQR and Anchor is close to 18%.
Experiment 2：Workman's satisfaction compares
Emulation experiment shows that TAQR has higher performance than Anchor in workman's satisfaction.The satisfaction of workman is defined as
Percentage ratio ranking of the task of its matching in its list of preferences.Q, b, r are that, respectively from [3,5], [6,10] are random in [Isosorbide-5-Nitrae]
The numeral of extraction.Fig. 4 (a) is the curve that workman's satisfaction changes with number of workers, and TAQR algorithms are satisfied with than the workman of Anchor
Du Gaoyue 5%.Fig. 4 (b) is curve of workman's satisfaction with task number change, and workman's satisfaction of TAQR algorithms compares Anchor
It is big by 6%.
Experiment 3：Run time
Fig. 5 shows increase or the increase of task quantity either with number of workers, Anchor than TAQR algorithm when
Between complexity it is low.Q, b, r be respectively from [0.8,1.5], [1.4,2], the numeral randomly selected in [0,1].With reference to Fig. 3, Fig. 4,
TAQR improves performance (task completion rate and workman's satisfaction of gunz system by increasing run time (in the reasonable scope)
Degree).
It should be appreciated that the part that this specification is not elaborated belongs to prior art.
It should be appreciated that the above-mentioned description for preferred embodiment is more detailed, therefore can not be considered to this
The restriction of invention patent protection scope, one of ordinary skill in the art are being weighed without departing from the present invention under the enlightenment of the present invention
Under the protected ambit of profit requirement, replacement can also be made or deformed, be each fallen within protection scope of the present invention, this
It is bright scope is claimed to be defined by claims.
Claims (3)
1. a kind of method for allocating tasks in gunz system based on stable matching algorithm, it is assumed that gunz system each task publisher
A task is only issued all；Characterized in that, comprising the following steps：
Step 1：Obtain the quality level { r of each workman ss}s∈SAnd its list of preferences { ＞s}s, wherein S is all workman's collection
Close；Obtain the list of preferences { ＞ of each task tt}τ, prescription { qt}t∈τWith budget limit { bt}t∈τ, wherein τ is all
The set of business；
Step 2：According to the list of preferences { ＞ of workman ss}SThe preference ordering of s is write in application list p (s) of s；
Step 3：Whether application list p (s) for judging workman s is empty；
If so, then perform following step 4；
If it is not, then process ends；
Step 4：First task t of application list p (s) is taken, and t is removed in p (s)；
Step 5：Judge that task t is currently assigned to the prescription whether the gross mass level of workman is less than task t；
If so, then perform following step 6；
If it is not, then performing following step 7；
Step 6：Perform REDA algorithms；
Step 7：Prescription that a part of difference △ Q and all unallocated workman total is not reached in calculating all tasks also
Quality level △ R；
Step 8：Judge △ R-rsWith the size of △ Q；
If △ is R-rsMore than difference △ Q, then REDA algorithms are performed；
If △ is R-rsLess than difference △ Q, then execution step 9；
Step 9：Workman s can not distribute to task t, take next workman's information as workman s, and turn round the execution step 3；
The REDA algorithms, comprise the following steps：
Step 6.1：Obtain workman s and task t information, workman s ∈ S, task t ∈ τ；
Step 6.2：Judge whether the residual of task is more than the remuneration of workman；
If so, workman s is distributed to into task t then, next workman's information is then taken as workman s, and turn round the execution step
Rapid 3；
If it is not, then performing following step 6.3；
Step 6.3：Workman set A of the quality level less than workman s is found out in task the t currently workman of distribution；
Step 6.4：The workman subclass B of workman's s quality levels is less than in judging set Α with the presence or absence of gross mass level；
If so, then choose the minimum set B of workman's gross mass level in all set for meeting step 6.4min, release task t and
Set BminIn all workmans the relations of distribution, workman s is distributed to into task t, next workman's information is then taken as workman s,
And turn round the execution step 3；
If it is not, then workman s can not distribute to task t, next workman's information is taken as workman s, and turn round the execution step
3。
2. the method for allocating tasks in gunz system according to claim 1 based on stable matching algorithm, it is characterised in that：
If each task publisher needs to issue multiple tasks in gunz system, regard task publisher as multiple virtual tasks and send out
Cloth person, a virtual task publisher only issue a particular task.
3. the method for allocating tasks in gunz system according to claim 1 based on stable matching algorithm, it is characterised in that：
The list of preferences of all task publishers is all identical.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610985542.8A CN106557871A (en) | 2016-11-09 | 2016-11-09 | A kind of method for allocating tasks in gunz system based on stable matching algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610985542.8A CN106557871A (en) | 2016-11-09 | 2016-11-09 | A kind of method for allocating tasks in gunz system based on stable matching algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106557871A true CN106557871A (en) | 2017-04-05 |
Family
ID=58444753
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610985542.8A Pending CN106557871A (en) | 2016-11-09 | 2016-11-09 | A kind of method for allocating tasks in gunz system based on stable matching algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106557871A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107609796A (en) * | 2017-09-30 | 2018-01-19 | 杭州圣建供应链管理有限公司 | A kind of production optimization method of steel member |
| CN108055095A (en) * | 2017-12-08 | 2018-05-18 | 武汉大学 | A kind of combined spectral matching algorithm of stabilization |
| CN111861104A (en) * | 2020-06-05 | 2020-10-30 | 北京嘀嘀无限科技发展有限公司 | Service distribution method and device and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1529851A (en) * | 2000-11-06 | 2004-09-15 | 皇家菲利浦电子有限公司 | Method and system for allocation of budget to task |
| CN103870990A (en) * | 2014-03-31 | 2014-06-18 | 上海交通大学 | Method for realizing incentive mechanism of coverage problem in mobile crowdsensing system |
| CN104463424A (en) * | 2014-11-11 | 2015-03-25 | 上海交通大学 | Crowdsourcing task optimal allocation method and system |
| CN105976205A (en) * | 2016-05-04 | 2016-09-28 | 南京邮电大学 | Crowdsourcing sensing method and system for quality sensitive geographical regional information |
-
2016
- 2016-11-09 CN CN201610985542.8A patent/CN106557871A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1529851A (en) * | 2000-11-06 | 2004-09-15 | 皇家菲利浦电子有限公司 | Method and system for allocation of budget to task |
| CN103870990A (en) * | 2014-03-31 | 2014-06-18 | 上海交通大学 | Method for realizing incentive mechanism of coverage problem in mobile crowdsensing system |
| CN104463424A (en) * | 2014-11-11 | 2015-03-25 | 上海交通大学 | Crowdsourcing task optimal allocation method and system |
| CN105976205A (en) * | 2016-05-04 | 2016-09-28 | 南京邮电大学 | Crowdsourcing sensing method and system for quality sensitive geographical regional information |
Non-Patent Citations (2)
| Title |
|---|
| WEI XU等: ""DATA: A Double Auction Based Task Assignment Mechanism in Crowdsourcing Systems"", 《2013 8TH INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA (CHINACOM)》 * |
| 王青: ""基于用户主题精确感知大数据群体计算任务分配算法"", 《计算机应用》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107609796A (en) * | 2017-09-30 | 2018-01-19 | 杭州圣建供应链管理有限公司 | A kind of production optimization method of steel member |
| CN107609796B (en) * | 2017-09-30 | 2020-06-26 | 杭州圣建供应链管理有限公司 | Production optimization method of steel member |
| CN108055095A (en) * | 2017-12-08 | 2018-05-18 | 武汉大学 | A kind of combined spectral matching algorithm of stabilization |
| CN108055095B (en) * | 2017-12-08 | 2020-11-17 | 武汉大学 | Stable combined spectrum matching algorithm |
| CN111861104A (en) * | 2020-06-05 | 2020-10-30 | 北京嘀嘀无限科技发展有限公司 | Service distribution method and device and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Asgari et al. | Cooperative game theoretic framework for joint resource management in construction | |
| Collier et al. | Labor platforms and gig work: the failure to regulate | |
| Lobel | The gig economy & the future of employment and labor law | |
| Mak et al. | Using risk analysis to determine construction project contingencies | |
| Kalkanci et al. | Contract complexity and performance under asymmetric demand information: An experimental evaluation | |
| Stein et al. | A model-based online mechanism with pre-commitment and its application to electric vehicle charging | |
| KR102503520B1 (en) | Personnel management system | |
| Carboni | A new class of worker for the sharing economy | |
| CN106557871A (en) | A kind of method for allocating tasks in gunz system based on stable matching algorithm | |
| Burch et al. | Judicial Adjuncts in Multidistrict Litigation | |
| Wang et al. | A comprehensive survey of the reviewer assignment problem | |
| Benestad et al. | A comparison of model-based and judgment-based release planning in incremental software projects | |
| Karlsen et al. | Management of project contingency and allowance | |
| Mukherjee et al. | On the trade-off between efficiency in job assignment and turnover: The role of breakup fees | |
| Dinçer et al. | Innovative capacity-based approach to blue ocean strategies of family firms: An IT2 fuzzy hybrid decision-making analysis for potential investors | |
| Gharehyakheh et al. | A fuzzy solution approach for a multi-objective integrated production-distribution model with multi products and multi periods under uncertainty | |
| CN106657058B (en) | Event resource allocation method and device | |
| JP7447919B2 (en) | Negotiation devices, negotiation methods and programs | |
| Gonen | Optimal risk response plan of project risk management | |
| Paul et al. | Improving Operational Performance in Service Delivery Organizations by Using a Metaheuristic Task Allocation Algorithm. | |
| Keskin et al. | Conflict-based negotiation strategy for human-agent negotiation | |
| Mutingi et al. | Task assignment in home health care: A fuzzy group genetic algorithm approach | |
| Xie et al. | Mathematical modeling of crowdsourcing systems: Incentive mechanism and rating system design | |
| De Oliveira et al. | An integrated model for classifying projects and project managers and project allocation: A portfolio management approach | |
| Chang et al. | Fair division transportation allocation model for funding prioritization |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170405 |