Seeding and healing a Genetic Algorithm to mitigate irreducible complexity
| DWPI Title: Method for designing physical system using genetic algorithm to mitigate irreducible complexity, involves building data structures necessary to build, heal, and verify dependency chains, where building data structures are created by translating each dependency into list of ANDs and ORs |
| Abstract: A system and method for designing a physical system using a genetic algorithm includes building a plurality of data structures necessary to build, heal, and verify a plurality of dependency chains; ensuring that multiple dependencies in a respective one of the plurality of dependency chains are represented correctly; removing any dependencies that will be trivially satisfied at random; in response to determining that one or more dependencies is consistent with another dependency, considering one or more combinations of dependencies; and building configurations that satisfy the dependencies and combinations of dependencies by associating the dependencies and combinations of dependencies with selected technology options and recursively specifying and/or revising additional technology options that are consistent with the dependencies or combinations of dependencies, until a configuration is fully specified. |
| Use: Method for designing a physical system using a genetic algorithm to mitigate irreducible complexity. |
| Advantage: The method allows a genetic algorithm (GA) to find adequate solutions to problems with dependencies by healing genetic strands as the solution technique progresses. The method provides measures to reduce biasing of the GA population, where the end result is the capability to solve combinatorial optimization problems more accurately. The method allows a GA to find adequate solutions to problems with dependencies by healing genetic strands as the solution technique progresses. The healing subroutine can be used on any unviable solution at any time during the execution of the GA, and adds more opportunity to improve genetic diversity and discover beneficial solutions. |
| Novelty: The method involves building data structures necessary to build, heal, and verify dependency chains, where the building data structures are created by translating each dependency into a list of ANDs and ORs. Judgment is made to check that multiple dependencies in a respective one of multiple dependency chains are represented correctly by removing subsumed list elements and non-viable list elements. The dependencies that are satisfied below a predetermined level at random are removed by calculating the probability of list elements randomly occurring in a randomly produced initial population given non-seeded population size. The configurations that satisfy the dependencies and combinations of dependencies are built. |
| Filed: 10/9/2019 |
| Application Number: US16596866A |
| Tech ID: SD 13141.0 |
| This invention was made with Government support under Contract No. DE-NA0003525 awarded by the United States Department of Energy/National Nuclear Security Administration. The Government has certain rights in the invention. |
| Data from Derwent World Patents Index, provided by Clarivate All rights reserved. Republication or redistribution of Clarivate content, including by framing or similar means, is prohibited without the prior written consent of Clarivate. Clarivate and its logo, as well as all other trademarks used herein are trademarks of their respective owners and used under license. |