Systems and methods for parameter optimization

1. A computer-implemented method for data configuration of a data set for use in a machine learning system of a supply chain system, the method comprising the steps of:

defining (i) one or more objectives and (ii) one or more supply chain parameters for evaluating each of the one or more objectives;

generating randomly an initial set of parameters to produce an initial configuration of the data set, wherein generating the initial set of parameters comprises:

 generating a tree structure of the one or more supply chain parameters, the tree structure comprising a plurality of leaf nodes and one or more node levels; and

generating an initial population of trees;

evaluating, a fitness function of each of the one or more objectives at each of the plurality of leaf nodes of the population of trees;

obtaining an initial Pareto Front comprising the leaf nodes that are non-dominated by other leaf nodes;

applying recursively a genetic algorithm to each of the leaf nodes that form the initial Pareto Front, thereby generating new sets of leaf nodes forming one or more hybrid Pareto fronts, until the initial Pareto Front converges with a final Pareto Front forming a converged Pareto Front;

generating recommended configurations for the data set based on the leaf nodes on the converged Pareto Front, wherein the leaf nodes on the converged Pareto Front represent the objectives associated with the supply chain parameters;

selecting one or more of the recommended configurations and configuring the data set using the one or more recommended configurations for use in the machine learning system of the supply chain system; and

operating the machine learning system of the supply chain system based on the configured data set.

2. The method of claim 1 , wherein when applying the genetic algorithm recursively, the method further comprises:

calculating, a plurality of crowding distances of the leaf nodes and a distance of each parent node; and

using the plurality of crowding distances and the distances of each parent node to determining pairings at each node level.

3. The method of claim 1 , wherein generation of each hybrid Pareto front comprises:

generating a first converged Pareto front by application of the genetic algorithm to a first set of leaf nodes; and

generating a second converged Pareto front by application of the genetic algorithm to a first set of parental nodes.

4. The method of claim 1 , wherein when applying the genetic algorithm, the method further comprises:

calculating a plurality of crowding distances of the plurality of leaf nodes; and

using the plurality of crowding distances to determining pairings of the plurality of leaf nodes.

5. The method of claim 1 , wherein the genetic algorithm is a Non-dominated Sorting Genetic Algorithm (NSGA-II).

6. A system for data configuration of a data set for use in a machine learning system of a supply chain system, the system comprising:

a processor; and

a memory storing instructions that, when executed by the processor, configure the system to:

define (i) one or more objectives and (ii) one or more supply chain parameters for evaluating each of the one or more objectives;

generate randomly an initial set of parameters to produce an initial configuration of the data set, wherein generating the initial set of parameters comprises:

 generating a tree structure of the one or more supply chain parameters, the tree structure comprising a plurality of leaf nodes and one or more node levels; and

generating an initial population of trees;

evaluate a fitness function of each of the one or more objectives at each of the plurality of leaf nodes of the population of trees;

obtain an initial Pareto Front comprising the leaf nodes that are non-dominated by other leaf nodes;

apply recursively, a genetic algorithm to each of the leaf nodes that form the initial Pareto Front, thereby generating new sets of leaf nodes forming one or more hybrid Pareto fronts, until the initial Pareto Front converges with a final Pareto Front forming a converged Pareto Front;

generate recommended configurations for the data set based on the leaf nodes on the converged Pareto Front, wherein the leaf nodes on the converged Pareto Front represent the objectives associated with the supply chain parameters;

select one or more of the recommended configurations and configuring the data set using the one or more recommended configurations for use in the machine learning system of the supply chain system; and,

operate the machine learning system of the supply chain system based on the configured data set.

7. The system of claim 6 , wherein when applying the genetic algorithm recursively, the system is further configured to:

calculate a plurality of crowding distances of the leaf nodes and a distance of each parent node; and

using the plurality of crowding distances and the distances of each parent node to determining pairings at each node level.

8. The system of claim 6 , wherein when generating each hybrid Pareto front, the system is further configured to:

generate a first converged Pareto front by application of the genetic algorithm to a first set of leaf nodes; and

generate a second converged Pareto front by application of the genetic algorithm to a first set of parental nodes.

9. The system of claim 6 , wherein when applying the genetic algorithm, the system is further configured to:

calculate a plurality of crowding distances of the plurality of leaf nodes; and

using the plurality of crowding distances to determining pairings of the plurality of leaf nodes.

10. The system of claim 6 , wherein the genetic algorithm is a Non-dominated Sorting Genetic Algorithm (NSGA-II).

11. A non-transitory computer-readable storage medium for data configuration of a data set for use in a machine learning system of a supply chain system, the computer-readable storage medium including instructions that when executed by a computer, cause the computer to:

define (i) one or more objectives and (ii) one or more supply chain parameters for evaluating each of the one or more objectives;

generate randomly an initial set of parameters to produce an initial configuration of the data set, wherein generating the initial set of parameters comprises:

generating a tree structure of the one or more supply chain parameters, the tree structure comprising a plurality of leaf nodes and one or more node levels; and

generating an initial population of trees;

evaluate a fitness function of each of the one or more objectives at each of the plurality of leaf nodes of the population of trees;

obtain an initial Pareto Front comprising the leaf nodes that are non-dominated by other leaf nodes;

apply recursively a genetic algorithm to each of the leaf nodes that form the initial Pareto Front, thereby generating new sets of leaf nodes forming one or more hybrid Pareto fronts, until the initial Pareto Front converges with a final Pareto Front forming a converged Pareto Front;

generate recommended configurations for the data set based on the leaf nodes on the converged Pareto Front, wherein the leaf nodes on the converged Pareto Front represent the objectives associated with the supply chain parameters;

select one or more of the recommended configurations and configuring the data set using the one or more recommended configurations for use in the machine learning system of the supply chain system; and

operate the machine learning system of the supply chain system based on the configured data set.

12. The computer-readable storage medium of claim 11 , wherein when applying the genetic algorithm recursively, the instructions that when executed by the computer, further cause the computer to:

calculate a plurality of crowding distances of the leaf nodes and a distance of each parent node; and

using the plurality of crowding distances and the distances of each parent node to determining pairings at each node level.

13. The computer-readable storage medium of claim 11 , wherein when generating each hybrid Pareto front, the instructions that when executed by the computer, further cause the computer to:

generate a first converged Pareto front by application of the genetic algorithm to a first set of leaf nodes; and

generate a second converged Pareto front by application of the genetic algorithm to a first set of parental nodes.

14. The computer-readable storage medium of claim 11 , wherein when applying the genetic algorithm, the instructions that when executed by the computer, further cause the computer to:

calculate a plurality of crowding distances of the plurality of leaf nodes; and

using the plurality of crowding distances to determining pairings of the plurality of leaf nodes.

15. The computer-readable storage medium of claim 11 , wherein the genetic algorithm is a Non-dominated Sorting Genetic Algorithm (NSGA-II).