elemento-alpha-tools 1.2.21 → 1.2.22

package/dist/optimization/population/Individual.d.ts

@@ -0,0 +1,9 @@
+export declare abstract class Individual<G, P, F> {
+    genotype: G;
+    fitness?: F;
+    constructor(genotype: G);
+    abstract grow(): P;
+}
+export interface IndividualBuilder<G, P, F> {
+    apply(genotype: G): Individual<G, P, F>;
+}

package/dist/optimization/population/Individual.js

@@ -0,0 +1,10 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Individual = void 0;
+class Individual {
+    constructor(genotype) {
+        this.genotype = genotype;
+    }
+}
+exports.Individual = Individual;
+//# sourceMappingURL=Individual.js.map

package/dist/optimization/population/Individual.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Individual.js","sourceRoot":"","sources":["../../../src/optimization/population/Individual.ts"],"names":[],"mappings":";;;AAAA,MAAsB,UAAU;IAI5B,YAAY,QAAW;QACnB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC7B,CAAC;CAGJ;AATD,gCASC"}

package/dist/optimization/population/PopulationGenerator.d.ts

@@ -0,0 +1,9 @@
+import { Individual, IndividualBuilder } from "./Individual";
+import { Space } from "../search/Space";
+export declare class PopulationGenerator<G, P, F> {
+    private space;
+    private builder;
+    constructor(generator: Space<G>, builder: IndividualBuilder<G, P, F>);
+    generate(count: number): Individual<G, P, F>[];
+    getSpace(): Space<G>;
+}

package/dist/optimization/population/PopulationGenerator.js

@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PopulationGenerator = void 0;
+class PopulationGenerator {
+    constructor(generator, builder) {
+        this.space = generator;
+        this.builder = builder;
+    }
+    generate(count) {
+        let genotypes = this.space.generateMany(count);
+        let population = [];
+        for (let genotype of genotypes)
+            population.push(this.builder.apply(genotype));
+        return population;
+    }
+    getSpace() {
+        return this.space;
+    }
+}
+exports.PopulationGenerator = PopulationGenerator;
+//# sourceMappingURL=PopulationGenerator.js.map

package/dist/optimization/population/PopulationGenerator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PopulationGenerator.js","sourceRoot":"","sources":["../../../src/optimization/population/PopulationGenerator.ts"],"names":[],"mappings":";;;AAGA,MAAa,mBAAmB;IAI5B,YAAY,SAAmB,EAAE,OAAmC;QAChE,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IAC3B,CAAC;IAEM,QAAQ,CAAC,KAAa;QACzB,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAI,UAAU,GAAG,EAAE,CAAC;QACpB,KAAK,IAAI,QAAQ,IAAI,SAAS;YAC1B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;QAClD,OAAO,UAAU,CAAC;IACtB,CAAC;IAEM,QAAQ;QACX,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;CACJ;AApBD,kDAoBC"}

package/dist/optimization/search/Goal.d.ts

@@ -0,0 +1,9 @@
+import { Order } from "../../sort/Order";
+export declare abstract class Goal<T, R> {
+    protected order: Order<R>;
+    constructor(order: Order<R>);
+    getOrder(): Order<R>;
+    abstract compute(x: T): R;
+    compare(x: T, y: T): number;
+    abstract init(): Promise<void>;
+}

package/dist/optimization/search/Goal.js

@@ -0,0 +1,16 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Goal = void 0;
+class Goal {
+    constructor(order) {
+        this.order = order;
+    }
+    getOrder() {
+        return this.order;
+    }
+    compare(x, y) {
+        return this.order.compare(this.compute(x), this.compute(y));
+    }
+}
+exports.Goal = Goal;
+//# sourceMappingURL=Goal.js.map

package/dist/optimization/search/Goal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Goal.js","sourceRoot":"","sources":["../../../src/optimization/search/Goal.ts"],"names":[],"mappings":";;;AAEA,MAAsB,IAAI;IAGtB,YAAY,KAAe;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACvB,CAAC;IAEM,QAAQ;QACX,OAAO,IAAI,CAAC,KAAK,CAAC;IACtB,CAAC;IAIM,OAAO,CAAC,CAAI,EAAE,CAAI;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;CAGJ;AAlBD,oBAkBC"}

package/dist/optimization/search/MultiObjectivePopulationSearch.d.ts

@@ -0,0 +1,20 @@
+import { PopulationGenerator } from "../population/PopulationGenerator";
+import { Individual } from "../population/Individual";
+import { Variation } from "./variate/Variation";
+import { Goal } from "./Goal";
+export interface Coupling<G, P, F> {
+    operIndex: number;
+    parents: Individual<G, P, F>[];
+}
+export declare abstract class MultiObjectivePopulationSearch<G, P, F, R> {
+    protected generator: PopulationGenerator<G, P, F[]>;
+    protected goals: Goal<Individual<G, P, F[]>, F>[];
+    protected opers: Variation<G>[];
+    constructor(generator: PopulationGenerator<G, P, F[]>, goals: Goal<Individual<G, P, F[]>, F>[], opers: Variation<G>[]);
+    apply(iters: number, popSize: number): Promise<Individual<G, P, F[]>[]>;
+    protected abstract evaluate(population: Individual<G, P, F[]>[]): Promise<void>;
+    protected abstract select(population: Individual<G, P, F[]>[]): Coupling<G, P, F[]>[];
+    protected abstract reproduce(couplings: Coupling<G, P, F[]>[]): Individual<G, P, F[]>[];
+    protected abstract replace(population: Individual<G, P, F[]>[], offspring: Individual<G, P, F[]>[], popSize: number): Individual<G, P, F[]>[];
+    protected abstract choose(population: Individual<G, P, F[]>[]): Individual<G, P, F[]>[];
+}

package/dist/optimization/search/MultiObjectivePopulationSearch.js

@@ -0,0 +1,34 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MultiObjectivePopulationSearch = void 0;
+class MultiObjectivePopulationSearch {
+    constructor(generator, goals, opers) {
+        this.generator = generator;
+        this.goals = goals;
+        this.opers = opers;
+    }
+    apply(iters, popSize) {
+        return __awaiter(this, void 0, void 0, function* () {
+            let population = this.generator.generate(popSize);
+            yield this.evaluate(population);
+            for (let iter = 1; iter <= iters; iter++) {
+                let couplings = this.select(population);
+                let offspring = this.reproduce(couplings);
+                yield this.evaluate(offspring);
+                population = this.replace(population, offspring, popSize);
+            }
+            return this.choose(population);
+        });
+    }
+}
+exports.MultiObjectivePopulationSearch = MultiObjectivePopulationSearch;
+//# sourceMappingURL=MultiObjectivePopulationSearch.js.map

package/dist/optimization/search/MultiObjectivePopulationSearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MultiObjectivePopulationSearch.js","sourceRoot":"","sources":["../../../src/optimization/search/MultiObjectivePopulationSearch.ts"],"names":[],"mappings":";;;;;;;;;;;;AAUA,MAAsB,8BAA8B;IAKhD,YAAY,SAAyC,EAAE,KAAuC,EAAE,KAAqB;QACjH,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACvB,CAAC;IAEY,KAAK,CAAC,KAAa,EAAE,OAAe;;YAC7C,IAAI,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAClD,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAChC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;gBACvC,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;gBACxC,IAAI,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;gBAC1C,MAAM,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;gBAC/B,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;YAC9D,CAAC;YACD,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACnC,CAAC;KAAA;CAQJ;AA7BD,wEA6BC"}

package/dist/optimization/search/Space.d.ts

@@ -0,0 +1,7 @@
+export interface Space<T> {
+    generateOne(): T;
+    generateMany(count: number): T[];
+    repair(individual: T): T;
+    repairMany(population: T[]): T[];
+    equals(one: T, two: T): boolean;
+}

package/dist/optimization/search/Space.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=Space.js.map

package/dist/optimization/search/Space.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Space.js","sourceRoot":"","sources":["../../../src/optimization/search/Space.ts"],"names":[],"mappings":""}

package/dist/optimization/search/portfolio/PortfolioIndividual.d.ts

@@ -0,0 +1,5 @@
+import { Individual } from "../../population/Individual";
+export declare class PortfolioIndividual extends Individual<number[], number[], number[]> {
+    constructor(genotype: number[]);
+    grow(): number[];
+}

package/dist/optimization/search/portfolio/PortfolioIndividual.js

