CN109948828A - Working procedure compositor method and device - Google Patents
Working procedure compositor method and device Download PDFInfo
- Publication number
- CN109948828A CN109948828A CN201910063401.4A CN201910063401A CN109948828A CN 109948828 A CN109948828 A CN 109948828A CN 201910063401 A CN201910063401 A CN 201910063401A CN 109948828 A CN109948828 A CN 109948828A
- Authority
- CN
- China
- Prior art keywords
- group
- individual
- population
- fitness value
- generation
- 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
Landscapes
- General Factory Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Feedback Control In General (AREA)
Abstract
The embodiment of the present invention provides a kind of working procedure compositor method and device, which comprises calculates the fitness value of each individual in contemporary population；All individuals are arranged according to the sequence of fitness value from big to small, select the individual of preceding first predetermined number to retain group as elite, the individual of preceding second predetermined number is as elite group；Roulette operation is carried out to contemporary population, multiple individuals is selected as the first common subgroup and the first common subgroup and the second common subgroup is combined and obtain common group using the individual obtained by random fashion as the second common subgroup；Cross and variation operation is carried out to elite group and common group respectively and obtains first child group and second filial generation group, elite is retained group, first child group and second filial generation group to be combined as next-generation population, until meeting termination condition, it regard the highest individual of fitness value in last generation population as optimal Operation Sequencing result.The present invention can make optimal Operation Sequencing result reach global optimum.
Description
Technical field
The embodiment of the present invention belongs to Topological expansion technical field, more particularly, to a kind of working procedure compositor side
Method and device.
Background technique
Company carries increasingly heavier decision in the running of modern society, and project is that modern corporation is implemented
Main carriers.Current project becomes increasingly complex, the resource for the every aspect being related to, and network structure relationship is increasingly complicated.When
It is preceding with project scheduling be main application background scheduling problem in, how by process carry out rational sorting with shorten complete
The total construction period of scheduler object is the major issue of concern.
The initial artificial method being ranked up to project process has much been unable to satisfy the timeliness requirement of scheduling.With
Heuritic approach has application on the problem of NP-Hard attribute solving, using genetic algorithm as the heuritic approach of representative just
Increasingly play its superiority in terms of optimization problem.For traditional genetic algorithm in optimization, usual step includes 1, just
Beginningization population；2, the selection operation of population is completed by roulette as probability distribution foundation based on fitness value；3, to population
Execute crossover operation；4, mutation operation is executed to population；5, next-generation population is obtained.
Traditional genetic algorithm is applied in complicated Project Scheduling problem, easily generation Premature Convergence, in distance
Optimal result conveniently falls into local optimum farther awayly.
Summary of the invention
Easily to fall into local optimum when overcoming the problems, such as that above-mentioned existing genetic algorithm is applied to the Operation Sequencing of complicated project
The problem of or at least be partially solved the above problem, the embodiment of the present invention provides a kind of working procedure compositor method and device.
According to a first aspect of the embodiments of the present invention, a kind of working procedure compositor method is provided, comprising:
Calculate the fitness value of each individual in contemporary population；Wherein, it is described individual be destination item Operation Sequencing as a result,
Each individual corresponding destination item deadline is more early, and corresponding fitness value is bigger；
All individuals are arranged according to the sequence of fitness value from big to small, select preceding first predetermined number
Individual retains group as elite, and the individual of preceding second predetermined number is as elite group；
Roulette operation is carried out according to the corresponding fitness value of individual each in the contemporary population, from the contemporary population
It selects multiple individuals and is used as the first common subgroup, the multiple random individuals obtained by way of generating at random are general as second
Logical subgroup, the described first common subgroup and the second common subgroup are combined and obtain common group；
The elite group is intersected and mutation operation obtains first child group, the common group is intersected and become
ETTHER-OR operation obtains second filial generation group, and the elite is retained group, the first child group and the second filial generation group and is combined,
Next-generation population is obtained, until meeting preset termination condition, by the highest individual of fitness value in last generation population as most
Excellent Operation Sequencing result.
Second aspect according to embodiments of the present invention provides a kind of working procedure compositor device, comprising:
Computing module, for calculating the fitness value of each individual in contemporary population；Wherein, the individual is destination item
For Operation Sequencing as a result, each individual corresponding destination item deadline is more early, corresponding fitness value is bigger；
Selecting module, for arranging all individuals according to the sequence of fitness value from big to small, before selection
The individual of first predetermined number retains group as elite, and the individual of preceding second predetermined number is as elite group；
Composite module, for carrying out roulette operation according to the corresponding fitness value of individual each in the contemporary population, from
Multiple individuals, which are selected, in the present age population is used as the first common subgroup, it is multiple random by what is obtained by way of generating at random
Individual is used as the second common subgroup, and the described first common subgroup and the second common subgroup are combined and obtain common group；
Generation module, for intersecting to the elite group and mutation operation obtains first child group, to described common
Group intersect and mutation operation obtains second filial generation group, and the elite is retained group, the first child group and described second
Filial generation group is combined, and obtains next-generation population, until meeting preset termination condition, most by fitness value in last generation population
High individual is as optimal Operation Sequencing result.
In terms of third according to an embodiment of the present invention, a kind of electronic equipment is also provided, comprising:
At least one processor；And
At least one processor being connect with the processor communication, in which:
The memory is stored with the program instruction that can be executed by the processor, and the processor calls described program to refer to
Order is able to carry out Operation Sequencing provided by any possible implementation in the various possible implementations of first aspect
Optimization method.
4th aspect according to an embodiment of the present invention, also provides a kind of non-transient computer readable storage medium, described
Non-transient computer readable storage medium stores computer instruction, and the computer instruction makes the computer execute first aspect
Various possible implementations in working procedure compositor method provided by any possible implementation.
The embodiment of the present invention provides a kind of working procedure compositor method and device, and this method is calculated by using improved heredity
Method calculates the fitness value of each individual in contemporary population, extracts elite from contemporary population according to the fitness value of individual and retains group
With elite group, the individual of selection is operated according to wheel disc and the individual generated at random obtains common group, elite group and common group is only
It is vertical to execute genetic manipulation, i.e., the deep search to previous generation elite is realized by elite group, by combine common group realize to from
The individual and be randomly incorporated into unrelated with previous generation that previous generation roulette selection goes out generate group and carry out genetic search, to increase
The range of search, so that remain to converge near optimal result when solving complicated Project Scheduling problem relatively stablely.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is this hair
Bright some embodiments for those of ordinary skill in the art without creative efforts, can be with root
Other attached drawings are obtained according to these attached drawings.
Fig. 1 is working procedure compositor method overall flow schematic diagram provided in an embodiment of the present invention；
Fig. 2 is working procedure compositor device overall structure diagram provided in an embodiment of the present invention；
Fig. 3 is electronic equipment overall structure diagram provided in an embodiment of the present invention.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without creative efforts, shall fall within the protection scope of the present invention.
A kind of working procedure compositor method is provided in one embodiment of the invention, and Fig. 1 provides for the embodiment of the present invention
Working procedure compositor method overall flow schematic diagram calculate the fitness of each individual in contemporary population this method comprises: S101
Value；Wherein, it is described individual be destination item Operation Sequencing as a result, each individual corresponding destination item deadline get over
Early, corresponding fitness value is bigger；
Specifically, the present embodiment is optimized based on Operation Sequencing of the Revised genetic algorithum to destination item.It is improving
Genetic algorithm in, calculate the fitness value of each individual in contemporary population.Wherein, the individual in population is the work of destination item
Sequence ranking results.The contemporary population that Revised genetic algorithum starts is initial population, and the individual in initial population is initial process
Ranking results.The fitness value of individual reacts the morning and evening of each individual corresponding destination item deadline, when destination item is completed
Between it is more early, the fitness value of corresponding individual is bigger；Conversely, smaller.
All individuals are arranged according to the sequence of fitness value from big to small, select preceding first to preset by S102
The individual of number retains group as elite, and the individual of preceding second predetermined number is as elite group；
Usual second predetermined number is greater than the first predetermined number.When beginning, input elite group, elite retain group, with a group of planes
Population at individual number or account for population total ratio.The fitness value descending of individuals all in contemporary population is arranged, according to pre-
If population number or account for population total ratio using fitness value sequence preceding first predetermined number jy_s individual as elite guarantor
Crowd J is stayed, fitness value sequence is selected in the individual of preceding second predetermined number eli-jy_s, as elite group JP.eli-jy_s
For the constant greater than jy_s.
S103 carries out roulette operation according to the corresponding fitness value of individual each in the contemporary population, from the present age
Multiple individuals are selected in population as the first common subgroup, using the multiple random individuals obtained by way of generating at random as
Described first common subgroup and the second common subgroup are combined and obtain common group by the second common subgroup；
Roulette operation is carried out according to the fitness of individual each in contemporary population, selects Z from contemporary population1Individual is made
For the Z for combining common group1Part.Z is generated by way of generating at random2Individual is as the Z for combining common group2Part.Z1Portion
Point and Z2Part collectively constitutes common group Z.
S104, intersects the elite group and mutation operation obtains first child group, hands over the common group
Fork and mutation operation obtain second filial generation group, by the elite retain group, the first child group and the second filial generation group into
Row combination obtains next-generation population, until meeting preset termination condition, by the highest individual of fitness value in last generation population
As optimal Operation Sequencing result.
Mutually independent genetic manipulation is executed respectively to elite group JP and common group Z, i.e. intersection and mutation operation.To elite
The filial generation group Y and elite that the filial generation group JC and common group Z that group JP is obtained by genetic manipulation are obtained by genetic manipulation retain group J
Next-generation population is formed together.Judge whether to reach termination condition, for example whether reaching preset genetic algebra.If reaching termination
Condition then terminates to search for, and regard the highest individual of fitness value in last generation population as optimal Operation Sequencing result.
The embodiment of the present invention calculates the fitness value of each individual in contemporary population by using Revised genetic algorithum, according to
The fitness value of individual extracts elite from contemporary population and retains group and elite group, operates the individual and random of selection according to wheel disc
The individual of generation obtains common group, and elite group and common group are independently executed genetic manipulation, i.e., is realized by elite group to upper one
For the deep search of elite, realized by combining common group to the individual that goes out from previous generation roulette selection and unrelated with previous generation
Be randomly incorporated into and generate group and carry out genetic search, to increase the range of search, so that being asked solving complicated project scheduling
When topic, remain to converge near optimal result relatively stablely.
On the basis of the above embodiments, the step of fitness value of each individual in contemporary population is calculated in the present embodiment it
Before further include: the total number of all process steps is as code length in destination item, using the number of each process as gene member
Plain value is encoded；Wherein, position of any process in coding result is located at after the precedence activities of the process；According to
Coding result generates initial population, using the initial population as contemporary population.
Specifically, using the total data of all process steps in destination item as code length, the gene elements value of coding is indicated
Corresponding process number.Gene position locating for any process all must be positioned at after its precedence activities when coding, to meet process
Between tight preceding next relationship.It is encoded according to code length and gene elements, is generated according to coding result and meet constraint item
The initial population of part, i.e., initial ranking results.Using initial population as contemporary population when beginning, carried out according to initial population iteration
Genetic manipulation, until reaching preset termination condition.
On the basis of the above embodiments, the step of fitness value of each individual in contemporary population is calculated in the present embodiment has
Body includes: that any individual in the contemporary population is worked as by described in if process headed by the process of the individual present arrangement
At the beginning of the earliest available time of resource needed for preceding arrangement process is as the present arrangement process；If the individual is currently pacified
The process of row is non-first process, then described by after the Late Finish of all precedence activities of the present arrangement process
At the beginning of the earliest available time of resource needed for present arrangement process is as the present arrangement process；According in the individual
The Late Finish of all process steps calculates the fitness value of the individual.
Specifically, function is calculated in conjunction with fitness, decoding obtains the corresponding fitness value of each individual UVR exposure in contemporary population.
Individual in contemporary population is cloned first and is encoded for its identical one section, clone's code is denoted as, and reads the first place of clone's code
Gene.Then it transfers the required resource of process represented by the gene and completes time-consuming.If the process arranged in any individual
Headed by process, without constraint before tight, then using the earliest available time of resource needed for the process as the beginning of present arrangement process
Time, according to the completion of the process time-consuming completion moment for obtaining the process；Otherwise, all at it when process is non-first process
After precedence activities complete the moment the latest, using the earliest available time of resource needed for the process as the beginning of present arrangement process
Time.The gene arranged is deleted from clone's code.When cloning in code without gene, the scheduling meter of the individual UVR exposure is completed
It calculates, using process moment and fitness function calculation formula is terminated the latest, obtains the fitness value of the individual.Otherwise, continue into
The arrangement of other processes in the row individual.The individual collections that the individual for having calculated fitness never calculates fitness are moved into
In the individual collections for calculating fitness.If not calculating the individual collections of fitness as sky, terminates fitness and calculate.Otherwise, continue
Calculate the fitness value of next individual in the individual collections for not calculating fitness.
On the basis of the above embodiments, the elite is retained into group, the first child group and described in the present embodiment
Second filial generation group is combined, and next-generation population is obtained, until the step of meeting preset termination condition further include: if being unsatisfactory for pre-
If termination condition, then calculate in the maximum value and the contemporary population in the next-generation population in the fitness value of all individuals
Maximum value in the fitness value of all individuals；If the maximum value in the next generation population in the fitness value of all individuals is big
Maximum value in the contemporary population in the fitness value of all individuals, then by the suitable of each individual in next-generation heredity
The mutation probability of angle value and/or the elite group and common group is answered to be adjusted.
Specifically, in the case where not reaching preset termination condition, judge whether the optimum individual of next-generation population compares
Optimum individual in its previous generation is more excellent.Wherein optimum individual is the maximum individual of fitness value.If so, hereditary next time
The middle mutation probability for changing elite group and common group；And/or the fitness value of each individual.
On the basis of the above embodiments, in the present embodiment in next-generation heredity by the fitness value of each individual into
The step of row is adjusted specifically includes: increasing the value of default regulatory factor；By the fitness of each individual in next-generation heredity
Value is multiplied by the default regulatory factor after the increase greater than 1.
It specifically, is the diversity of maintenance population, the individual heredity rapidly that prevents from being dominant makes population that convergence occur, this
Fitness regulatory factor condition is a larger value but cannot be too big by inventive embodiments, so that each individual in population was selected
It is too big that probability is unlikely to difference.By the fitness value of each individual multiplied by the default regulatory factor after increase in next-generation heredity.
In order to make to be dominant, individual is spread, and the value for presetting regulatory factor is greater than 1.
On the basis of the above embodiments, if in the present embodiment in the next generation population in the fitness value of all individuals
Maximum value be greater than the maximum value in the contemporary population in the fitness value of all individuals, then it is next-generation it is hereditary in by each institute
The step of mutation probability of the fitness value and/or the elite group and common group of stating individual is adjusted further include: if described
Maximum value in next-generation population in the fitness value of all individuals is not more than the fitness of all individuals in the contemporary population
Maximum value in value then judges whether become close to the corresponding maximum value of population of default algebra before the next-generation population
Change；If remaining unchanged, increase the number of the random individual in next-generation heredity.
Specifically, if the optimum individual of next-generation population is not more excellent than the optimum individual in its previous generation, judge most
Whether the fitness value of excellent individual changes in default algebra.If meeting the fitness value of optimum individual in default algebra not
Become, then increase the number of random individual in next-generation heredity, otherwise directly carries out next-generation heredity.
The elite group is intersected on the basis of the various embodiments described above, in the present embodiment and mutation operation obtains the
One filial generation group, the common group is intersected and mutation operation obtain second filial generation group the step of specifically include: by the essence
In British group it is all individual carry out crossover operations, according to the mutation probability of the elite group from the elite flock-mate fork after individual
The middle multiple individuals of selection carry out mutation operation, obtain first child group；All individuals in the common group are subjected to intersection behaviour
Make, selects multiple individuals to carry out variation behaviour from the individual after the common flock-mate fork according to the mutation probability of the common group
Make, obtains second filial generation group.
Specifically, when executing crossover operation, it regard the individual in the population for needing to be implemented crossover operation as parent in turn,
In addition a female generation for being different from parent is picked out in population, is paired into parents' generation.Composition filial generation is picked out from parents' generation
Gene, and the identical gene position of gene that father, mother Dai Zhongyu are picked out is deleted.When the gene elmination in certain parents generation is completed
When, an intersection offspring individual is just obtained, when the gene in all parents' generations all deletes completion, just obtains complete intersection
Filial generation.Since elite group and common group execute genetic manipulation independently of each other, for this purpose, completely intersecting filial generation will include elite group
Intersect filial generation and common flock-mate fork generation.
Intersect filial generation group to two and executes mutually independent mutation operation.First take out setting number to variation individual, and
Obtain the mutant gene position to variation individual.It finds and comes last process gene position PL in mutant gene precedence activities；And
Most preceding process gene position FF is come in mutant gene successor activities.An insertion position is randomly generated between section (PL, FF), it will
Insertion position is moved into mutant gene, and protogene at insertion position is moved into mutant gene position.
The combinatorial optimization problem in complicated project scheduling is applied to highlight Revised genetic algorithum in the embodiment of the present invention
When superiority different something lost are respectively adopted using the example J120_23_7 in project of standard development scheduling problem library PSPLIB as example
Propagation algorithm independently optimizes, and example J120_23_7 includes 120 processes, and 4 kinds of renewable resources give shortest limit time value
It is 104.Every kind of 20 generation of algorithm independent inheritance is set, it is below that the corresponding project's finish time of last generation individual is in 110
Operation Sequencing result is considered as acceptable optimum results, and relative parameters setting is shown in Table 1 in two kinds of genetic algorithms, and optimum results are corresponding
Project's finish time, which summarizes, is shown in Table 2.By the numerical value of table 2 last column it is found that the improved adaptive GA-IAGA that uses of the present invention is to calculation
The independent iteration 20 times Operation Sequencing results of example have 5 Operation Sequencing knots within 110, better than using common genetic algorithm
The case where fruit exceeds 110, therefore related improve designed in the embodiment of the present invention produces a desired effect.
1 present invention of table and existing method parameter setting
2 present invention of table corresponds to project's finish time with existing method optimum results and summarizes
| Serial number | Method | Beyond 110 number |
| 1 | The present invention | 0 |
| 2 | Existing method | 5 |
A kind of working procedure compositor device is provided in another embodiment of the present invention, and the device is for realizing aforementioned each
Method in embodiment.Therefore, the description and definition in each embodiment of foregoing sequence sorting consistence method can be used for this
The understanding of each execution module in inventive embodiments.Fig. 2 is that working procedure compositor device provided in an embodiment of the present invention is integrally tied
Structure schematic diagram, the device include computing module 201, selecting module 202, composite module 203 and generation module 204；Wherein:
Computing module 201 is used to calculate the fitness value of each individual in contemporary population；Wherein, the individual is destination item
Operation Sequencing as a result, each individual corresponding destination item deadline is more early, corresponding fitness value is bigger；Select mould
Block 202 is used to arrange all individuals according to the sequence of fitness value from big to small, selects preceding first predetermined number
Individual as elite retain group, the fitness value of preceding second predetermined number it is corresponding individual be used as elite group；Composite module 203
For carrying out roulette operation according to the corresponding fitness value of individual each in the contemporary population, selected from the contemporary population
Multiple individuals are used as the first common subgroup, using the multiple random individuals obtained by way of generating at random as the second common son
Described first common subgroup and the second common subgroup are combined and obtain common group by group；Generation module 204 is used for institute
It states that elite group intersect and mutation operation obtains first child group, the common group is intersected and mutation operation acquisition the
The elite is retained group, the first child group and the second filial generation group and is combined by two filial generation groups, obtains next-generation kind
Group regard the highest individual of fitness value in last generation population as optimal Operation Sequencing knot until meeting preset termination condition
Fruit.
The embodiment of the present invention calculates the fitness value of each individual in contemporary population by using Revised genetic algorithum, according to
The fitness value of individual extracts elite from contemporary population and retains group and elite group, operates the individual and random of selection according to wheel disc
The individual of generation obtains common group, and elite group and common group are independently executed genetic manipulation, i.e., is realized by elite group to upper one
For the deep search of elite, realized by combining common group to the individual that goes out from previous generation roulette selection and unrelated with previous generation
Be randomly incorporated into and generate group and carry out genetic search, to increase the range of search, so that being asked solving complicated project scheduling
When topic, remain to converge near optimal result relatively stablely.
It on the basis of the above embodiments, further include coding module in the present embodiment, for all process steps in destination item
Total number as code length, the number of each process is encoded as gene elements value；Wherein, any work
Position of the sequence in coding result is located at after the precedence activities of the process；Initial population is generated according to coding result, it will be described
Initial population is as contemporary population.
On the basis of the above embodiments, computing module is specifically used in the present embodiment: in the contemporary population
Any individual can by the earliest of resource needed for the present arrangement process if process headed by the process of the individual present arrangement
Use the time as at the beginning of the present arrangement process；If the process of the individual present arrangement is non-first process, by institute
After the Late Finish of all precedence activities for stating present arrangement process, resource needed for the present arrangement process it is earliest
At the beginning of pot life is as the present arrangement process；According to the Late Finish of all process steps in the individual, meter
Calculate the fitness value of the individual.
On the basis of the above embodiments, generation module is also used in the present embodiment: if being unsatisfactory for preset termination condition,
Calculate all individual in the maximum value in the next-generation population in the fitness value of all individuals and the contemporary population fit
Answer the maximum value in angle value；If the maximum value in the next generation population in the fitness value of all individuals is greater than the present age kind
Maximum value in group in the fitness value of all individuals, then by the fitness value of each individual in next-generation heredity, and/or
The mutation probability of the elite group and common group are adjusted.
On the basis of the above embodiments, generation module is further used in the present embodiment: increasing default regulatory factor
Value；By the fitness value of each individual multiplied by the default regulatory factor after the increase greater than 1 in next-generation heredity.
On the basis of the various embodiments described above, generation module is also used in the present embodiment: if institute in the next generation population
There is the maximum value in the fitness value of individual no more than the maximum value in the fitness value of all individuals in the contemporary population, then
Judge whether change close to the corresponding maximum value of population of default algebra before the next-generation population；If remaining unchanged,
Increase the number of the random individual in next-generation heredity.
On the basis of the above embodiments, generation module is further used in the present embodiment: by the institute in the elite group
There is individual to carry out crossover operation, is selected from the individual after elite flock-mate fork according to the mutation probability of the elite group multiple
Individual carries out mutation operation, obtains first child group；All individuals in the common group are subjected to crossover operation, according to described
The mutation probability of common group selects multiple individuals to carry out mutation operation from the individual after the common flock-mate fork, obtains the second son
Dai Qun.
The present embodiment provides a kind of electronic equipment, Fig. 3 is electronic equipment overall structure provided in an embodiment of the present invention signal
Figure, which includes: at least one processor 301, at least one processor 302 and bus 303；Wherein,
Processor 301 and memory 302 pass through bus 303 and complete mutual communication；
Memory 302 is stored with the program instruction that can be executed by processor 301, and the instruction of processor caller is able to carry out
Method provided by above-mentioned each method embodiment, for example, calculate the fitness value of each individual in contemporary population；By all
Body is arranged according to the sequence of fitness value from big to small, and the individual of preceding first predetermined number is selected to retain group as elite,
The individual of preceding second predetermined number is as elite group；Roulette operation is carried out to contemporary population, selects multiple individuals as first
Common subgroup, using the individual obtained by random fashion as the second common subgroup, by the first common subgroup and the second common son
Group, which is combined, obtains common group；Cross and variation operation is carried out to elite group and common group respectively and obtains first child group and second
Elite is retained group, first child group and second filial generation group and is combined as next-generation population, terminated until meeting by filial generation group
Condition regard the highest individual of fitness value in last generation population as optimal Operation Sequencing result.
The present embodiment provides a kind of non-transient computer readable storage medium, non-transient computer readable storage medium storages
Computer instruction, computer instruction make computer execute method provided by above-mentioned each method embodiment, for example, calculating is worked as
For the fitness value of individual each in population；All individuals are arranged according to the sequence of fitness value from big to small, before selection
The individual of first predetermined number retains group as elite, and the individual of preceding second predetermined number is as elite group；To contemporary population into
The operation of row roulette selects multiple individuals and is used as the first common subgroup, and the individual obtained by random fashion is general as second
Logical subgroup, the first common subgroup and the second common subgroup are combined and obtain common group；To elite group and common group respectively into
The operation of row cross and variation obtains first child group and second filial generation group, and elite is retained group, first child group and second filial generation group
It is combined as next-generation population, until meeting termination condition, the highest individual of fitness value in last generation population is made
For optimal Operation Sequencing result.
Those of ordinary skill in the art will appreciate that: realize that all or part of the steps of above method embodiment can pass through
The relevant hardware of program instruction is completed, and program above-mentioned can be stored in a computer readable storage medium, the program
When being executed, step including the steps of the foregoing method embodiments is executed；And storage medium above-mentioned includes: ROM, RAM, magnetic disk or light
The various media that can store program code such as disk.
The apparatus embodiments described above are merely exemplary, wherein described, unit can as illustrated by the separation member
It is physically separated with being or may not be, component shown as a unit may or may not be physics list
Member, it can it is in one place, or may be distributed over multiple network units.It can be selected according to the actual needs
In some or all of the modules achieve the purpose of the solution of this embodiment.Those of ordinary skill in the art are not paying creativeness
Labour in the case where, it can understand and implement.
Through the above description of the embodiments, those skilled in the art can be understood that each embodiment can
It realizes by means of software and necessary general hardware platform, naturally it is also possible to pass through hardware.Based on this understanding, on
Stating technical solution, substantially the part that contributes to existing technology can be embodied in the form of software products in other words, should
Computer software product may be stored in a computer readable storage medium, such as ROM/RAM, magnetic disk, CD, including several fingers
It enables and using so that a computer equipment (can be personal computer, server or the network equipment etc.) executes each implementation
Method described in certain parts of example or embodiment.
Finally, it should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
Present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: it still may be used
To modify the technical solutions described in the foregoing embodiments or equivalent replacement of some of the technical features；
And these are modified or replaceed, technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution spirit and
Range.
Claims (10)
1. a kind of working procedure compositor method characterized by comprising
Calculate the fitness value of each individual in contemporary population；Wherein, the individual is the Operation Sequencing of destination item as a result, each institute
State that individual corresponding destination item deadline is more early, and corresponding fitness value is bigger；
All individuals are arranged according to fitness value by sequence from big to small, of preceding first predetermined number is selected
Body retains group as elite, and the individual of preceding second predetermined number is as elite group；
Roulette operation is carried out according to the corresponding fitness value of individual each in the contemporary population, is selected from the contemporary population
Multiple individuals are used as the first common subgroup, using the multiple random individuals obtained by way of generating at random as the second common son
Described first common subgroup and the second common subgroup are combined and obtain common group by group；
The elite group is intersected and mutation operation obtains first child group, the common group is intersected and the behaviour that makes a variation
Make to obtain second filial generation group, the elite is retained into group, the first child group and the second filial generation group and is combined, is obtained
Next-generation population regard the highest individual of fitness value in last generation population as optimal work until meeting preset termination condition
Sequence ranking results.
2. the method according to claim 1, wherein the step of calculating the fitness value of each individual in contemporary population
Before further include:
The total number of all process steps is as code length in destination item, using the number of each process as gene elements value into
Row coding；Wherein, position of any process in coding result is located at after the precedence activities of the process；
Initial population is generated according to coding result, using the initial population as contemporary population.
3. according to the method described in claim 2, it is characterized in that, the step of calculating the fitness value of each individual in contemporary population
It specifically includes:
It, will be described current if process headed by the process of the individual present arrangement for any individual in the contemporary population
At the beginning of the earliest available time of resource needed for arranging process is as the present arrangement process；
If the process of the individual present arrangement is non-first process, the latest by all precedence activities of the present arrangement process
After deadline, beginning of the earliest available time of resource needed for the present arrangement process as the present arrangement process
Time；
According to the Late Finish of all process steps in the individual, the fitness value of the individual is calculated.
4. the method according to claim 1, wherein the elite is retained group, the first child group and institute
It states second filial generation group to be combined, next-generation population is obtained, until the step of meeting preset termination condition further include:
If being unsatisfactory for preset termination condition, calculate maximum value in the next-generation population in the fitness value of all individuals with
Maximum value in the present age population in the fitness value of all individuals；
If the maximum value in the next generation population in the fitness value of all individuals is greater than all individuals in the contemporary population
Fitness value in maximum value, then by the fitness value calculation mode of each individual and/or described in next-generation heredity
The mutation probability of elite group and common group are adjusted.
5. according to the method described in claim 4, it is characterized in that, by the fitness value of each individual in next-generation heredity
The step of calculation is adjusted specifically includes:
Increase the value of default regulatory factor；
By the fitness value of each individual multiplied by the default regulatory factor after the increase greater than 1 in next-generation heredity.
6. according to the method described in claim 4, it is characterized in that, if it is described the next generation population in all individuals fitness value
In maximum value be greater than the maximum value in the contemporary population in the fitness value of all individuals, then it is next-generation it is hereditary in will be each
The step of fitness value of the individual and/or the mutation probability of the elite group and common group are adjusted further include:
If the maximum value in the next generation population in the fitness value of all individuals is no more than all in the contemporary population
Maximum value in the fitness value of body then judges in the corresponding maximum of population close to default algebra before the next-generation population
Whether value changes；
If remaining unchanged, increase the number of the random individual in next-generation heredity.
7. -6 any method according to claim 1, which is characterized in that intersect to the elite group and mutation operation
Obtain first child group, the common group is intersected and mutation operation acquisition second filial generation group the step of specifically include:
All individuals in the elite group are subjected to crossover operations, according to the mutation probability of the elite group from the elite group
It selects multiple individuals to carry out mutation operation in individual after intersection, obtains first child group；
All individuals in the common group are subjected to crossover operations, according to the mutation probability of the common group from the common group
It selects multiple individuals to carry out mutation operation in individual after intersection, obtains second filial generation group.
8. a kind of working procedure compositor device characterized by comprising
Computing module, for calculating the fitness value of each individual in contemporary population；Wherein, the individual is the process of destination item
Ranking results, each individual corresponding destination item deadline is more early, and corresponding fitness value is bigger；
Selecting module selects preceding first for arranging all individuals according to the sequence of fitness value from big to small
The individual of predetermined number retains group as elite, and the individual of preceding second predetermined number is as elite group；
Composite module, for according to the corresponding fitness value progress roulette operation of individual each in the contemporary population, from described
Multiple individuals are selected in contemporary population is used as the first common subgroup, the multiple random individuals that will be obtained by way of generating at random
As the second common subgroup, the described first common subgroup and the second common subgroup are combined and obtain common group；
Generation module, for the elite group is intersected and mutation operation obtain first child group, to the common group into
Row intersects and mutation operation obtains second filial generation group, and the elite is retained group, the first child group and the second filial generation
Group is combined, and obtains next-generation population, until meeting preset termination condition, fitness value in last generation population is highest
Individual is used as optimal Operation Sequencing result.
9. a kind of electronic equipment characterized by comprising
At least one processor, at least one processor and bus；Wherein,
The processor and memory complete mutual communication by the bus；
The memory is stored with the program instruction that can be executed by the processor, and the processor calls described program to instruct energy
Enough methods executed as described in claim 1 to 7 is any.
10. a kind of non-transient computer readable storage medium, which is characterized in that the non-transient computer readable storage medium is deposited
Computer instruction is stored up, the computer instruction makes the computer execute the method as described in claim 1 to 7 is any.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910063401.4A CN109948828B (en) | 2019-01-23 | 2019-01-23 | Process sequencing optimization method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910063401.4A CN109948828B (en) | 2019-01-23 | 2019-01-23 | Process sequencing optimization method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109948828A true CN109948828A (en) | 2019-06-28 |
| CN109948828B CN109948828B (en) | 2021-06-11 |
Family
ID=67007968
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910063401.4A Active CN109948828B (en) | 2019-01-23 | 2019-01-23 | Process sequencing optimization method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109948828B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111160773A (en) * | 2019-12-30 | 2020-05-15 | 深圳市赛维网络科技有限公司 | Process scheduling method, device, equipment and storage medium |
| CN111210062A (en) * | 2019-12-31 | 2020-05-29 | 深圳金赋科技有限公司 | Intelligent workpiece scheduling method, equipment and medium based on genetic algorithm |
| CN112949010A (en) * | 2021-02-26 | 2021-06-11 | 中国联合网络通信集团有限公司 | Coverage optimization method and device |
| CN114418773A (en) * | 2022-03-30 | 2022-04-29 | 支付宝(杭州)信息技术有限公司 | Optimization method and device of strategy combination |
| WO2023173402A1 (en) * | 2022-03-15 | 2023-09-21 | 中国科学院深圳先进技术研究院 | Feature selection method, feature selection apparatus, and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101901425A (en) * | 2010-07-15 | 2010-12-01 | 华中科技大学 | Flexible job shop scheduling method based on multi-species coevolution |
| CN104616062A (en) * | 2015-02-15 | 2015-05-13 | 河海大学 | Nonlinear system recognizing method based on multi-target genetic programming |
-
2019
- 2019-01-23 CN CN201910063401.4A patent/CN109948828B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101901425A (en) * | 2010-07-15 | 2010-12-01 | 华中科技大学 | Flexible job shop scheduling method based on multi-species coevolution |
| CN104616062A (en) * | 2015-02-15 | 2015-05-13 | 河海大学 | Nonlinear system recognizing method based on multi-target genetic programming |
Non-Patent Citations (1)
| Title |
|---|
| 刘全等: "双精英协同进化遗传算法", 《软件学报》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111160773A (en) * | 2019-12-30 | 2020-05-15 | 深圳市赛维网络科技有限公司 | Process scheduling method, device, equipment and storage medium |
| CN111210062A (en) * | 2019-12-31 | 2020-05-29 | 深圳金赋科技有限公司 | Intelligent workpiece scheduling method, equipment and medium based on genetic algorithm |
| CN112949010A (en) * | 2021-02-26 | 2021-06-11 | 中国联合网络通信集团有限公司 | Coverage optimization method and device |
| CN112949010B (en) * | 2021-02-26 | 2023-06-09 | 中国联合网络通信集团有限公司 | Coverage optimization method and device |
| WO2023173402A1 (en) * | 2022-03-15 | 2023-09-21 | 中国科学院深圳先进技术研究院 | Feature selection method, feature selection apparatus, and storage medium |
| CN114418773A (en) * | 2022-03-30 | 2022-04-29 | 支付宝(杭州)信息技术有限公司 | Optimization method and device of strategy combination |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109948828B (en) | 2021-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109948828A (en) | Working procedure compositor method and device | |
| CN110851272B (en) | Cloud task scheduling method based on phagocytic particle swarm genetic hybrid algorithm | |
| US20210373888A1 (en) | Multi-objective optimization method and system for master production plan of casting parallel workshops | |
| Zhu et al. | An efficient evolutionary grey wolf optimizer for multi-objective flexible job shop scheduling problem with hierarchical job precedence constraints | |
| CN107168267B (en) | Based on the production scheduled production method and system for improving population and heuristic strategies | |
| CN108846472A (en) | A kind of optimization method of Adaptive Genetic Particle Swarm Mixed Algorithm | |
| CN107783831A (en) | A kind of method for scheduling task and device | |
| CN111325443B (en) | Method for solving flexible job shop scheduling by improved genetic algorithm based on catastrophe mechanism | |
| CN109636011A (en) | A kind of multishift operation plan scheduling method based on improved change neighborhood genetic algorithm | |
| CN109255513A (en) | A kind of power telecom network scene work order dispatching method | |
| CN103679388B (en) | Production scheduling method and production scheduling system | |
| CN107862404B (en) | Manufacturing service supply chain optimization method based on service correlation | |
| CN111813500B (en) | Multi-target cloud workflow scheduling method and device | |
| CN116090788B (en) | Batch scheduling planning method for flexible assembly job shop | |
| CN108681789A (en) | A kind of cloud manufacturing service optimization method | |
| CN110059405A (en) | High-quality Steiner minimum tree construction method with differential evolution under X structure | |
| CN111242446A (en) | Workshop scheduling method based on GA-TS hybrid algorithm | |
| CN111414961A (en) | Task parallel-based fine-grained distributed deep forest training method | |
| CN106487889B (en) | A kind of task towards cloud data center and data aggregate dispositions method | |
| CN114240091A (en) | Flexible job shop scheduling method based on self-adaptive layering strategy | |
| CN112631612B (en) | Optimization method for kubernetes cloud platform configuration based on genetic algorithm | |
| CN115689116A (en) | Resource-construction period-cost comprehensive optimization method based on improved multi-target particle swarm | |
| CN112446484A (en) | Multitask training cluster intelligent network system and cluster network optimization method | |
| CN110413860A (en) | The multiple-objection optimization selection method of mysorethorn example under a kind of cloudy environment based on NSGA-II | |
| CN111934901B (en) | Topology control method and system of unmanned platform information-aware network |
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 |