tycho-solver
Version:
Evolutionary computation and optimization library
31 lines (30 loc) • 1.71 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.AcceptanceOperator = void 0;
const AcceptanceOperator = (_a) => __awaiter(void 0, [_a], void 0, function* ({ candidateSolution, candidateFitness, currentSolution, currentFitness, options, isTie, isCostImprovement, iterations = 0 }) {
// Accept improvement or tie with cost improvement
const accepted = (options.maximize ? candidateFitness > currentFitness : candidateFitness < currentFitness)
|| (isTie && isCostImprovement);
const nextSolution = accepted ? candidateSolution : currentSolution;
const nextFitness = accepted ? candidateFitness : currentFitness;
// Call onClimb if improvement
if (accepted && options.onClimb) {
yield options.onClimb(nextSolution, nextFitness, iterations);
}
// Return updated solution, fitness, and iterations
return {
solution: nextSolution,
fitness: nextFitness,
iterations
};
});
exports.AcceptanceOperator = AcceptanceOperator;