@@ -0,0 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PortfolioIndividual = void 0;
+const Individual_1 = require("../../population/Individual");
+class PortfolioIndividual extends Individual_1.Individual {
+    constructor(genotype) {
+        super(genotype);
+    }
+    grow() {
+        return this.genotype;
+    }
+}
+exports.PortfolioIndividual = PortfolioIndividual;
+//# sourceMappingURL=PortfolioIndividual.js.map

package/dist/optimization/search/portfolio/PortfolioIndividual.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PortfolioIndividual.js","sourceRoot":"","sources":["../../../../src/optimization/search/portfolio/PortfolioIndividual.ts"],"names":[],"mappings":";;;AAAA,4DAAyD;AAEzD,MAAa,mBAAoB,SAAQ,uBAAwC;IAC/E,YAAY,QAAkB;QAC5B,KAAK,CAAC,QAAQ,CAAC,CAAC;IAClB,CAAC;IAEM,IAAI;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;CACF;AARD,kDAQC"}

package/dist/optimization/search/portfolio/PortfolioIndividualBuilder.d.ts

@@ -0,0 +1,5 @@
+import { IndividualBuilder } from "../../population/Individual";
+import { PortfolioIndividual } from "./PortfolioIndividual";
+export declare class PortfolioIndividualBuilder implements IndividualBuilder<number[], number[], number[]> {
+    apply(genotype: number[]): PortfolioIndividual;
+}

package/dist/optimization/search/portfolio/PortfolioIndividualBuilder.js

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PortfolioIndividualBuilder = void 0;
+const PortfolioIndividual_1 = require("./PortfolioIndividual");
+class PortfolioIndividualBuilder {
+    apply(genotype) {
+        return new PortfolioIndividual_1.PortfolioIndividual(genotype);
+    }
+}
+exports.PortfolioIndividualBuilder = PortfolioIndividualBuilder;
+//# sourceMappingURL=PortfolioIndividualBuilder.js.map

package/dist/optimization/search/portfolio/PortfolioIndividualBuilder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PortfolioIndividualBuilder.js","sourceRoot":"","sources":["../../../../src/optimization/search/portfolio/PortfolioIndividualBuilder.ts"],"names":[],"mappings":";;;AACA,+DAA4D;AAE5D,MAAa,0BAA0B;IAC9B,KAAK,CAAC,QAAkB;QAC7B,OAAO,IAAI,yCAAmB,CAAC,QAAQ,CAAC,CAAC;IAC3C,CAAC;CACF;AAJD,gEAIC"}

package/dist/optimization/search/portfolio/PortfolioSearch.d.ts

@@ -0,0 +1,18 @@
+import { Individual } from '../../population/Individual';
+import { PopulationGenerator } from '../../population/PopulationGenerator';
+import { Goal } from '../Goal';
+import { Coupling, MultiObjectivePopulationSearch } from '../MultiObjectivePopulationSearch';
+import { Space } from '../Space';
+import { Variation } from '../variate/Variation';
+export declare class PortfolioSearch extends MultiObjectivePopulationSearch<number[], number[], number, Individual<number[], number[], number[]>> {
+    private selector;
+    private archive;
+    private environmentalSelector;
+    private space;
+    constructor(space: Space<number[]>, generator: PopulationGenerator<number[], number[], number[]>, goals: Goal<Individual<number[], number[], number[]>, number>[], operators: Variation<number[]>[]);
+    protected evaluate(population: Individual<number[], number[], number[]>[]): Promise<void>;
+    protected select(population: Individual<number[], number[], number[]>[]): Coupling<number[], number[], number[]>[];
+    protected reproduce(couplings: Coupling<number[], number[], number[]>[]): Individual<number[], number[], number[]>[];
+    protected replace(population: Individual<number[], number[], number[]>[], offspring: Individual<number[], number[], number[]>[], popSize: number): Individual<number[], number[], number[]>[];
+    protected choose(population: Individual<number[], number[], number[]>[]): Individual<number[], number[], number[]>[];
+}

package/dist/optimization/search/portfolio/PortfolioSearch.js

@@ -0,0 +1,72 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PortfolioSearch = void 0;
+const MultiObjectivePopulationSearch_1 = require("../MultiObjectivePopulationSearch");
+const EnviromentSelector_1 = require("./noDominanceSelector/EnviromentSelector");
+const PortfolioIndividual_1 = require("./PortfolioIndividual");
+const TournamentSelector_1 = require("./tournament/TournamentSelector");
+class PortfolioSearch extends MultiObjectivePopulationSearch_1.MultiObjectivePopulationSearch {
+    constructor(space, generator, goals, operators) {
+        super(generator, goals, operators);
+        this.archive = [];
+        this.space = space;
+        this.selector = new TournamentSelector_1.TournamentSelector(goals);
+        this.environmentalSelector = new EnviromentSelector_1.EnvironmentSelector(space, goals);
+    }
+    evaluate(population) {
+        return __awaiter(this, void 0, void 0, function* () {
+            for (let individual of population)
+                if (individual.fitness === undefined || individual.fitness.length !== this.goals.length) {
+                    let fitnessValues = [];
+                    for (let goal of this.goals) {
+                        const value = goal.compute(individual);
+                        fitnessValues.push(value);
+                    }
+                    individual.fitness = fitnessValues;
+                }
+        });
+    }
+    select(population) {
+        const couplings = [];
+        for (let individual of population) {
+            const operIndex = Math.floor(Math.random() * this.opers.length);
+            const operator = this.opers[operIndex];
+            let coupling = { operIndex, parents: [individual] };
+            for (let i = 1; i < operator.arity(); i++)
+                coupling.parents.push(this.selector.selectOne(population));
+            couplings.push(coupling);
+        }
+        return couplings;
+    }
+    reproduce(couplings) {
+        let offspring = [];
+        for (let coupling of couplings) {
+            const parentGenotypes = coupling.parents.map(p => p.genotype);
+            const childrenGenotypes = this.opers[coupling.operIndex].apply(parentGenotypes);
+            for (let childGenotype of childrenGenotypes)
+                offspring.push(new PortfolioIndividual_1.PortfolioIndividual(this.space.repair(childGenotype)));
+        }
+        return offspring;
+    }
+    replace(population, offspring, popSize) {
+        this.archive = this.environmentalSelector.reduceEquals(this.environmentalSelector.chooseNonDominated(population.concat(offspring).concat(this.archive)).individuals);
+        console.log("Population before enviromental selection: ", population.length, "Population after adding offspring: ", population.length + offspring.length, "Archive size: ", this.archive.length);
+        return this.environmentalSelector.apply(population.concat(offspring), population.length);
+        // this.archive = this.environmentalSelector.chooseSurvivors(population, offspring, population.length);
+        // return this.archive;
+    }
+    choose(population) {
+        return this.archive;
+    }
+}
+exports.PortfolioSearch = PortfolioSearch;
+//# sourceMappingURL=PortfolioSearch.js.map

package/dist/optimization/search/portfolio/PortfolioSearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PortfolioSearch.js","sourceRoot":"","sources":["../../../../src/optimization/search/portfolio/PortfolioSearch.ts"],"names":[],"mappings":";;;;;;;;;;;;AAGA,sFAA6F;AAG7F,iFAA+E;AAC/E,+DAA4D;AAC5D,wEAAqE;AAErE,MAAa,eAAgB,SAAQ,+DAAoG;IAMvI,YAAY,KAAsB,EAAE,SAA4D,EAAE,KAA+D,EAAE,SAAgC;QACjM,KAAK,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAL7B,YAAO,GAA+C,EAAE,CAAC;QAM/D,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,IAAI,uCAAkB,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,CAAC,qBAAqB,GAAG,IAAI,wCAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACrE,CAAC;IAEe,QAAQ,CAAC,UAAsD;;YAC7E,KAAK,IAAI,UAAU,IAAI,UAAU;gBAC/B,IAAI,UAAU,CAAC,OAAO,KAAK,SAAS,IAAI,UAAU,CAAC,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;oBACxF,IAAI,aAAa,GAAa,EAAE,CAAC;oBACjC,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;wBAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACvC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC5B,CAAC;oBACD,UAAU,CAAC,OAAO,GAAG,aAAa,CAAC;gBACrC,CAAC;QACL,CAAC;KAAA;IAES,MAAM,CAAC,UAAsD;QACrE,MAAM,SAAS,GAA6C,EAAE,CAAC;QAE/D,KAAK,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;YAClC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAChE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACvC,IAAI,QAAQ,GAA2C,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC;YAC5F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;gBAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;YACtG,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAES,SAAS,CAAC,SAAmD;QACrE,IAAI,SAAS,GAA+C,EAAE,CAAC;QAC/D,KAAK,IAAI,QAAQ,IAAI,SAAS,EAAE,CAAC;YAC/B,MAAM,eAAe,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YAC9D,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YAChF,KAAK,IAAI,aAAa,IAAI,iBAAiB;gBACzC,SAAS,CAAC,IAAI,CAAC,IAAI,yCAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAES,OAAO,CAAC,UAAsD,EAAE,SAAqD,EAAE,OAAe;QAC9I,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,YAAY,CAAC,IAAI,CAAC,qBAAqB,CAAC,kBAAkB,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACrK,OAAO,CAAC,GAAG,CAAC,4CAA4C,EAAE,UAAU,CAAC,MAAM,EAAE,qCAAqC,EAAE,UAAU,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,gBAAgB,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAEjM,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QACzF,uGAAuG;QACvG,uBAAuB;IACzB,CAAC;IAES,MAAM,CAAC,UAAsD;QACrE,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;CACF;AA7DD,0CA6DC"}

