tycho-solver
Version:
Evolutionary computation and optimization library
73 lines (72 loc) • 3.32 kB
JavaScript
;
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.SearchLoopOperator = void 0;
const SequentialOperator_1 = require("../../core/pipeline/SequentialOperator");
const SearchLoopOperator = (_a) => __awaiter(void 0, [_a], void 0, function* ({ currentSolution, currentFitness, objectiveFunction, neighborhoodFunction, options, iterations = 0, evaluationOperator, neighborhoodOperator, terminationOperator }) {
var _b;
// Step 1: Evaluation
const evaluationStep = {
apply: (solution) => __awaiter(void 0, void 0, void 0, function* () { return yield evaluationOperator.evaluate(solution); })
};
// Step 2: Neighborhood move
const neighborhoodStep = {
apply: (_a) => __awaiter(void 0, [_a], void 0, function* ({ solution, fitness }) {
return yield neighborhoodOperator({
solution,
fitness,
neighborhoodFunction,
objectiveFunction,
options,
iterations
});
})
};
// Compose pipeline
const pipeline = new SequentialOperator_1.SequentialOperator([
{
apply: (input) => __awaiter(void 0, void 0, void 0, function* () {
const fitness = input.fitness !== undefined ? input.fitness : yield evaluationStep.apply(input.solution);
return { solution: input.solution, fitness };
})
},
neighborhoodStep
]);
let state = { solution: currentSolution, fitness: currentFitness };
const useDynamic = !!options.dynamicNeighborhoodFunction;
const maxIterations = (_b = options.maxIterations) !== null && _b !== void 0 ? _b : 1000;
while (true) {
const next = yield pipeline.apply(state);
const terminatedAfterMove = terminationOperator.shouldTerminate({
solution: next.solution,
fitness: next.fitness,
options,
iterations
});
if (!next || terminatedAfterMove || (!useDynamic && next.solution === state.solution)) {
return {
solution: next ? next.solution : state.solution,
fitness: next ? next.fitness : state.fitness,
iterations
};
}
state = { solution: next.solution, fitness: next.fitness };
iterations++;
if (useDynamic && iterations >= maxIterations) {
return {
solution: state.solution,
fitness: state.fitness,
iterations
};
}
}
});
exports.SearchLoopOperator = SearchLoopOperator;