Patent ID: 8498952

Claim:
A method, comprising: receiving, by a master processor, a respective plurality of objective function values for each chromosome data structure of a population of chromosome data structures, wherein the respective plurality of objective function values are obtained based upon an evaluation of each chromosome data structure by a respective plurality of objective functions; mapping, by the master processor for each chromosome data structure, the respective objective function values to respective epsilon values, wherein the respective epsilon values define a respective address associated with the plurality of objective functions; performing, by the master processor, non-domination sorting of the population of chromosome data structures to generate a reduced population of chromosome data structures based upon an evaluation of the respective plurality of objective function values; and performing, by the master processor, epsilon non-dominated sorting according to an optimization of the plurality of objective functions and the defined respective addresses to identify an elite set of addresses, wherein the prior steps are performed for a current generation, wherein the elite set of addresses are compared to a prior elite set of addresses for a predetermined number of prior generations to determine one or more variance values, wherein the one or more variance values are utilized to determine whether a current job of an evolutionary algorithm is to be halted.