package/dist/optimization/search/portfolio/PortfolioSpace.d.ts

@@ -0,0 +1,32 @@
+import { Space } from '../Space';
+export interface PorfolioRestrictions {
+    constraints: {
+        minWeigth: number;
+        maxWeight: number;
+    }[];
+    groupedConstraints: {
+        constraintIndices: number[];
+        minWeight: number;
+        maxWeight: number;
+    }[];
+}
+export declare class PortfolioSpace implements Space<number[]> {
+    private maxIterations;
+    private tolerance;
+    private gradient;
+    private groupGradient;
+    private restrictions;
+    constructor(restrictions: PorfolioRestrictions, maxIterations?: number, tolerance?: number, gradient?: number, groupGradient?: number);
+    equals(one: number[], two: number[]): boolean;
+    getRestrictions(): PorfolioRestrictions;
+    generateMany(count: number): number[][];
+    generateOne(): number[];
+    repairMany(population: number[][]): number[][];
+    repair(individual: number[]): number[];
+    private repairGroupConstraints;
+    private decreaseGroupWeights;
+    private increaseGroupeWeights;
+    private applyBoxConstraints;
+    private checkRestrictions;
+    private normalize;
+}

package/dist/optimization/search/portfolio/PortfolioSpace.js

@@ -0,0 +1,131 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PortfolioSpace = void 0;
+class PortfolioSpace {
+    constructor(restrictions, maxIterations = 500, tolerance = 1e-7, gradient = 0.6, groupGradient = 0.9) {
+        this.maxIterations = maxIterations;
+        this.tolerance = tolerance;
+        this.gradient = gradient;
+        this.groupGradient = groupGradient;
+        this.restrictions = restrictions;
+    }
+    equals(one, two) {
+        for (let i = 0; i < one.length; i++)
+            if (Math.abs(one[i] - two[i]) > 1e-4)
+                return false;
+        return true;
+    }
+    getRestrictions() {
+        return this.restrictions;
+    }
+    generateMany(count) {
+        let porforlios = [];
+        for (let i = 0; i < count; i++)
+            porforlios.push(this.generateOne());
+        return porforlios;
+    }
+    generateOne() {
+        let portfolio = [];
+        for (let constraint of this.restrictions.constraints)
+            portfolio.push(Math.random() * (constraint.maxWeight - constraint.minWeigth) + constraint.minWeigth);
+        return this.repair(portfolio);
+    }
+    repairMany(population) {
+        return population.map(individual => this.repair(individual));
+    }
+    repair(individual) {
+        individual = this.normalize(individual);
+        for (let iter = 1; iter <= this.maxIterations && !this.checkRestrictions(individual); iter++) {
+            individual = this.applyBoxConstraints(individual);
+            individual = this.normalize(individual);
+            if (this.restrictions.groupedConstraints.length > 0) {
+                individual = this.repairGroupConstraints(individual);
+                individual = this.normalize(individual);
+            }
+        }
+        return individual;
+    }
+    repairGroupConstraints(currentWeights) {
+        const current = [...currentWeights];
+        for (const group of this.restrictions.groupedConstraints) {
+            const groupSum = group.constraintIndices.reduce((sum, index) => sum + current[index], 0);
+            if (groupSum < group.minWeight - this.tolerance) {
+                this.increaseGroupeWeights(current, group, groupSum);
+            }
+            else if (groupSum > group.maxWeight + this.tolerance) {
+                this.decreaseGroupWeights(current, group, groupSum);
+            }
+        }
+        return current;
+    }
+    decreaseGroupWeights(current, group, groupSum) {
+        let excess = groupSum - group.maxWeight;
+        if (excess * this.groupGradient > this.tolerance)
+            excess *= this.groupGradient;
+        const availableDecrease = group.constraintIndices.map(index => current[index] - this.restrictions.constraints[index].minWeigth);
+        const totalAvailable = availableDecrease.reduce((sum, val) => sum + val, 0);
+        if (totalAvailable > excess) {
+            for (let j = 0; j < group.constraintIndices.length; j++) {
+                const idx = group.constraintIndices[j];
+                const proportion = availableDecrease[j] / totalAvailable;
+                current[idx] -= proportion * excess;
+            }
+        }
+        else {
+            for (const idx of group.constraintIndices) {
+                current[idx] = this.restrictions.constraints[idx].minWeigth;
+            }
+        }
+    }
+    increaseGroupeWeights(currentWeight, group, groupSum) {
+        let deficit = group.minWeight - groupSum;
+        if (deficit * this.groupGradient > this.tolerance)
+            deficit *= this.groupGradient;
+        const availableIncrease = group.constraintIndices.map(index => this.restrictions.constraints[index].maxWeight - currentWeight[index]);
+        const totalAvailable = availableIncrease.reduce((sum, val) => sum + val, 0);
+        if (totalAvailable > deficit) {
+            for (let j = 0; j < group.constraintIndices.length; j++) {
+                const idx = group.constraintIndices[j];
+                const proportion = availableIncrease[j] / totalAvailable;
+                currentWeight[idx] += proportion * deficit;
+            }
+        }
+        else {
+            for (const idx of group.constraintIndices) {
+                currentWeight[idx] = this.restrictions.constraints[idx].maxWeight;
+            }
+        }
+    }
+    applyBoxConstraints(currentWeights) {
+        return currentWeights.map((weight, index) => {
+            const min = this.restrictions.constraints[index].minWeigth;
+            const max = this.restrictions.constraints[index].maxWeight;
+            if (weight < min) {
+                let diference = (min - weight) * this.gradient;
+                return diference < this.tolerance ? min : weight + diference;
+            }
+            else if (weight > max) {
+                let diference = (weight - max) * this.gradient;
+                return diference < this.tolerance ? max : weight - diference;
+            }
+            return weight;
+        });
+    }
+    checkRestrictions(individual) {
+        for (let i = 0; i < individual.length; i++)
+            if (individual[i] < this.restrictions.constraints[i].minWeigth - this.tolerance || individual[i] > this.restrictions.constraints[i].maxWeight + this.tolerance)
+                return false;
+        for (let group of this.restrictions.groupedConstraints) {
+            let groupSum = group.constraintIndices.reduce((sum, index) => sum + individual[index], 0);
+            if (groupSum < group.minWeight - this.tolerance || groupSum > group.maxWeight + this.tolerance)
+                return false;
+        }
+        return true;
+    }
+    normalize(weights) {
+        const total = weights.reduce((sum, weight) => sum + weight, 0);
+        return weights.map(weight => weight / total);
+    }
+}
+exports.PortfolioSpace = PortfolioSpace;
+//# sourceMappingURL=PortfolioSpace.js.map

package/dist/optimization/search/portfolio/PortfolioSpace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PortfolioSpace.js","sourceRoot":"","sources":["../../../../src/optimization/search/portfolio/PortfolioSpace.ts"],"names":[],"mappings":";;;AAcA,MAAa,cAAc;IAOzB,YAAY,YAAkC,EAAE,gBAAwB,GAAG,EAAE,YAAoB,IAAI,EAAE,WAAmB,GAAG,EAAE,gBAAwB,GAAG;QACxJ,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IACnC,CAAC;IAEM,MAAM,CAAC,GAAa,EAAE,GAAa;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;gBAAE,OAAO,KAAK,CAAC;QACxF,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,eAAe;QACpB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAEM,YAAY,CAAC,KAAa;QAC/B,IAAI,UAAU,GAAG,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;YAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;QACpE,OAAO,UAAU,CAAC;IACpB,CAAC;IAEM,WAAW;QAChB,IAAI,SAAS,GAAa,EAAE,CAAC;QAC7B,KAAK,IAAI,UAAU,IAAI,IAAI,CAAC,YAAY,CAAC,WAAW;YAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,CAAC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;QAC3J,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAChC,CAAC;IAEM,UAAU,CAAC,UAAsB;QACtC,OAAO,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;IAC/D,CAAC;IAEM,MAAM,CAAC,UAAoB;QAChC,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QACxC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;YAC7F,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;YAClD,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;YACxC,IAAI,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpD,UAAU,GAAG,IAAI,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;gBACrD,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,sBAAsB,CAAC,cAAwB;QACrD,MAAM,OAAO,GAAG,CAAC,GAAG,cAAc,CAAC,CAAC;QACpC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,CAAC,kBAAkB,EAAE,CAAC;YACzD,MAAM,QAAQ,GAAG,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;YACzF,IAAI,QAAQ,GAAG,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAChD,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;YACvD,CAAC;iBAAM,IAAI,QAAQ,GAAG,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBACvD,IAAI,CAAC,oBAAoB,CAAC,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,oBAAoB,CAAC,OAAiB,EAAE,KAA4E,EAAE,QAAgB;QAC5I,IAAI,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC;QACxC,IAAI,MAAM,GAAG,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,SAAS;YAAE,MAAM,IAAI,IAAI,CAAC,aAAa,CAAC;QAC/E,MAAM,iBAAiB,GAAG,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC;QAChI,MAAM,cAAc,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;QAC5E,IAAI,cAAc,GAAG,MAAM,EAAE,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxD,MAAM,GAAG,GAAG,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBACvC,MAAM,UAAU,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC;gBACzD,OAAO,CAAC,GAAG,CAAC,IAAI,UAAU,GAAG,MAAM,CAAC;YACtC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,iBAAiB,EAAE,CAAC;gBAC1C,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;IAEO,qBAAqB,CAAC,aAAuB,EAAE,KAA4E,EAAE,QAAgB;QACnJ,IAAI,OAAO,GAAG,KAAK,CAAC,SAAS,GAAG,QAAQ,CAAC;QACzC,IAAI,OAAO,GAAG,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,SAAS;YAAE,OAAO,IAAI,IAAI,CAAC,aAAa,CAAC;QAEjF,MAAM,iBAAiB,GAAG,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,SAAS,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;QACtI,MAAM,cAAc,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;QAE5E,IAAI,cAAc,GAAG,OAAO,EAAE,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxD,MAAM,GAAG,GAAG,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBACvC,MAAM,UAAU,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC;gBACzD,aAAa,CAAC,GAAG,CAAC,IAAI,UAAU,GAAG,OAAO,CAAC;YAC7C,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,iBAAiB,EAAE,CAAC;gBAC1C,aAAa,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;YACpE,CAAC;QACH,CAAC;IACH,CAAC;IAEO,mBAAmB,CAAC,cAAwB;QAClD,OAAO,cAAc,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC;YAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC;YAC3D,IAAI,MAAM,GAAG,GAAG,EAAE,CAAC;gBACjB,IAAI,SAAS,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAC/C,OAAO,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC;YAC/D,CAAC;iBAAM,IAAI,MAAM,GAAG,GAAG,EAAE,CAAC;gBACxB,IAAI,SAAS,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAC/C,OAAO,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC;YAC/D,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,iBAAiB,CAAC,UAAoB;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS;gBAAE,OAAO,KAAK,CAAC;QACzN,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,YAAY,CAAC,kBAAkB,EAAE,CAAC;YACvD,IAAI,QAAQ,GAAG,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1F,IAAI,QAAQ,GAAG,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,QAAQ,GAAG,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS;gBAAE,OAAO,KAAK,CAAC;QAC/G,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,SAAS,CAAC,OAAiB;QACjC,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC;QAC/D,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;IAC/C,CAAC;CACF;AApID,wCAoIC"}

package/dist/optimization/search/portfolio/PortfolioTypes.d.ts

@@ -0,0 +1,26 @@
+export interface IAssetConstraint {
+    assetId: number;
+    asset: string;
+    allocation?: number;
+    constraint: {
+        minWeight: number;
+        maxWeight: number;
+    };
+}
+export interface IGroupedConstraint {
+    constraintIndices: number[];
+    minWeight: number;
+    maxWeight: number;
+}
+export interface IPortfolioSettings {
+    constraints: IAssetConstraint[];
+    groupedConstraints: IGroupedConstraint[];
+    isValid?: boolean;
+    validationMessage?: string;
+}
+export interface IPortfolioData {
+    businessId: number;
+    userId: number;
+    type: string;
+    settings: IPortfolioSettings;
+}

package/dist/optimization/search/portfolio/PortfolioTypes.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=PortfolioTypes.js.map

package/dist/optimization/search/portfolio/PortfolioTypes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PortfolioTypes.js","sourceRoot":"","sources":["../../../../src/optimization/search/portfolio/PortfolioTypes.ts"],"names":[],"mappings":""}

package/dist/optimization/search/portfolio/goals/ReturnGoal.d.ts

@@ -0,0 +1,17 @@
+import { IMarketData } from '../../../../crud/MarketDataManager';
+import { Order } from '../../../../sort/Order';
+import { Individual } from '../../../population/Individual';
+import { Goal } from '../../Goal';
+import { IPortfolioData } from '../PortfolioTypes';
+export declare class ReturnGoal extends Goal<Individual<number[], number[], number[]>, number> {
+    private marketData;
+    private assetIds;
+    private cachedReturns;
+    constructor(order: Order<number>, portfolioData?: IPortfolioData, marketData?: IMarketData[]);
+    private normaliceMarketData;
+    private calculateDailyReturns;
+    private calculateAnnualReturn;
+    private getAssetReturn;
+    compute(individual: Individual<number[], number[], number[]>): number;
+    init(): Promise<void>;
+}

package/dist/optimization/search/portfolio/goals/ReturnGoal.js

@@ -0,0 +1,72 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ReturnGoal = void 0;
+const Goal_1 = require("../../Goal");
+class ReturnGoal extends Goal_1.Goal {
+    constructor(order, portfolioData, marketData) {
+        var _a, _b;
+        super(order);
+        this.assetIds = [];
+        this.assetIds = ((_b = (_a = portfolioData === null || portfolioData === void 0 ? void 0 : portfolioData.settings) === null || _a === void 0 ? void 0 : _a.constraints) === null || _b === void 0 ? void 0 : _b.map(c => c.assetId)) || [];
+        this.marketData = this.normaliceMarketData(marketData);
+        this.cachedReturns = new Map();
+    }
+    normaliceMarketData(marketData) {
+        const marketDataByAsset = new Map();
+        for (const assetMarketData of marketData) {
+            const assetId = Array.isArray(assetMarketData.assetId) ? assetMarketData.assetId[0] : assetMarketData.assetId;
+            if (!marketDataByAsset.has(assetId))
+                marketDataByAsset.set(assetId, []);
+            marketDataByAsset.get(assetId).push(assetMarketData);
+        }
+        return marketDataByAsset;
+    }
+    calculateDailyReturns(prices) {
+        const returns = [];
+        for (let i = 1; i < prices.length; i++) {
+            returns.push(prices[i] / prices[i - 1] - 1);
+        }
+        return returns;
+    }
+    calculateAnnualReturn(dailyReturns) {
+        const avgDailyReturn = dailyReturns.reduce((sum, r) => sum + r, 0) / dailyReturns.length;
+        return Math.pow(1 + avgDailyReturn, 365) - 1;
+    }
+    getAssetReturn(assetId) {
+        if (!this.cachedReturns.has(assetId)) {
+            const data = this.marketData.get(assetId);
+            const sortedData = [...data].sort((a, b) => a.date - b.date);
+            const prices = sortedData.map(d => d.value);
+            const dailyReturns = this.calculateDailyReturns(prices);
+            const annualReturn = this.calculateAnnualReturn(dailyReturns);
+            this.cachedReturns.set(assetId, annualReturn);
+            return annualReturn;
+        }
+        return this.cachedReturns.get(assetId);
+    }
+    compute(individual) {
+        const weights = individual.genotype;
+        let portfolioReturn = 0;
+        for (let i = 0; i < weights.length; i++) {
+            const assetId = this.assetIds[i];
+            const assetReturn = this.getAssetReturn(assetId);
+            portfolioReturn += weights[i] * assetReturn;
+        }
+        return portfolioReturn;
+    }
+    init() {
+        return __awaiter(this, void 0, void 0, function* () {
+        });
+    }
+}
+exports.ReturnGoal = ReturnGoal;
+//# sourceMappingURL=ReturnGoal.js.map

