CN116167595A - Method for determining personnel group decision variables, electronic equipment and storage medium - Google Patents
Method for determining personnel group decision variables, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN116167595A CN116167595A CN202310450076.3A CN202310450076A CN116167595A CN 116167595 A CN116167595 A CN 116167595A CN 202310450076 A CN202310450076 A CN 202310450076A CN 116167595 A CN116167595 A CN 116167595A
- Authority
- CN
- China
- Prior art keywords
- priority
- target
- list
- personnel
- decision variable
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 78
- 238000003860 storage Methods 0.000 title claims abstract description 8
- 238000004364 calculation method Methods 0.000 claims abstract description 19
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 8
- 241000820057 Ithone Species 0.000 claims description 2
- 230000010006 flight Effects 0.000 description 3
- 230000001131 transforming effect Effects 0.000 description 3
- 238000009826 distribution Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012163 sequencing technique Methods 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/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
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method for determining a personnel group decision variable, electronic equipment and a storage medium, wherein a target decision variable set is randomly generated, a target priority list is obtained, an intermediate priority information list is obtained, the intermediate priority and the target priority are ordered from small to large according to the priority, the priority ordered into the first three is obtained and used as a key priority list, different selection probabilities are set according to the priority of the key priority, the different selection probabilities are brought into a wheel disc selection algorithm module for processing, so as to obtain a final priority, and a final decision variable set corresponding to the final priority obtained by the last iterative calculation is output to a user. The workload of each personnel group is balanced, and the working efficiency of the personnel group is improved.
Description
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a method for determining a person group decision variable, an electronic device, and a storage medium.
Background
In the prior art, the airport freight apron guarantee requiring personnel scheduling is taken as a typical airport ground service post, the workload of the airport ground service post is closely related to the change of the actual moment of flights, and the flight moment distribution of airports has the specificity of wave crests and wave troughs, so that the demand of flight production on the airport freight apron guarantee presents a high time-varying characteristic, the conventional personnel scheduling method is easy to cause personnel idle waste or manual shortage when the flights are in low, and the airport freight operation efficiency is greatly reduced. Airport freight apron guarantee work intensity is relatively large, however, at present, airport personnel management level is generally low.
At present, aiming at the problem of airport freight apron guarantee personnel scheduling, the existing method mainly has two defects. Firstly, experience of personnel is not fully considered, only work efficiency is focused when the most scheduling scheme is determined, the target is single, and the balance of the workload is not analyzed; secondly, the existing method mainly takes the traditional scheduling mode as a main mode, and the time distribution of flights and the dynamic characteristics of airport freight works are not considered, so that personnel waste is caused. Therefore, a method for determining a person group decision variable that can improve the balance of the person workload to improve the person work efficiency is of great importance.
Disclosure of Invention
Aiming at the technical problems, the invention adopts the following technical scheme:
a method for determining a person group decision variable comprises the following steps:
s100, randomly generating a target decision variable set X corresponding to the current iterative computation p =（X p1 ，X p2 ，……，X pr ，……，X pR ) R=1, 2, … …, R; wherein R is the number of target decision variable sets, and the R-th target decision variable set X pr =（X pr 1 ，X pr 2 ，……，X pr i ，……，X pr m ) I=1, 2, … …, m, m is the number of human groups, X pr Corresponding target decision variable subset X pr i =（X pr i1 ，X pr i2 ，……，X pr ij ，……，X pr in ) J=1, 2, … …, n, n is the number of target tasks, X pr i Target decision variable list X corresponding to jth target task pr ij =（X pr ij1 ，X pr ij2 ，……，X pr ijt ，……，X pr ijT ) T=1, 2, … …, T is the number of target time periods, X pr ijt The method comprises the steps that (1) target decision variables corresponding to an ith personnel group in a jth target time period of a jth target task are collected for the (r) target decision variables, and p is the number of times of current iterative computation; if X pr ijt =0 indicates that the ith person group did not perform the jth task for the t time period, if X pr ijt =1 then indicates that the ith group of people performs the jth task during the t-th time period;
s200, according to X, obtaining a target priority list YX= (YX) 1 ，YX 2 ，……，YX r ，……，YX R ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein YX r Is X r Corresponding target priority, YX r Meets the following conditions:
wherein C is jt For the j-th target taskPersonnel state influence parameters under t target times, K p i Calculating the acquired personnel number of the ith personnel group for the p-th iteration, S 0 Is a preset loss value delta it For an operating state parameter indicating whether the ith group of personnel is in an operating state at the t-th target time period, u jt Lack of numbers for personnel performing the jth task during the t-th target time period;
s300, obtaining a middle priority information list ZXY p =（ZXY p 1 ，ZXY p 2 ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein ZXY p 1 For the first intermediate priority information, ZXY p 2 For the second intermediate priority information, the intermediate priority information includes: the intermediate priority and the intermediate decision variable set corresponding to the intermediate priority;
s400, arranging each intermediate priority and each target priority in order from small to large to obtain a key priority list GY p =（GY p 1 ，GY p 2 ，GY p 3 ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the priority of the first bit of the ordering order is used as the first key priority GY p 1 The priority of the second bit of the order is used as the second key priority GY p 2 The priority of the third bit is used as the third key priority GY p 3 ；
S500, the selection probability corresponding to each key priority is brought into a wheel disc selection algorithm module to be processed, so that the final priority ZY is obtained p ；ZY p ∈GY p The magnitude of the selection probability is inversely proportional to the magnitude of the key priority corresponding to the selection probability;
s600, if p=q, taking the decision variable set corresponding to ZY as the final decision variable set ZX; wherein Q is a preset iterative calculation frequency threshold value.
The invention has at least the following beneficial effects:
the method comprises the steps of randomly generating a target decision variable set, obtaining a target priority list, obtaining a middle priority information list, sequencing the middle priority and the target priority from small to large according to the priority, obtaining the priority sequenced into the first three as a key priority list, setting different selection probabilities according to the priority of the key priority, carrying into a wheel disc selection algorithm module for processing to obtain a final priority, and outputting the final decision variable set corresponding to the final priority obtained by the last iterative calculation to a user. Therefore, the final decision variable set represents which target task each person group is allocated to in each target time period, and the final decision variable set is selected in a mode of calculating the priority. Therefore, the workload of each personnel group is balanced, and the working efficiency of the personnel group is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of a method for determining a person group decision variable according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to fall within the scope of the invention.
S100, randomly generating a target decision variable set X corresponding to the current iterative computation p =（X p1 ，X p2 ，……，X pr ，……，X pR ) R=1, 2, … …, R; wherein R is the number of target decision variable sets, and the R-th target decision variable set X pr =（X pr 1 ，X pr 2 ，……，X pr i ，……，X pr m ) I=1, 2, … …, m, m is the number of human groups, X pr Corresponding target decision variable subset X pr i =（X pr i1 ，X pr i2 ，……，X pr ij ，……，X pr in ) J=1, 2, … …, n, n is the number of target tasks, X pr i Target decision variable list X corresponding to jth target task pr ij =（X pr ij1 ，X pr ij2 ，……，X pr ijt ，……，X pr ijT ) T=1, 2, … …, T is the number of target time periods, X pr ijt The method comprises the steps that (1) target decision variables corresponding to an ith personnel group in a jth target time period of a jth target task are collected for the (r) target decision variables, and p is the number of times of current iterative computation; if X pr ijt =0 indicates that the ith person group did not perform the jth task for the t time period, if X pr ijt And =1 indicates that the ith group of people performs the jth task during the t-th time period.
Specifically, Σ m i=1 X r ijt =1, it is understood that the target task j of any target period t is performed by only one group of people.
Further, before the step S100, the method further includes the steps of:
s010, acquiring a key decision variable set MX= (MX) 1 ，MX 2 ，……，MX i ，……，MX m ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the ith key decision variable subset MX in MX i =（MX i1 ，MX i2 ，……，MX ij ，……，MX in ），MX i Target decision variable list MX corresponding to jth target task ij =（MX ij1 ，MX ij2 ，……，MX ijt ，……，MX ijT ），MX ijt The method comprises the steps that the key decision variables corresponding to an ith personnel group in a jth target time period of a jth target task are collected for the jth target decision variables;
step S010 further includes the steps of:
s011, if p=1, obtain mx=x 0 And proceeds to step S020; otherwise, ZXY 1 The corresponding intermediate decision variable set is taken as MX and entered into step S020.
S020, obtaining a target personnel quantity list set MK= (MK) 1 ，MK 2 ，……，MK h ，……，MK H ) H=1, 2, … …, H is the number of target person number list, and the H-th target person number list MH in MK h =（MK h1 ，MK h2 ，……，MK hi ，……，MK hm ），MK hi For MH h The number of people corresponding to the ith person group;
specifically, step S020 further includes the steps of:
s021, if p=1, obtaining mk=k 0 Step S030 is entered; otherwise, if p-1 is smaller than Q/2, the intermediate personnel number list K obtained by the p-1 th iterative calculation is obtained p-1 Exchanging the personnel number of any a personnel group to obtain a target personnel number list set MK; if p-1 is more than or equal to Q/2, K is calculated p-1 The number of persons of any 2 person group is exchanged to obtain a list set MK of the target number of persons 0 Step S030 is entered; wherein a > 2.
S030, according to MK and MX, obtaining a first priority list FY= (FY) 1 ，FY 2 ，……，FY h ，……，FY H ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein FY h FY for the h first priority h Meets the following conditions:
s040, acquiring a key personnel number list information set Gk= (GK) 1 ，GK 2 ，……，GK r ，……，GK R ) R=1, 2, … …, R; wherein R is the number of the key personnel number list information, and the R-th key personnel number list information GK r =（SGK r ，YGK r ），SGK r YGK for the r-th list of key personnel numbers r For SGK r The corresponding priority, the list information of the number of each key person is initially an empty set;
s050, GK r Corresponding information is stored in GK r+1 And will GK r Deleting personnel quantity list information stored in the original;
s060, if the target personnel quantity list is the same as any key personnel quantity list, acquiring first personnel quantity list information FK and storing FK to GK 1 The method comprises the steps of carrying out a first treatment on the surface of the If the number of people list of each target is different from the number of people list of any key, acquiring information TK of the number of people list of the second target and storing the TK to the GK 1 The method comprises the steps of carrying out a first treatment on the surface of the FK is a target personnel number list which does not belong to GK and corresponds to the minimum priority in FY, and TK is key personnel number list information corresponding to the minimum priority in GK;
s070, GK 1 The corresponding key personnel number list is used as a p-th iteration to calculate a corresponding intermediate personnel number list K p =（K p 1 ，K p 2 ，……，K p i ，……，K p m ) And proceeds to step S100.
And when the intersection between the target personnel number list and the key personnel number list is an empty set, storing the key personnel number information list corresponding to the minimum priority in the key personnel number information list in the first key personnel number information list, taking the key personnel number list in the first key personnel number information list as an intermediate decision personnel number list, and calculating a currently used variable of the iterative calculation to obtain a decision variable. Thus, the decision variable and the personnel number are mutually fed back and updated in the iterative calculation process. The problem that personnel allocation is inaccurate due to the fact that one variable is updated independently is avoided, and therefore the personnel allocation accuracy is improved.
In an embodiment of the present invention, before step S010, the method further includes:
s001, obtaining an initial decision variable set X 0 =（X 0 1 ，X 0 2 ，……，X 0 i ，……，X 0 m ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein X is 0 Initial decision variable subset X corresponding to ith personnel group 0 i =（X 0 i1 ，X 0 i2 ，……，X 0 ij ，……，X 0 in ），X 0 i List X of corresponding initial decision variables under jth target task 0 ij =（X 0 ij1 ，X 0 ij2 ，……，X 0 ijt ，……，X 0 ijT ），X 0 ijt The method comprises the steps that initial decision variables corresponding to an ith personnel group in a t-th target time period of a j-th target task are obtained;
s002, obtaining an initial personnel number list K 0 =（K 0 1 ，K 0 2 ，……，K 0 i ，……，K 0 m ）；K 0 i An initial number of people for the ith person group.
S200, according to X, obtaining a target priority list YX= (YX) 1 ，YX 2 ，……，YX r ，……，YX R ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein YX r Is X r Corresponding target priority, YX r Meets the following conditions:
wherein C is jt For the personnel state influence parameter of the jth target task at the jth target time, K p i Calculating the acquired personnel number of the ith personnel group for the p-th iteration, S 0 Is a preset loss value delta it For an operating state parameter indicating whether the ith group of personnel is in an operating state at the t-th target time period, u jt The number of people for performing the jth task during the t-th target period is lacking.
Specifically, u it Meets the following conditions: u (u) it ≥MD jt -K p i *X （p-1）r ijt The method comprises the steps of carrying out a first treatment on the surface of the Wherein MD is jt The least number of people that need to be invoked for the jth target task at the jth target time period.
Further, C jt *X （p-1）r ijt Meets the following conditions:
C jt *X （p-1）r ijt ≤Q it +δ it *Q nom the method comprises the steps of carrying out a first treatment on the surface of the Wherein Q is it For the accumulated workload of the ith group of personnel in the t target time period, Q nom The maximum workload for any person from the start of the task to the end of the task is accumulated.
Further, Q it Meets the following conditions:
further, delta it As a 0-1 decision variable, when the ith group personnel rest at the t-th target time period, delta it A value of 1; otherwise, delta it The value is 0.
Further, the loss value generated by the person not doing the task in the target time period is a fixed value, and the person skilled in the art can set the loss value generated by the person not doing the task in the target time period according to the actual requirement, which is not described herein; further, the loss value is a loss generated when the person does not process the task in the target time period.
Further, the personnel state influence parameter is a fixed value and can be obtained through table lookup.
S300, obtaining a middle priority information list ZXY p =（ZXY p 1 ，ZXY p 2 ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein ZXY p 1 For the first intermediate priority information, ZXY p 2 For the second intermediate priority information, the intermediate priority information includes: the intermediate priority and the intermediate decision variable set corresponding to the intermediate priority.
Specifically, the step S300 further includes the following steps:
s310, if p=1, arrange each target priority in order from small to large to obtain the key priority list GY p =（GY p 1 ，GY p 2 ，GY p 3 ) And proceeds to step S400.
S400, arranging each intermediate priority and each target priority in order from small to large to obtain a key priority list GY p =（GY p 1 ，GY p 2 ，GY p 3 ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the priority of the first bit of the ordering order is used as the first key priority GY p 1 The priority of the second bit of the order is used as the second key priority GY p 2 The priority of the third bit is used as the third key priority GY p 3 。
S500, each keyThe selection probability corresponding to the priority is brought into a wheel disc selection algorithm module to be processed so as to obtain the final priority ZY p ；ZY p ∈GY p The magnitude of the selection probability is inversely proportional to the magnitude of its corresponding critical priority.
Specifically, ZY p The method comprises the following steps of:
s510 according to GY p Obtaining GY p 1 Corresponding preset fourth selection probability XZ 4 The method comprises the steps of carrying out a first treatment on the surface of the Wherein XZ is 4 Meets the following conditions:
XZ 4 =MG/GY p 1 /（MG/GY p 1 +MG/GY p 2 +MG/GY p 3 ) Wherein, MG is a key priority total value, and the MG meets the following conditions that MG=GY p 1 +GY p 2 +GY p 3 。
S520, according to GY p Obtaining GY p 2 Corresponding preset fifth selection probability XZ 5 The method comprises the steps of carrying out a first treatment on the surface of the Wherein XZ is 5 Meets the following conditions:
XZ 5 =MG/GY p 2 /（MG/GY p 1 +MG/GY p 2 +MG/GY p 3 ）。
s530, according to GY p Obtaining GY p 3 Corresponding preset sixth selection probability XZ 6 The method comprises the steps of carrying out a first treatment on the surface of the Wherein ZX 6 Meets the following conditions:
XZ 6 =MG/GY p 3 /（MG/GY p 1 +MG/GY p 2 +MG/GY p 3 ）。
s540, XZ is to 4 、XZ 5 And XZ 6 The roulette selection algorithm module processes to obtain a key priority selection probability and a list Gz= (GZ) 1 、GZ 2 、GZ 3 ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein GZ 1 Is GY p 1 The corresponding key priority selection probability sum, GZ 2 Is GY p 2 The corresponding key priority selects the probability sum.
In particular, those skilled in the artThe personnel know that any pair XZ 4 、XZ 5 And XZ 6 The method of processing the selection algorithm module of the wheel disc to obtain the key priority selection probability and the list GZ falls into the protection scope of the present invention, and is not described herein.
S550, GZ 1 Corresponding priority as ZY p 。
S600, if p=q, taking the decision variable set corresponding to ZY as the final decision variable set ZX; wherein Q is a preset iterative calculation frequency threshold value.
And the wheel disc selection algorithm module is used for processing the final decision variable set corresponding to the final priority obtained by the last iterative calculation and outputting the final decision variable set to a user. Therefore, the final decision variable set represents which target task each person group is allocated to in each target time period, and the final decision variable set is selected in a mode of calculating the priority. Therefore, the workload of each personnel group is balanced, and the working efficiency of the personnel group is improved.
S700, if p is not equal to Q, obtain p=p+1 and go to step S010 to go to the next iterative calculation.
Specifically, the step S700 includes the steps of:
s710, updating ZXY;
specifically, the step S710 includes the steps of:
s711, acquisition of GY p 1 The corresponding decision variable set is used as a key decision variable set GX;
s712, according to GX, acquiring a first decision variable set FX= (FX) 1 ，FX 2 ，……，FX r ，……，FX R ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein, the r first decision variable set FX in FX r =（FX r 1 ，FX r 2 ，……，FX r i ，……，FX r m ），FX r The ith one of the subsets FX of decision variables r i =（FX r i1 ，FX r i2 ，……，FX r ij ，……，FX r in ），FX r i Corresponding first decision variable list FX under jth target task r ij =（FX r ij1 ，FX r ij2 ，……，FX r ijt ，……，FX r ijT ），FX r ijt The method comprises the steps that a first decision variable corresponding to an ith personnel group in an (r) target decision variable set under a (t) target time period of a (j) target task is generated after exchanging any target decision variable in any two target decision variable sets;
and generating a first decision variable set by exchanging any decision variable in any two target decision variable sets. Thus, by simply transforming the target decision variable, a new decision variable is generated, thereby making the decision variable more likely.
In another embodiment of the present invention, the second set of decision variables may also be generated after transforming any decision variable in any first set of decision variables. A second set of decision variables is generated by transforming any decision variable in any of the first set of decision variables. Thus, the first decision variable is simply transformed by a method different from the above embodiment, so that a new decision variable is generated, and thus, more possibilities are generated for the decision variable.
S713, according to FX, obtaining a sixth priority list SY= (SY) 1 ，SY 2 ，……，SY r ，……，SY R ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein SY r Is FX r Corresponding priority, SY r Meets the following conditions:
s714, if p=1, each sixth priority is ordered in order from small to large, and a seventh priority list Qy= (QY) 1 ，QY 2， ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the priority of the first bit of the sorting order is used as the first seventh priority QY 1 The priority of the second bit of the order is ordered as the second seventh priority QY 2 ；
S715 of QY 1 And QY 1 The corresponding first decision variable set is taken as ZXY p 1 Will QY 2 And QY 2 The corresponding first decision variable set is taken as ZXY p 2 And performs S720;
s716, if p is not equal to 1, obtaining an intermediate priority information list ZXY corresponding to the p-1 th iterative calculation p-1 =（ZXY p-1 1 ，ZXY p-1 2 ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein ZXY p-1 1 First intermediate priority information, ZXY, obtained for the p-1 st iteration p-1 2 Second intermediate priority information obtained for the p-1 th iterative calculation;
s717, sorting each intermediate priority and each seventh priority in order from small to large, obtaining an eighth priority list Ey= (EY) 1 ，EY 2 ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the priority of the first bit of the sorting order is used as the first eighth priority EY 1 The priority of the second bit of the order is ordered as the second eighth priority EY 2 ；
S718, EY 1 And EY 1 The corresponding first decision variable set is taken as ZXY p 1 EY is to 2 And EY 2 The corresponding first decision variable set is taken as ZXY p 2 And S720 is performed.
S720, if p+.q, obtain p=p+1, and go to step S010 to go to the next iteration calculation.
Thus, the decision variable corresponding to the optimal priority which is currently selected is obtained through each iterative calculation of the steps.
Embodiments of the present invention also provide a non-transitory computer readable storage medium that may be disposed in an electronic device to store at least one instruction or at least one program for implementing one of the methods embodiments, the at least one instruction or the at least one program being loaded and executed by the processor to implement the methods provided by the embodiments described above.
Embodiments of the present invention also provide an electronic device comprising a processor and the aforementioned non-transitory computer-readable storage medium.
Embodiments of the present invention also provide a computer program product comprising program code for causing an electronic device to carry out the steps of the method according to the various exemplary embodiments of the invention as described in the specification, when said program product is run on the electronic device.
While certain specific embodiments of the invention have been described in detail by way of example, it will be appreciated by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the invention. Those skilled in the art will also appreciate that many modifications may be made to the embodiments without departing from the scope and spirit of the invention. The scope of the invention is defined by the appended claims.
Claims (10)
1. A method of determining a person group decision variable, the method comprising the steps of:
s100, randomly generating target decision change corresponding to current iterative computationQuantity set X p =（X p1 ，X p2 ，……，X pr ，……，X pR ) R=1, 2, … …, R; wherein R is the number of target decision variable sets, and the R-th target decision variable set X pr =（X pr 1 ，X pr 2 ，……，X pr i ，……，X pr m ) I=1, 2, … …, m, m is the number of human groups, X pr Corresponding target decision variable subset X pr i =（X pr i1 ，X pr i2 ，……，X pr ij ，……，X pr in ) J=1, 2, … …, n, n is the number of target tasks, X pr i Target decision variable list X corresponding to jth target task pr ij =（X pr ij1 ，X pr ij2 ，……，X pr ijt ，……，X pr ijT ) T=1, 2, … …, T is the number of target time periods, X pr ijt The method comprises the steps that (1) target decision variables corresponding to an ith personnel group in a jth target time period of a jth target task are collected for the (r) target decision variables, and p is the number of times of current iterative computation; if X pr ijt =0 indicates that the ith person group did not perform the jth task for the t time period, if X pr ijt =1 then indicates that the ith group of people performs the jth task during the t-th time period;
s200, according to X, obtaining a target priority list YX= (YX) 1 ，YX 2 ，……，YX r ，……，YX R ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein YX r Is X r Corresponding target priority, YX r Meets the following conditions:
wherein C is jt For the personnel state influence parameter of the jth target task at the jth target time, K p i The ith personnel group obtained for the p-th iterative calculationNumber of people, S 0 Is a preset loss value delta it For an operating state parameter indicating whether the ith group of personnel is in an operating state at the t-th target time period, u jt Lack of numbers for personnel performing the jth task during the t-th target time period;
s300, obtaining a middle priority information list ZXY p =（ZXY p 1 ，ZXY p 2 ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein ZXY p 1 For the first intermediate priority information, ZXY p 2 For the second intermediate priority information, the intermediate priority information includes: the intermediate priority and the intermediate decision variable set corresponding to the intermediate priority;
s400, arranging each intermediate priority and each target priority in order from small to large to obtain a key priority list GY p =（GY p 1 ，GY p 2 ，GY p 3 ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the priority of the first bit of the ordering order is used as the first key priority GY p 1 The priority of the second bit of the order is used as the second key priority GY p 2 The priority of the third bit is used as the third key priority GY p 3 ；
S500, the selection probability corresponding to each key priority is brought into a wheel disc selection algorithm module to be processed, so that the final priority ZY is obtained p ；ZY p ∈GY p The magnitude of the selection probability is inversely proportional to the magnitude of the key priority corresponding to the selection probability;
s600, if p=q, taking the decision variable set corresponding to ZY as the final decision variable set ZX; wherein Q is a preset iterative calculation frequency threshold value.
2. The method according to claim 1, characterized in that before said step S100, the method further comprises the steps of:
s010, acquiring a key decision variable set MX= (MX) 1 ，MX 2 ，……，MX i ，……，MX m ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the ith key decision in MX becomesQuantity subset MX i =（MX i1 ，MX i2 ，……，MX ij ，……，MX in ），MX i Target decision variable list MX corresponding to jth target task ij =（MX ij1 ，MX ij2 ，……，MX ijt ，……，MX ijT ），MX ijt The method comprises the steps that the key decision variables corresponding to an ith personnel group in a jth target time period of a jth target task are collected for the jth target decision variables;
s020, obtaining a target personnel quantity list set MK= (MK) 1 ，MK 2 ，……，MK h ，……，MK H ) H=1, 2, … …, H is the number of target person number list, and the H-th target person number list MH in MK h =（MK h1 ，MK h2 ，……，MK hi ，……，MK hm ），MK hi For MH h The number of people corresponding to the ith person group;
s030, according to MK and MX, obtaining a first priority list FY= (FY) 1 ，FY 2 ，……，FY h ，……，FY H ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein FY h FY for the h first priority h Meets the following conditions:
s040, acquiring a key personnel number list information set Gk= (GK) 1 ，GK 2 ，……，GK r ，……，GK R ) R=1, 2, … …, R; wherein R is the number of the key personnel number list information, and the R-th key personnel number list information GK r =（SGK r ，YGK r ），SGK r YGK for the r-th list of key personnel numbers r For SGK r The corresponding priority, the list information of the number of each key person is initially an empty set;
s050, GK r Corresponding information is stored in GK r+1 And will GK r Deleting personnel quantity list information stored in the original;
s060, if the target personnel quantity list is the same as any key personnel quantity list, acquiring first personnel quantity list information FK and storing FK to GK 1 The method comprises the steps of carrying out a first treatment on the surface of the If the number of people list of each target is different from the number of people list of any key, acquiring information TK of the number of people list of the second target and storing the TK to the GK 1 The method comprises the steps of carrying out a first treatment on the surface of the FK is a target personnel number list which does not belong to GK and corresponds to the minimum priority in FY, and TK is key personnel number list information corresponding to the minimum priority in GK;
s070, GK 1 The corresponding key personnel number list is used as a p-th iteration to calculate a corresponding intermediate personnel number list K p =（K p 1 ，K p 2 ，……，K p i ，……，K p m ) And proceeds to step S100;
the step S600 further includes:
s700, if p is not equal to Q, obtain p=p+1 and go to step S010 to go to the next iterative calculation.
3. The method according to claim 2, characterized in that before step S010, the method further comprises:
s001, obtaining an initial decision variable set X 0 =（X 0 1 ，X 0 2 ，……，X 0 i ，……，X 0 m ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein X is 0 Initial decision variable subset X corresponding to ith personnel group 0 i =（X 0 i1 ，X 0 i2 ，……，X 0 ij ，……，X 0 in ），X 0 i List X of corresponding initial decision variables under jth target task 0 ij =（X 0 ij1 ，X 0 ij2 ，……，X 0 ijt ，……，X 0 ijT ），X 0 ijt The method comprises the steps that initial decision variables corresponding to an ith personnel group in a t-th target time period of a j-th target task are obtained;
s002, obtaining the initialList of personnel number K 0 =（K 0 1 ，K 0 2 ，……，K 0 i ，……，K 0 m ）；K 0 i An initial number of people for the ith person group.
4. A method according to claim 3, wherein step S010 comprises the steps of:
s011, if p=1, obtain mx=x 0 And proceeds to step S020; otherwise, ZXY 1 The corresponding intermediate decision variable set is taken as MX and entered into step S020.
5. A method according to claim 3, wherein step S020 comprises the steps of:
s021, if p=1, obtaining mk=k 0 Step S030 is entered; otherwise, if p-1 is smaller than Q/2, the intermediate personnel number list K obtained by the p-1 th iterative calculation is obtained p-1 Exchanging the personnel number of any a personnel group to obtain a target personnel number list set MK; if p-1 is more than or equal to Q/2, K is calculated p-1 The number of persons of any 2 person group is exchanged to obtain a list set MK of the target number of persons 0 Step S030 is entered; wherein a > 2.
6. The method according to claim 1, wherein the step S300 comprises the steps of:
s310, if p=1, arrange each target priority in order from small to large to obtain the key priority list GY p =（GY p 1 ，GY p 2 ，GY p 3 ) And proceeds to step S400.
7. The method according to claim 2, wherein said step S700 comprises the steps of:
s710, updating ZXY;
s720, if p+.q, obtain p=p+1, and go to step S010 to go to the next iteration calculation.
8. The method according to claim 7, wherein the step S710 includes the steps of:
s711, acquisition of GY p 1 The corresponding decision variable set is used as a key decision variable set GX;
s712, according to GX, acquiring a first decision variable set FX= (FX) 1 ，FX 2 ，……，FX r ，……，FX R ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein, the r first decision variable set FX in FX r =（FX r 1 ，FX r 2 ，……，FX r i ，……，FX r m ），FX r The ith one of the subsets FX of decision variables r i =（FX r i1 ，FX r i2 ，……，FX r ij ，……，FX r in ），FX r i Corresponding first decision variable list FX under jth target task r ij =（FX r ij1 ，FX r ij2 ，……，FX r ijt ，……，FX r ijT ），FX r ijt The method comprises the steps that a first decision variable corresponding to an ith personnel group in an (r) target decision variable set under a (t) target time period of a (j) target task is generated after exchanging any target decision variable in any two target decision variable sets;
s713, according to FX, obtaining a sixth priority list SY= (SY) 1 ，SY 2 ，……，SY r ，……，SY R ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein SY r Is FX r Corresponding priority, SY r Meets the following conditions:
s714, if p=1, each sixth priority is ordered in order from small to large, and a seventh priority list Qy= (QY) 1 ，QY 2， ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the priority of the first bit of the sorting order is used as the first seventh priority QY 1 The priority of the second bit of the order is ordered as the second seventh priority QY 2 ；
S715 of QY 1 And QY 1 The corresponding first decision variable set is taken as ZXY p 1 Will QY 2 And QY 2 The corresponding first decision variable set is taken as ZXY p 2 And performs S720;
s716, if p is not equal to 1, obtaining an intermediate priority information list ZXY corresponding to the p-1 th iterative calculation p-1 =（ZXY p-1 1 ，ZXY p -1 2 ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein ZXY p-1 1 First intermediate priority information, ZXY, obtained for the p-1 st iteration p-1 2 Second intermediate priority information obtained for the p-1 th iterative calculation;
s717, sorting each intermediate priority and each seventh priority in order from small to large, obtaining an eighth priority list Ey= (EY) 1 ，EY 2 ) The method comprises the steps of carrying out a first treatment on the surface of the Wherein the priority of the first bit of the sorting order is used as the first eighth priority EY 1 The priority of the second bit of the order is ordered as the second eighth priority EY 2 ；
S718, EY 1 And EY 1 The corresponding first decision variable set is taken as ZXY p 1 EY is to 2 And EY 2 The corresponding first decision variable set is taken as ZXY p 2 And S720 is performed.
9. A non-transitory computer readable storage medium having stored therein at least one instruction or at least one program loaded and executed by a processor to implement the method of any one of claims 1-8.
10. An electronic device comprising a processor and the non-transitory computer readable storage medium of claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310450076.3A CN116167595B (en) | 2023-04-25 | 2023-04-25 | Method for determining personnel group decision variables, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310450076.3A CN116167595B (en) | 2023-04-25 | 2023-04-25 | Method for determining personnel group decision variables, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116167595A true CN116167595A (en) | 2023-05-26 |
| CN116167595B CN116167595B (en) | 2023-08-11 |
Family
ID=86413583
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310450076.3A Active CN116167595B (en) | 2023-04-25 | 2023-04-25 | Method for determining personnel group decision variables, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116167595B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116955049A (en) * | 2023-07-27 | 2023-10-27 | 山东溯源安全科技有限公司 | Method for determining detection sequence, electronic equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109636205A (en) * | 2018-12-18 | 2019-04-16 | 合肥师范学院 | More skill's dispatching methods in a kind of research & development portfolio |
| CN110689320A (en) * | 2019-09-24 | 2020-01-14 | 南京信息工程大学 | Large-scale multi-target project scheduling method based on co-evolution algorithm |
| CN113657718A (en) * | 2021-07-20 | 2021-11-16 | 香港中文大学（深圳） | Multi-robot dynamic alliance task allocation method and related device |
| US20220318712A1 (en) * | 2021-04-05 | 2022-10-06 | Jpmorgan Chase Bank, N.A. | Method and system for optimization of task management issue planning |
| CN115374763A (en) * | 2022-10-24 | 2022-11-22 | 北京睿企信息科技有限公司 | System for acquiring user priority |
| CN115409243A (en) * | 2022-08-02 | 2022-11-29 | 北京合众思壮时空物联科技有限公司 | Operation resource allocation and task scheduling method and terminal |
-
2023
- 2023-04-25 CN CN202310450076.3A patent/CN116167595B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109636205A (en) * | 2018-12-18 | 2019-04-16 | 合肥师范学院 | More skill's dispatching methods in a kind of research & development portfolio |
| CN110689320A (en) * | 2019-09-24 | 2020-01-14 | 南京信息工程大学 | Large-scale multi-target project scheduling method based on co-evolution algorithm |
| US20220318712A1 (en) * | 2021-04-05 | 2022-10-06 | Jpmorgan Chase Bank, N.A. | Method and system for optimization of task management issue planning |
| CN113657718A (en) * | 2021-07-20 | 2021-11-16 | 香港中文大学（深圳） | Multi-robot dynamic alliance task allocation method and related device |
| CN115409243A (en) * | 2022-08-02 | 2022-11-29 | 北京合众思壮时空物联科技有限公司 | Operation resource allocation and task scheduling method and terminal |
| CN115374763A (en) * | 2022-10-24 | 2022-11-22 | 北京睿企信息科技有限公司 | System for acquiring user priority |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116955049A (en) * | 2023-07-27 | 2023-10-27 | 山东溯源安全科技有限公司 | Method for determining detection sequence, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116167595B (en) | 2023-08-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116167595B (en) | Method for determining personnel group decision variables, electronic equipment and storage medium | |
| CN111158912B (en) | Task unloading decision method based on deep learning in cloud and fog collaborative computing environment | |
| CN108055292B (en) | Optimization method for mapping from virtual machine to physical machine | |
| CN107679750A (en) | A kind of cloud manufacturing service reso urce matching method based on adaptation coefficient genetic algorithm | |
| CN113361721A (en) | Model training method, model training device, electronic device, storage medium, and program product | |
| CN109389424B (en) | Flow distribution method and device, electronic equipment and storage medium | |
| CN110751416A (en) | Method, device and equipment for predicting water consumption | |
| CN104077634A (en) | Active-reactive type dynamic project scheduling method based on multi-objective optimization | |
| CN114816711A (en) | Batch task processing method and device, computer equipment and storage medium | |
| CN114461384A (en) | Task execution method and device, computer equipment and storage medium | |
| CN116244484B (en) | Federal cross-modal retrieval method and system for unbalanced data | |
| CN112966930A (en) | Evaluation method and device for photovoltaic power station and computer readable storage medium | |
| CN112101612A (en) | Prediction method of town gas usage, storage medium and terminal equipment | |
| CN111027760A (en) | Power load prediction method based on least square vector machine | |
| CN116187675A (en) | Task allocation method, device, equipment and storage medium | |
| CN115860190A (en) | Training of load detection model, method for detecting power load and related device | |
| CN115293366A (en) | Model training method, information prediction method, device, equipment and medium | |
| CN114611805A (en) | Net load prediction method and device, electronic equipment and storage medium | |
| CN112529732A (en) | Energy storage unit charging and discharging control method and device, computer equipment and storage medium | |
| CN112954022A (en) | Multi-concurrency real-time communication method and device based on intelligent substation | |
| CN112348235A (en) | Wind-solar bus load self-adaptive prediction method and device and computer equipment | |
| CN111899123A (en) | Electric quantity prediction method, electric quantity prediction device and computer readable storage medium | |
| CN110312272A (en) | A kind of network services block resource allocation methods and storage medium | |
| CN116502286B (en) | Standard information service method and system based on edge calculation | |
| CN112801548B (en) | Flight scheduling system |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |