It is determined that a population of candidate solutions for an optimization problem has prematurely converged during a metaheuristic optimization run. A cause for premature convergence of the population is determined based, at least in part, on an analysis of the metaheuristic optimization run. A
It is determined that a population of candidate solutions for an optimization problem has prematurely converged during a metaheuristic optimization run. A cause for premature convergence of the population is determined based, at least in part, on an analysis of the metaheuristic optimization run. A first cataclysm strategy of a plurality of cataclysm strategies is selected based, at least in part, on one of the cause of the premature convergence and a history of the metaheuristic optimization run. A cataclysm is simulated based, at least in part, on the first cataclysm strategy.
대표청구항▼
1. A method comprising: determining that a population of candidate solutions for an optimization problem has prematurely converged during a metaheuristic optimization run;determining a cause for premature convergence of the population based, at least in part, on an analysis of the metaheuristic opti
1. A method comprising: determining that a population of candidate solutions for an optimization problem has prematurely converged during a metaheuristic optimization run;determining a cause for premature convergence of the population based, at least in part, on an analysis of the metaheuristic optimization run;selecting a first cataclysm strategy of a plurality of different cataclysm strategies based, at least in part, on one of the cause of the premature convergence and a history of the metaheuristic optimization run; andsimulating a cataclysm based, at least in part, on the first cataclysm strategy. 2. The method of claim 1 further comprising: determining that the first cataclysm strategy should be adjusted;responsive to said determining that the first cataclysm strategy should be adjusted, determining a set of parameters for the first cataclysm strategy; andadjusting the first cataclysm strategy in accordance with the set of parameters for the first cataclysm strategy;wherein said simulating the cataclysm based, at least in part, on the first cataclysm strategy comprises simulating the cataclysm in accordance with the adjusted first cataclysm strategy. 3. The method of claim 2, wherein said determining that the first cataclysm strategy should be adjusted comprises determining that a number of generations between convergences is below a threshold. 4. The method of claim 2, wherein the first cataclysm strategy is a quarantining strategy,wherein said adjusting the first cataclysm strategy in accordance with the set of parameters for the first cataclysm strategy comprises adjusting a length of a quarantining period. 5. The method of claim 2, wherein the first cataclysm strategy is a migration strategy,wherein the migration strategy comprises inserting, into the population, one or more foreign individuals from a first set of one or more foreign populations,wherein said adjusting the first cataclysm strategy in accordance with the set of parameters for the first cataclysm strategy comprises at least one of: adjusting a length of a quarantining period;adjusting a length of a migration delay, wherein one or more foreign individuals are not inserted into the population until after a number of generations indicated by the length of the migration delay; andselecting one or more foreign individuals from a second set of one or more foreign populations. 6. The method of claim 2, wherein the first cataclysm strategy is a seeding strategy,wherein the seeding strategy comprises inserting one or more seeds into the population,wherein said adjusting the first cataclysm strategy in accordance with the set of parameters for the first cataclysm strategy comprises at least one of: adjusting a length of a quarantining period;adjusting a number of seeds inserted into the population;adjusting when seeds are inserted into the population; andadjusting which seeds are inserted into the population. 7. The method of claim 2, wherein the first cataclysm strategy is a biasing strategy,wherein said adjusting the first cataclysm strategy in accordance with the set of parameters for the first cataclysm strategy comprises changing a bias value from a set of bias values to another value. 8. The method of claim 1 further comprising: determining that a previously used cataclysm strategy should not be reused; andwherein said selecting the first cataclysm strategy of the plurality of cataclysm strategies comprises selecting the first cataclysm strategy of the plurality of cataclysm strategies because the first cataclysm strategy is different than the previously used cataclysm strategy. 9. The method of claim 1, wherein the history of the metaheuristic optimization run comprises at least one of a cataclysm count and a convergence rate, wherein the convergence rate is indicated by at least one of a number of generations between convergences and a number of convergences per a number of generations. 10. The method of claim 9, wherein said selecting the first cataclysm strategy of the plurality of cataclysm strategies based, at least in part, on one of the cause of the premature convergence and the history of the metaheuristic optimization run comprises: determining that the convergence rate is below a threshold;wherein said selecting the first cataclysm strategy of the plurality of cataclysm strategies is responsive to said determining that the convergence rate is below the threshold. 11. The method of claim 9, wherein said selecting the first cataclysm strategy of the plurality of cataclysm strategies based, at least in part, on one of the cause of the premature convergence and the history of the metaheuristic optimization run comprises: determining that the convergence rate is above a threshold; andwherein said selecting the first cataclysm strategy of the plurality of cataclysm strategies is responsive to said determining that the convergence rate is above the threshold. 12. The method of claim 1, wherein the analysis of the metaheuristic optimization run comprises at least one of: determining that one or more candidate solutions in the population of candidate solutions is associated with one or more tokens;analyzing the history of the metaheuristic optimization run; andanalyzing a set of genes associated with each of one or more candidate solutions in the population of candidate solutions. 13. The method of claim 1, wherein the different cataclysm strategies comprise a quarantining strategy, a migration strategy, a seeding strategy, and a biasing strategy. 14. The method of claim 1, wherein the first cataclysm strategy of the plurality of different cataclysm strategies comprises a first set of parameters, and wherein a second cataclysm strategy of the plurality of different cataclysm strategies comprises a second set of parameters different from the first set of parameters. 15. The method of claim 14, wherein the first set of parameters and the second set of parameters include different member subsets from a set of parameters consisting of a mass extinction parameter, a quarantining parameter, a migration parameter, a seeding parameter, and a biasing parameter. 16. The method of claim 14, wherein the selecting the first cataclysm strategy comprises: determining, based on the history of the metaheuristic optimization run, that the second cataclysm strategy was used to perform one or more prior cataclysms using the second set of parameters; andselecting the first cataclysm strategy in place of the second cataclysm strategy in response to determining that modifying values for the second set of parameters would be less likely to provide fitter candidate solutions than using the first set of parameters from the first cataclysm strategy. 17. The method of claim 14, wherein the second set of parameters comprises a first parameter that randomly mutates one or more of the population of candidate solutions, and wherein the selecting the first cataclysm strategy comprises determining that random mutations of the one or more of the population of candidate solutions would be less likely to provide fitter candidate solutions than using a second cataclysm parameter from the first cataclysm strategy, wherein the second cataclysm parameter comprises one or more of a quarantining parameter, a migration parameter, a seeding parameter, and a biasing parameter.
Carter, Frederick H.; Langley, Steven C.; Wallace, Mark T.; Meredith, Jeffrey T.; Butterworth, Paul E., Apparatus and method for web service message correlation.
Koza, John R.; Bennett, III, Forrest H; Andre, David; Keane, Martin A., Genetic programming problem solver with automatically defined stores loops and recursions.
Vail ; III William Banning, Method and apparatus to synthesize DNA and DNA-like molecular structures by applying electric fields to gaseous mixtures of chemical reactants containing template particulate matter.
Ulyanov,Serguei; Rizzotto,Gianguido; Kurawaki,Ichiro; Panfilov,Serguei; Ghisi,Fabio; Amato,Paolo; Porto,Massimo, Method and hardware architecture for controlling a process or for processing data based on quantum soft computing.
Bell, Jr., Robert H.; Capasso, Thomas Michael; Guthrie, Guy Lynn; Shen, Hugh; Stuecheli, Jeffrey Adam, Method and system for specualtively sending processor-issued store operations to a store queue with full signal asserted.
Bell, Jr., Robert H.; Capps, Jr., Louis Bennie; Cook, Thomas Edward; Daves, Glenn G.; Newhart, Ronald Edward; Paolini, Michael A.; Shapiro, Michael Jay, Multicore processor and method of use that adapts core functions based on workload execution.
Koza John R. (25372 La Rena La. Los Altos CA 94022) Rice James P. (Redwood City CA), Non-linear genetic process for data encoding and for solving problems using automatically defined functions.
Bell, Jr., Robert H.; Capps, Jr., Louis Bennie; Paolini, Michael A.; Shapiro, Michael Jay, Optimizing execution of single-threaded programs on a multiprocessor managed by compilation.
Koza John R. ; Andre David ; Tackett Walter Alden, Simultaneous evolution of the architecture of a multi-part program to solve a problem using architecture altering opera.
Koza John R. ; Andre David ; Tackett Walter Alden, Simultaneous evolution of the architecture of a multi-part program while solving a problem using architecture altering operations.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.