package/dist/optimization/search/portfolio/goals/ReturnGoal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReturnGoal.js","sourceRoot":"","sources":["../../../../../src/optimization/search/portfolio/goals/ReturnGoal.ts"],"names":[],"mappings":";;;;;;;;;;;;AAGA,qCAAkC;AAGlC,MAAa,UAAW,SAAQ,WAAsD;IAKpF,YAAY,KAAoB,EAAE,aAA8B,EAAE,UAA0B;;QAC1F,KAAK,CAAC,KAAK,CAAC,CAAC;QAJP,aAAQ,GAAa,EAAE,CAAC;QAK9B,IAAI,CAAC,QAAQ,GAAG,CAAA,MAAA,MAAA,aAAa,aAAb,aAAa,uBAAb,aAAa,CAAE,QAAQ,0CAAE,WAAW,0CAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAI,EAAE,CAAC;QAChF,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;QACvD,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;IACjC,CAAC;IACO,mBAAmB,CAAC,UAAqC;QAC/D,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAyB,CAAC;QAC3D,KAAK,MAAM,eAAe,IAAI,UAAW,EAAE,CAAC;YAC1C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,OAAQ,CAAC;YAC/G,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC;gBACjC,iBAAiB,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YACrC,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,iBAAiB,CAAC;IAC3B,CAAC;IAEO,qBAAqB,CAAC,MAAgB;QAC5C,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,qBAAqB,CAAC,YAAsB;QAClD,MAAM,cAAc,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;QACzF,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,cAAc,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC;IAEO,cAAc,CAAC,OAAe;QACpC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC1C,MAAM,UAAU,GAAG,CAAC,GAAG,IAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAK,GAAG,CAAC,CAAC,IAAK,CAAC,CAAC;YAChE,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAM,CAAC,CAAC;YAC7C,MAAM,YAAY,GAAG,IAAI,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;YACxD,MAAM,YAAY,GAAG,IAAI,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC;YAC9D,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YAC9C,OAAO,YAAY,CAAC;QACtB,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;IAC1C,CAAC;IAEM,OAAO,CAAC,UAAoD;QACjE,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,CAAC;QACpC,IAAI,eAAe,GAAG,CAAC,CAAC;QAExB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;YACjD,eAAe,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;QAC9C,CAAC;QACD,OAAO,eAAe,CAAC;IACzB,CAAC;IAEY,IAAI;;QACjB,CAAC;KAAA;CACF;AA9DD,gCA8DC"}

package/dist/optimization/search/portfolio/goals/VolatilityGoal.d.ts

@@ -0,0 +1,17 @@
+import { IMarketData } from '../../../../crud/MarketDataManager';
+import { Order } from '../../../../sort/Order';
+import { Individual } from '../../../population/Individual';
+import { Goal } from '../../Goal';
+import { IPortfolioData } from '../PortfolioTypes';
+export declare class VolatilityGoal extends Goal<Individual<number[], number[], number[]>, number> {
+    private marketData;
+    private assetIds;
+    private covarianceMatrix;
+    constructor(order: Order<number>, portfolioData?: IPortfolioData, marketData?: IMarketData[]);
+    private normalizeMarketData;
+    private calculateDailyReturns;
+    private calculateCovariance;
+    private buildCovarianceMatrix;
+    compute(individual: Individual<number[], number[], number[]>): number;
+    init(): Promise<void>;
+}

package/dist/optimization/search/portfolio/goals/VolatilityGoal.js

@@ -0,0 +1,93 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.VolatilityGoal = void 0;
+const Goal_1 = require("../../Goal");
+class VolatilityGoal extends Goal_1.Goal {
+    constructor(order, portfolioData, marketData) {
+        var _a, _b;
+        super(order);
+        this.assetIds = [];
+        this.covarianceMatrix = [];
+        this.assetIds = ((_b = (_a = portfolioData === null || portfolioData === void 0 ? void 0 : portfolioData.settings) === null || _a === void 0 ? void 0 : _a.constraints) === null || _b === void 0 ? void 0 : _b.map(c => c.assetId)) || [];
+        this.marketData = this.normalizeMarketData(marketData);
+        if (this.assetIds.length > 0 && this.marketData.size > 0)
+            this.buildCovarianceMatrix();
+    }
+    normalizeMarketData(marketData) {
+        const marketDataByAsset = new Map();
+        if (!marketData)
+            return marketDataByAsset;
+        for (const point of marketData) {
+            const assetId = Array.isArray(point.assetId) ? point.assetId[0] : point.assetId;
+            if (!marketDataByAsset.has(assetId)) {
+                marketDataByAsset.set(assetId, []);
+            }
+            marketDataByAsset.get(assetId).push(point);
+        }
+        return marketDataByAsset;
+    }
+    calculateDailyReturns(prices) {
+        const returns = [];
+        for (let i = 1; i < prices.length; i++) {
+            returns.push(prices[i] / prices[i - 1] - 1);
+        }
+        return returns;
+    }
+    calculateCovariance(returns1, returns2) {
+        const limitedArraySize = Math.min(returns1.length, returns2.length);
+        const mean1 = returns1.reduce((s, returnValue) => s + returnValue, 0) / limitedArraySize;
+        const mean2 = returns2.reduce((s, returnValue) => s + returnValue, 0) / limitedArraySize;
+        let covariance = 0;
+        for (let i = 0; i < limitedArraySize; i++) {
+            covariance += (returns1[i] - mean1) * (returns2[i] - mean2);
+        }
+        return covariance / limitedArraySize;
+    }
+    buildCovarianceMatrix() {
+        var _a;
+        const totalAssets = this.assetIds.length;
+        const returnsMatrix = [];
+        for (const assetId of this.assetIds) {
+            const data = this.marketData.get(assetId);
+            if (!data) {
+                returnsMatrix.push([]);
+                continue;
+            }
+            const sorted = [...data].sort((a, b) => a.date - b.date);
+            const prices = (_a = sorted.map(priceData => priceData.value)) !== null && _a !== void 0 ? _a : [];
+            returnsMatrix.push(this.calculateDailyReturns(prices));
+        }
+        this.covarianceMatrix = [];
+        for (let i = 0; i < totalAssets; i++) {
+            this.covarianceMatrix[i] = [];
+            for (let j = 0; j < totalAssets; j++) {
+                const cov = this.calculateCovariance(returnsMatrix[i], returnsMatrix[j]);
+                this.covarianceMatrix[i][j] = cov * 365;
+            }
+        }
+    }
+    compute(individual) {
+        const weights = individual.genotype;
+        let variance = 0;
+        for (let i = 0; i < weights.length; i++) {
+            for (let j = 0; j < weights.length; j++) {
+                variance += weights[i] * weights[j] * this.covarianceMatrix[i][j];
+            }
+        }
+        return Math.sqrt(variance);
+    }
+    init() {
+        return __awaiter(this, void 0, void 0, function* () { });
+    }
+}
+exports.VolatilityGoal = VolatilityGoal;
+//# sourceMappingURL=VolatilityGoal.js.map

