# US 2024/0005174 A1 · System and method for optimized generation evaluation, selection of solutions using improved distributed evolutionary computing

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0005174 A1
- Document ID: US20240005174A1
- Status: Published application
- Kind: A1
- Application number: 17/855,914
- Filed: 2022-07-01
- Published: 2024-01-04
- Earliest claimed: 2022-07-01
- Assignees: Cognizant Technology Solutions U.S. Corporation
- Applicants: Cognizant Technology Solutions US Corp.
- Inventors: Hormoz Shahrzad; Risto Miikkulainen
- Web page: https://patentgrep.com/patent/US20240005174A1

## CPC

- G06N 3/126: Evolutionary algorithms, e.g. genetic algorithms or genetic programming
- G06F 21/606: {by securing the transmission between two devices or processes}
- G06N 3/086: using evolutionary algorithms, e.g. genetic algorithms or genetic programming
- H04L 63/02: {for separating internal from external traffic, e.g. firewalls}
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A system and method for optimized generation, evaluation and selection of solutions associated with problems of different domain types using distributed evolutionary computing is provided. A request corresponding to problem associated with domain type is sent. A seed population corresponding to the request is generated. The generated seed population corresponding to the request is evaluated based on privately hosted datasets. The evaluated seed population is associated with one or more metrics to generate metric dataset. A best candidate solution associated with the metrics dataset is selected by recursively processing the metrics dataset associated with the evaluated seed population until a termination condition is reached. In the event the termination condition is not reached a next population is generated based on the best candidate solution and evaluated based on the privately hosted datasets. The best candidate solution is selected based on the next population until the termination condition is reached.

## Claims

### Claim 1

A system for optimized generation, evaluation and selection of solutions associated with problems of different domain types using distributed evolutionary computing, the system comprising:
sending a request corresponding to a problem associated with a domain type by a first processor to a second processor;
evaluating, by the first processor, a generated seed population corresponding to the request based on privately hosted datasets, wherein the seed population represents candidate solutions corresponding to the problem associated with the different domain types;
associating, by the first processor, the evaluated seed population with one or more metrics to generate a metric dataset for transmission to the second processor, wherein the metric dataset represents an irreversible masked evaluated seed population;
evaluating, by the first processor, a generated next population received from the second processor based on the privately hosted datasets; and
transmitting the next population to the second processor for selecting a best candidate solution until a termination condition is reached.

### Claim 2 (depends on 1)

The system as claimed in claim 1, wherein the first processor evaluates the seed population in a distributed and a private manner using privately hosted datasets.

### Claim 3 (depends on 1)

The system as claimed in claim 1, wherein the first processor evaluates the seed population by processing the seed population in independently distributed nodes based on the privately hosted dataset.

### Claim 4 (depends on 1)

The system as claimed in claim 1, wherein the first processor associates the evaluated seed population with one or more metrics based on function values of the parameters of the evaluated seed population to generate the metrics dataset.

### Claim 5 (depends on 1)

The system as claimed in claim 1, wherein the first processor evaluates the next population based on privately hosted datasets, and wherein the first processor is protected by a firewall.

### Claim 6

A system for optimized generation, evaluation and selection of solution associated with problems of different domain types using distributed evolutionary computing, the system comprises:
receiving, by a second processor, a request corresponding to a problem associated with a domain type from a first processor;
generating, by the second processor, a seed population corresponding to the request, wherein the seed population represents candidate solutions corresponding to the problem associated with the domain type;
receiving, by the second processor, a metric dataset associated with an evaluated seed population from the first processor, wherein the metrics dataset represents an irreversible masked evaluated seed population; and
selecting, by the second processor, a best candidate solution by recursively processing the metrics dataset until a termination condition is reached, wherein in the event the termination condition is not reached then a next population is generated by the second processor based on the best candidate solution.

### Claim 7 (depends on 6)

The system as claimed in claim 6, wherein the second processor receives function values of parameters associated with the evaluated seed population in the form of the metrics dataset.

### Claim 8 (depends on 6)

The system as claimed in claim 6, wherein the second processor selects the best candidate solution associated with the metrics dataset based on one or more selection techniques comprising a tournament selection technique, a ranking selection technique and a multi-objective selection technique.

### Claim 9 (depends on 6)

