OPTIMIZED SEEDING OF EVOLUTIONARY ALGORITHM BASED SIMULATIONS

摘要

Seed candidate solutions can be inserted into the later generations of the population of an optimization problem during an evolutionary algorithm based simulation. Seed candidate solutions can be determined in response to an evolutionary algorithm based simulator receiving a problem description of an optimization problem. The seed candidate solutions can be sorted according to the seed candidate solutions' fitness. The simulator can start an evolutionary algorithm based simulation with a randomly generated initial population. The simulator can detect a condition for inserting seed candidate solutions into the population. The simulator can then insert the first seed candidate into the current population that is generated by the simulator in accordance with the evolutionary algorithm. A solution to the optimization problem can be determined based on successive generation of candidate solutions and insertion of additional seed candidate solutions in subsequent generations of the population.