package/dist/optimization/search/portfolio/goals/VolatilityGoal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"VolatilityGoal.js","sourceRoot":"","sources":["../../../../../src/optimization/search/portfolio/goals/VolatilityGoal.ts"],"names":[],"mappings":";;;;;;;;;;;;AAGA,qCAAkC;AAGlC,MAAa,cAAe,SAAQ,WAAsD;IAKxF,YAAY,KAAoB,EAAE,aAA8B,EAAE,UAA0B;;QAC1F,KAAK,CAAC,KAAK,CAAC,CAAC;QAJP,aAAQ,GAAa,EAAE,CAAC;QACxB,qBAAgB,GAAe,EAAE,CAAC;QAIxC,IAAI,CAAC,QAAQ,GAAG,CAAA,MAAA,MAAA,aAAa,aAAb,aAAa,uBAAb,aAAa,CAAE,QAAQ,0CAAE,WAAW,0CAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAI,EAAE,CAAC;QAChF,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC;YACtD,IAAI,CAAC,qBAAqB,EAAE,CAAC;IACjC,CAAC;IAEO,mBAAmB,CAAC,UAA0B;QACpD,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAyB,CAAC;QAC3D,IAAI,CAAC,UAAU;YAAE,OAAO,iBAAiB,CAAC;QAE1C,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAQ,CAAC;YACjF,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACpC,iBAAiB,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YACrC,CAAC;YACD,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9C,CAAC;QAED,OAAO,iBAAiB,CAAC;IAC3B,CAAC;IAEO,qBAAqB,CAAC,MAAgB;QAC5C,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,mBAAmB,CAAC,QAAkB,EAAE,QAAkB;QAChE,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;QAEpE,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,EAAE,CAAC,CAAC,GAAG,WAAW,EAAE,CAAC,CAAC,GAAG,gBAAgB,CAAC;QACzF,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,EAAE,CAAC,CAAC,GAAG,WAAW,EAAE,CAAC,CAAC,GAAG,gBAAgB,CAAC;QAEzF,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,UAAU,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAC9D,CAAC;QAED,OAAO,UAAU,GAAG,gBAAgB,CAAC;IACvC,CAAC;IAEO,qBAAqB;;QAC3B,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QACzC,MAAM,aAAa,GAAe,EAAE,CAAC;QAErC,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC1C,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACvB,SAAS;YACX,CAAC;YACD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAK,GAAG,CAAC,CAAC,IAAK,CAAC,CAAC;YAC3D,MAAM,MAAM,GAAG,MAAA,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,SAAS,CAAC,KAAM,CAAC,mCAAI,EAAE,CAAC;YAC/D,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,GAAG,GAAG,IAAI,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzE,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;YAC1C,CAAC;QACH,CAAC;IACH,CAAC;IAEM,OAAO,CAAC,UAAoD;QACjE,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,CAAC;QACpC,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,QAAQ,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC7B,CAAC;IAEY,IAAI;8DAAmB,CAAC;KAAA;CACtC;AAzFD,wCAyFC"}

package/dist/optimization/search/portfolio/noDominanceSelector/EnviromentSelector.d.ts

@@ -0,0 +1,21 @@
+import { Individual } from '../../../population/Individual';
+import { Goal } from '../../Goal';
+import { Space } from '../../Space';
+export declare class EnvironmentSelector<G, P, F> {
+    private goals;
+    private growthRate;
+    private maxPopulation;
+    private space;
+    constructor(space: Space<G>, goals: Goal<Individual<G, P, F[]>, F>[], growthRate?: number, maxPopulation?: number);
+    reduceEquals(population: Individual<G, P, F[]>[]): Individual<G, P, F[]>[];
+    private isUnique;
+    chooseNonDominated(population: Individual<G, P, F[]>[]): {
+        indexes: number[];
+        individuals: Individual<G, P, F[]>[];
+    };
+    private isDominated;
+    private dominates;
+    private distance;
+    private truncate;
+    apply(population: Individual<G, P, F[]>[], currentSize: number): Individual<G, P, F[]>[];
+}

package/dist/optimization/search/portfolio/noDominanceSelector/EnviromentSelector.js

@@ -0,0 +1,98 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EnvironmentSelector = void 0;
+class EnvironmentSelector {
+    constructor(space, goals, growthRate = 1.1, maxPopulation = 200) {
+        this.space = space;
+        this.goals = goals;
+        this.growthRate = growthRate;
+        this.maxPopulation = maxPopulation;
+    }
+    reduceEquals(population) {
+        let uniquePopulation = [];
+        for (let individual of population)
+            if (this.isUnique(individual, uniquePopulation))
+                uniquePopulation.push(individual);
+        return uniquePopulation;
+    }
+    isUnique(individual, uniquePopulation) {
+        for (let uniqueIndividual of uniquePopulation)
+            if (this.space.equals(individual.genotype, uniqueIndividual.genotype))
+                return false;
+        return true;
+    }
+    chooseNonDominated(population) {
+        let result = { indexes: [], individuals: [] };
+        for (let i = 0; i < population.length; i++)
+            if (!this.isDominated(i, population)) {
+                result.indexes.push(i);
+                result.individuals.push(population[i]);
+            }
+        return result;
+    }
+    isDominated(i, population) {
+        for (let j = 0; j < population.length; j++)
+            if (i !== j && this.dominates(population[j], population[i]))
+                return true;
+        return false;
+    }
+    dominates(first, second) {
+        let isBetterInAtLeastOne = false;
+        for (let i = 0; i < this.goals.length; i++) {
+            const comparison = this.goals[i].getOrder().compare(first.fitness[i], second.fitness[i]);
+            if (comparison < 0)
+                return false;
+            if (comparison > 0)
+                isBetterInAtLeastOne = true;
+        }
+        return isBetterInAtLeastOne;
+    }
+    distance(ind1, ind2) {
+        let sum = 0;
+        for (let i = 0; i < ind1.fitness.length; i++) {
+            const diff = ind1.fitness[i] - ind2.fitness[i];
+            sum += diff * diff;
+        }
+        return Math.sqrt(sum);
+    }
+    truncate(population, maxPopulationSize) {
+        while (population.length > maxPopulationSize) {
+            let minimumDistance = Infinity;
+            let toRemove = 0;
+            for (let i = 0; i < population.length; i++) {
+                let nearest = Infinity;
+                for (let j = 0; j < population.length; j++) {
+                    if (i !== j) {
+                        const distanceBetweenIndividuals = this.distance(population[i], population[j]);
+                        if (distanceBetweenIndividuals < nearest)
+                            nearest = distanceBetweenIndividuals;
+                    }
+                }
+                if (nearest < minimumDistance) {
+                    minimumDistance = nearest;
+                    toRemove = i;
+                }
+            }
+            population.splice(toRemove, 1);
+        }
+        return population;
+    }
+    apply(population, currentSize) {
+        const target = Math.min(Math.floor(currentSize * this.growthRate), this.maxPopulation);
+        let nextPopulation = [];
+        while (nextPopulation.length < target && population.length > 0) {
+            let nonDominated = this.chooseNonDominated(population);
+            if (nextPopulation.length + nonDominated.individuals.length <= target) {
+                nextPopulation = nextPopulation.concat(this.reduceEquals(nonDominated.individuals));
+            }
+            else {
+                const needed = target - nextPopulation.length;
+                nextPopulation = nextPopulation.concat(this.truncate(this.reduceEquals(nonDominated.individuals), needed));
+            }
+            population = population.filter((_, i) => !nonDominated.indexes.includes(i));
+        }
+        return nextPopulation;
+    }
+}
+exports.EnvironmentSelector = EnvironmentSelector;
+//# sourceMappingURL=EnviromentSelector.js.map