The system as claimed in claim 6, wherein the termination condition represents a convergence criterion associated with the dataset comprising a pre-determined criterion associated with the metrics dataset, and wherein the pre-determined criteria include a process-related criterion, a result-related criterion, a number of population generations related criterion and a time-related criterion.

### Claim 10 (depends on 6)

The system as claimed in claim 6, wherein the second processor stores the metrics dataset associated with the best candidate solution in a storage location in the event the termination condition is met, and wherein the metrics dataset is retrievable as an output dataset.

### Claim 11 (depends on 6)

The system as claimed in claim 6, wherein the system is a self-learning unit that employs machine learning techniques for processing the metrics dataset to select the best candidate solution and generating the next population.

### Claim 12 (depends on 6)

The system as claimed in claim 6, wherein the next population is generated by applying a mutation process and a cross-over process on the best candidate solution based on existing datasets.

### Claim 13 (depends on 6)

The system as claimed in claim 6, wherein the second processor transmits the next population to the first processor for evaluation of the next population based on privately hosted datasets and subsequent selection of the best candidate solution by the second processor until the termination condition is reached.

### Claim 14

A method for optimized generation, evaluation and selection of solutions associated with problems of different domain types using distributed evolutionary computing, the method comprises:
sending a request corresponding to a problem associated with a domain type;
generating a seed population corresponding to the request, wherein the seed population represents candidate solutions corresponding to the problem associated with the different domain types;
evaluating the generated seed population corresponding to the request based on privately hosted datasets;
associating the evaluated seed population with one or more metrics to generate a metric dataset, wherein the metric dataset represents an irreversible masked evaluated seed population;
selecting a best candidate solution associated with the metrics dataset by recursively processing the metrics dataset associated with the evaluated seed population until a termination condition is reached, wherein in the event the termination condition is not reached a next population is generated based on the best candidate solution;
evaluating the generated next population based on the privately hosted datasets; and
selecting the best candidate solution based on the next population until the termination condition is reached.

### Claim 15 (depends on 14)

The method as claimed in claim 14, wherein the metrics dataset associated with the evaluated seed population masks the evaluated seed population by processing function values of the parameters of the evaluated seed population.

### Claim 16 (depends on 14)

The method as claimed in claim 14, wherein the seed population is evaluated in a distributed and a private manner using privately hosted datasets.

### Claim 17 (depends on 14)

The method as claimed in claim 14, wherein the best candidate solution is selected based on one or more of selection techniques comprising a tournament selection technique, a ranking selection technique and a multi-objective selection technique.

### Claim 18 (depends on 14)

The method as claimed in claim 14, wherein the termination condition represents a convergence criterion associated with the dataset comprising a pre-determined criterion associated with the metrics dataset and wherein the pre-determined criteria include a process-related criterion, a result-related criterion, a number of population generations related criterion and a time-related criterion.

### Claim 19 (depends on 14)

The method as claimed in claim 14, wherein the metrics dataset associated with the best candidate solution is stored in a storage location in the event the termination condition is met, and wherein the metrics dataset is retrievable as an output dataset.

### Claim 20 (depends on 14)

The method as claimed in claim 14, wherein the next population is evaluated based on privately hosted datasets.

### Claim 21 (depends on 14)

The method as claimed in claim 14, wherein the next population is generated by applying a mutation process and a cross-over process on the best candidate solution based on existing datasets.

### Claim 22

A computer program product comprising:
a non-transitory computer-readable medium having computer program code stored thereon, the computer-readable program code comprising instructions that, when executed by a processor, causes the processor to:
send a request corresponding to a problem associated with a domain type;
generate a seed population corresponding to the request, wherein the seed population represents candidate solutions corresponding to the problem associated with the different domain types;
evaluate the generated seed population corresponding to the request based on privately hosted datasets;
associate the evaluated seed population with one or more metrics to generate a metric dataset, wherein the metric dataset represents an irreversible masked evaluated seed population;
select a best candidate solution associated with the metrics dataset by recursively processing the metrics dataset associated with the evaluated seed population until a termination condition is reached, wherein in the event the termination condition is not reached a next population is generated based on the best candidate solution;
evaluate the generated next population based on the privately hosted datasets; and
select the best candidate solution based on the next population until the termination condition is reached.