package/dist/optimization/search/portfolio/noDominanceSelector/EnviromentSelector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EnviromentSelector.js","sourceRoot":"","sources":["../../../../../src/optimization/search/portfolio/noDominanceSelector/EnviromentSelector.ts"],"names":[],"mappings":";;;AAIA,MAAa,mBAAmB;IAM9B,YAAY,KAAe,EAAE,KAAuC,EAAE,aAAqB,GAAG,EAAE,gBAAwB,GAAG;QACzH,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAEM,YAAY,CAAC,UAAmC;QACrD,IAAI,gBAAgB,GAA4B,EAAE,CAAC;QACnD,KAAK,IAAI,UAAU,IAAI,UAAU;YAC7B,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,gBAAgB,CAAC;gBAC3C,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1C,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IAEO,QAAQ,CAAC,UAAiC,EAAE,gBAAyC;QAC3F,KAAK,IAAI,gBAAgB,IAAI,gBAAgB;YACzC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,gBAAgB,CAAC,QAAQ,CAAC;gBACjE,OAAO,KAAK,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,kBAAkB,CAAC,UAAmC;QAC3D,IAAI,MAAM,GAAgE,EAAE,OAAO,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;QAC3G,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE;YACxC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC;gBACrC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACvB,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,WAAW,CAAC,CAAS,EAAE,UAAmC;QAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;QACrH,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,SAAS,CAAC,KAA4B,EAAE,MAA6B;QAC3E,IAAI,oBAAoB,GAAG,KAAK,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,OAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,OAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,IAAI,UAAU,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAC;YACjC,IAAI,UAAU,GAAG,CAAC;gBAAE,oBAAoB,GAAG,IAAI,CAAC;QAClD,CAAC;QACD,OAAO,oBAAoB,CAAC;IAC9B,CAAC;IAEO,QAAQ,CAAC,IAA2B,EAAE,IAA2B;QACvE,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAI,IAAI,CAAC,OAAQ,CAAC,CAAC,CAAY,GAAI,IAAI,CAAC,OAAQ,CAAC,CAAC,CAAY,CAAC;YACzE,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxB,CAAC;IAEO,QAAQ,CAAC,UAAmC,EAAE,iBAAyB;QAC7E,OAAO,UAAU,CAAC,MAAM,GAAG,iBAAiB,EAAE,CAAC;YAC7C,IAAI,eAAe,GAAG,QAAQ,CAAC;YAC/B,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,OAAO,GAAG,QAAQ,CAAC;gBACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3C,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;wBACZ,MAAM,0BAA0B,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;wBAC/E,IAAI,0BAA0B,GAAG,OAAO;4BAAE,OAAO,GAAG,0BAA0B,CAAC;oBACjF,CAAC;gBACH,CAAC;gBACD,IAAI,OAAO,GAAG,eAAe,EAAE,CAAC;oBAC9B,eAAe,GAAG,OAAO,CAAC;oBAC1B,QAAQ,GAAG,CAAC,CAAC;gBACf,CAAC;YACH,CAAC;YACD,UAAU,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAEM,KAAK,CAAC,UAAmC,EAAE,WAAmB;QACnE,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QACvF,IAAI,cAAc,GAA4B,EAAE,CAAC;QAEjD,OAAO,cAAc,CAAC,MAAM,GAAG,MAAM,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/D,IAAI,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;YAEvD,IAAI,cAAc,CAAC,MAAM,GAAG,YAAY,CAAC,WAAW,CAAC,MAAM,IAAI,MAAM,EAAE,CAAC;gBACtE,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC;YACtF,CAAC;iBAAM,CAAC;gBACN,MAAM,MAAM,GAAG,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC;gBAC9C,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YAC7G,CAAC;YAED,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,CAAC;QAED,OAAO,cAAc,CAAC;IACxB,CAAC;CACF;AAvGD,kDAuGC"}

package/dist/optimization/search/portfolio/tournament/TournamentSelector.d.ts

@@ -0,0 +1,11 @@
+import { Individual } from '../../../population/Individual';
+import { Goal } from '../../Goal';
+export declare class TournamentSelector<G, P, F> {
+    private goals;
+    constructor(goals: Goal<Individual<G, P, F[]>, F>[]);
+    selectOne(population: Individual<G, P, F[]>[]): Individual<G, P, F[]>;
+    private selectParticipants;
+    private combat;
+    private selectRandomGoal;
+    private calculateStrength;
+}

package/dist/optimization/search/portfolio/tournament/TournamentSelector.js

@@ -0,0 +1,52 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TournamentSelector = void 0;
+class TournamentSelector {
+    constructor(goals) {
+        this.goals = goals;
+    }
+    selectOne(population) {
+        const participants = this.selectParticipants(population, 4);
+        const semifinalists = [
+            this.combat(participants[0], participants[1]),
+            this.combat(participants[2], participants[3])
+        ];
+        const winner = this.combat(semifinalists[0], semifinalists[1]);
+        return winner;
+    }
+    selectParticipants(population, count) {
+        const participants = [];
+        const indices = new Set();
+        while (indices.size < count) {
+            const randomIndex = Math.floor(Math.random() * population.length);
+            if (!indices.has(randomIndex)) {
+                indices.add(randomIndex);
+                participants.push(population[randomIndex]);
+            }
+        }
+        return participants;
+    }
+    combat(first, second) {
+        const goalIndex = this.selectRandomGoal();
+        const strength = this.calculateStrength(first, second, goalIndex);
+        const random = Math.random();
+        const winner = random < strength ? first : second;
+        return winner;
+    }
+    selectRandomGoal() {
+        return Math.floor(Math.random() * this.goals.length);
+    }
+    calculateStrength(firstIndividual, secondIndividual, goalIndex) {
+        const firstValue = Math.abs(firstIndividual.fitness[goalIndex]);
+        const secondValue = Math.abs(secondIndividual.fitness[goalIndex]);
+        const total = firstValue + secondValue;
+        let strength = firstValue / total;
+        const goal = this.goals[goalIndex];
+        const isMinimization = goal.getOrder().compare(firstIndividual.fitness[goalIndex], secondIndividual.fitness[goalIndex]) > 0;
+        if (isMinimization)
+            strength = 1 - strength;
+        return strength;
+    }
+}
+exports.TournamentSelector = TournamentSelector;
+//# sourceMappingURL=TournamentSelector.js.map

package/dist/optimization/search/portfolio/tournament/TournamentSelector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TournamentSelector.js","sourceRoot":"","sources":["../../../../../src/optimization/search/portfolio/tournament/TournamentSelector.ts"],"names":[],"mappings":";;;AAGA,MAAa,kBAAkB;IAG7B,YAAY,KAAuC;QACjD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAEM,SAAS,CAAC,UAAmC;QAClD,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,aAAa,GAAG;YACpB,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;SAC9C,CAAC;QACF,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,kBAAkB,CAAC,UAAmC,EAAE,KAAa;QAC3E,MAAM,YAAY,GAA4B,EAAE,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,OAAO,OAAO,CAAC,IAAI,GAAG,KAAK,EAAE,CAAC;YAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;YAClE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC9B,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBACzB,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,OAAO,YAAY,CAAC;IACtB,CAAC;IAEO,MAAM,CAAC,KAA4B,EAAE,MAA6B;QACxE,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QAClE,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QAClD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,gBAAgB;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACvD,CAAC;IAEO,iBAAiB,CAAC,eAAsC,EAAE,gBAAuC,EAAE,SAAiB;QAC1H,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,OAAQ,CAAC,SAAS,CAAW,CAAC,CAAC;QAC3E,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,OAAQ,CAAC,SAAS,CAAW,CAAC,CAAC;QAC7E,MAAM,KAAK,GAAG,UAAU,GAAG,WAAW,CAAC;QAEvC,IAAI,QAAQ,GAAG,UAAU,GAAG,KAAK,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACnC,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,eAAe,CAAC,OAAQ,CAAC,SAAS,CAAC,EAAE,gBAAgB,CAAC,OAAQ,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC;QAE9H,IAAI,cAAc;YAAE,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC;QAE5C,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAzDD,gDAyDC"}

package/dist/optimization/search/portfolio/variate/PortfolioMutation.d.ts

@@ -0,0 +1,8 @@
+import { Variation } from "../../variate/Variation";
+import { PortfolioSpace } from "../PortfolioSpace";
+export declare class PortfolioMutation extends Variation<number[]> {
+    constructor(space: PortfolioSpace);
+    arity(): number;
+    range_arity(): number;
+    protected variate(parents: number[][]): number[][];
+}

package/dist/optimization/search/portfolio/variate/PortfolioMutation.js

@@ -0,0 +1,26 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PortfolioMutation = void 0;
+const Variation_1 = require("../../variate/Variation");
+class PortfolioMutation extends Variation_1.Variation {
+    constructor(space) {
+        super(space);
+    }
+    arity() {
+        return 1;
+    }
+    range_arity() {
+        return 1;
+    }
+    variate(parents) {
+        let child = parents[0].slice();
+        let mutationProbability = 1.0 / child.length;
+        let restrictions = this.space.getRestrictions();
+        for (let i = 0; i < child.length; i++)
+            if (Math.random() < mutationProbability)
+                child[i] = (Math.random() * (restrictions.constraints[i].maxWeight - restrictions.constraints[i].minWeigth)) + restrictions.constraints[i].minWeigth;
+        return [child];
+    }
+}
+exports.PortfolioMutation = PortfolioMutation;
+//# sourceMappingURL=PortfolioMutation.js.map

package/dist/optimization/search/portfolio/variate/PortfolioMutation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PortfolioMutation.js","sourceRoot":"","sources":["../../../../../src/optimization/search/portfolio/variate/PortfolioMutation.ts"],"names":[],"mappings":";;;AAAA,uDAAoD;AAGpD,MAAa,iBAAkB,SAAQ,qBAAmB;IACtD,YAAY,KAAqB;QAC7B,KAAK,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IACM,KAAK;QACR,OAAO,CAAC,CAAC;IACb,CAAC;IACM,WAAW;QACd,OAAO,CAAC,CAAC;IACb,CAAC;IACS,OAAO,CAAC,OAAmB;QACjC,IAAI,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,mBAAmB,GAAW,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC;QACrD,IAAI,YAAY,GAAI,IAAI,CAAC,KAAwB,CAAC,eAAe,EAAE,CAAC;QACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;YACjC,IAAI,IAAI,CAAC,MAAM,EAAE,GAAG,mBAAmB;gBACnC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7J,OAAO,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;CACJ;AAnBD,8CAmBC"}

package/dist/optimization/search/portfolio/variate/PortfolioXOver.d.ts

@@ -0,0 +1,8 @@
+import { Variation } from "../../variate/Variation";
+import { PortfolioSpace } from "../PortfolioSpace";
+export declare class PortfolioXOver extends Variation<number[]> {
+    constructor(space: PortfolioSpace);
+    arity(): number;
+    range_arity(): number;
+    protected variate(parents: number[][]): number[][];
+}

package/dist/optimization/search/portfolio/variate/PortfolioXOver.js

@@ -0,0 +1,23 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PortfolioXOver = void 0;
+const Variation_1 = require("../../variate/Variation");
+class PortfolioXOver extends Variation_1.Variation {
+    constructor(space) {
+        super(space);
+    }
+    arity() {
+        return 2;
+    }
+    range_arity() {
+        return 2;
+    }
+    variate(parents) {
+        let point = Math.floor(Math.random() * parents[0].length);
+        let child1 = parents[0].slice(0, point).concat(parents[1].slice(point));
+        let child2 = parents[1].slice(0, point).concat(parents[0].slice(point));
+        return [child1, child2];
+    }
+}
+exports.PortfolioXOver = PortfolioXOver;
+//# sourceMappingURL=PortfolioXOver.js.map

package/dist/optimization/search/portfolio/variate/PortfolioXOver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PortfolioXOver.js","sourceRoot":"","sources":["../../../../../src/optimization/search/portfolio/variate/PortfolioXOver.ts"],"names":[],"mappings":";;;AAAA,uDAAoD;AAGpD,MAAa,cAAe,SAAQ,qBAAmB;IACnD,YAAY,KAAqB;QAC7B,KAAK,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IAEM,KAAK;QACR,OAAO,CAAC,CAAC;IACb,CAAC;IAEM,WAAW;QACd,OAAO,CAAC,CAAC;IACb,CAAC;IAES,OAAO,CAAC,OAAmB;QACjC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC1D,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACxE,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACxE,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5B,CAAC;CACJ;AAnBD,wCAmBC"}

package/dist/optimization/search/variate/Variation.d.ts

@@ -0,0 +1,9 @@
+import { Space } from "../Space";
+export declare abstract class Variation<T> {
+    protected space: Space<T>;
+    constructor(space: Space<T>);
+    abstract arity(): number;
+    abstract range_arity(): number;
+    apply(parents: T[]): T[];
+    protected abstract variate(parents: T[]): T[];
+}

package/dist/optimization/search/variate/Variation.js

@@ -0,0 +1,13 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Variation = void 0;
+class Variation {
+    constructor(space) {
+        this.space = space;
+    }
+    apply(parents) {
+        return this.space.repairMany(this.variate(parents));
+    }
+}
+exports.Variation = Variation;
+//# sourceMappingURL=Variation.js.map

package/dist/optimization/search/variate/Variation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Variation.js","sourceRoot":"","sources":["../../../../src/optimization/search/variate/Variation.ts"],"names":[],"mappings":";;;AAEA,MAAsB,SAAS;IAG3B,YAAY,KAAe;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACvB,CAAC;IAKM,KAAK,CAAC,OAAY;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IACxD,CAAC;CAGJ;AAfD,8BAeC"}

package/dist/sort/Order.d.ts

@@ -0,0 +1,4 @@
+export interface Order<T> {
+    compare(one: T, two: T): number;
+    equals(one: T, two: T): boolean;
+}

package/dist/sort/Order.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=Order.js.map

package/dist/sort/Order.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Order.js","sourceRoot":"","sources":["../../src/sort/Order.ts"],"names":[],"mappings":""}

package/dist/sort/ReversedOrder.d.ts

@@ -0,0 +1,7 @@
+import { Order } from "./Order";
+export declare class ReversedOrder<T> implements Order<T> {
+    protected originalOrder: Order<T>;
+    constructor(originalOrder: Order<T>);
+    compare(one: T, two: T): number;
+    equals(one: T, two: T): boolean;
+}

package/dist/sort/ReversedOrder.js

@@ -0,0 +1,16 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ReversedOrder = void 0;
+class ReversedOrder {
+    constructor(originalOrder) {
+        this.originalOrder = originalOrder;
+    }
+    compare(one, two) {
+        return this.originalOrder.compare(two, one);
+    }
+    equals(one, two) {
+        return this.originalOrder.equals(one, two);
+    }
+}
+exports.ReversedOrder = ReversedOrder;
+//# sourceMappingURL=ReversedOrder.js.map

package/dist/sort/ReversedOrder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReversedOrder.js","sourceRoot":"","sources":["../../src/sort/ReversedOrder.ts"],"names":[],"mappings":";;;AAEA,MAAa,aAAa;IAGtB,YAAY,aAAuB;QAC/B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACvC,CAAC;IAEM,OAAO,CAAC,GAAM,EAAE,GAAM;QACzB,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAChD,CAAC;IAEM,MAAM,CAAC,GAAM,EAAE,GAAM;QACxB,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC/C,CAAC;CACJ;AAdD,sCAcC"}

package/dist/sort/real/RealOrder.d.ts

@@ -0,0 +1,7 @@
+import { Order } from "../Order";
+export declare class RealOrder implements Order<number> {
+    private minimize;
+    constructor(minimize?: boolean);
+    compare(one: number, two: number): number;
+    equals(one: number, two: number): boolean;
+}

package/dist/sort/real/RealOrder.js

@@ -0,0 +1,18 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RealOrder = void 0;
+class RealOrder {
+    constructor(minimize) {
+        this.minimize = minimize !== null && minimize !== void 0 ? minimize : false;
+    }
+    compare(one, two) {
+        if (this.minimize)
+            return this.equals(one, two) ? 0 : (one < two ? 1 : -1);
+        return this.equals(one, two) ? 0 : (one < two ? -1 : 1);
+    }
+    equals(one, two) {
+        return Math.abs(one - two) < 1e-6; //Cami lo dejo en 1e-9
+    }
+}
+exports.RealOrder = RealOrder;
+//# sourceMappingURL=RealOrder.js.map

package/dist/sort/real/RealOrder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RealOrder.js","sourceRoot":"","sources":["../../../src/sort/real/RealOrder.ts"],"names":[],"mappings":";;;AAEA,MAAa,SAAS;IAGlB,YAAY,QAAkB;QAC1B,IAAI,CAAC,QAAQ,GAAG,QAAQ,aAAR,QAAQ,cAAR,QAAQ,GAAI,KAAK,CAAC;IACtC,CAAC;IAEM,OAAO,CAAC,GAAW,EAAE,GAAW;QACnC,IAAI,IAAI,CAAC,QAAQ;YACb,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IAEM,MAAM,CAAC,GAAW,EAAE,GAAW;QAClC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,sBAAsB;IAC7D,CAAC;CACJ;AAhBD,8BAgBC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "elemento-alpha-tools",
-  "version": "1.2.21",
+  "version": "1.2.22",
   "description": "Librería para los servicios de elemento alpha",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",
@@ -34,17 +34,17 @@
     "@types/express": "^5.0.5",
     "@types/jest": "^30.0.0",
     "@types/morgan": "^1.9.9",
-    "@types/node": "^24.9.2",
+    "@types/node": "^24.10.1",
     "jest": "^30.2.0",
-    "rimraf": "^6.0.1",
+    "rimraf": "^6.1.0",
     "ts-jest": "^29.4.5",
     "typescript": "^5.9.3"
   },
   "dependencies": {
-    "axios": "^1.13.1",
+    "axios": "^1.13.2",
     "crypto-js": "^4.2.0",
     "dotenv": "^17.2.3",
-    "itrm-tools": "^1.3.19",
+    "itrm-tools": "^1.3.22",
     "morgan": "^1.10.0"
   },
   "optionalDependencies": {