当前位置: 首页>>代码示例>>Java>>正文


Java NeighbourSelection.init方法代码示例

本文整理汇总了Java中org.cpsolver.ifs.heuristics.NeighbourSelection.init方法的典型用法代码示例。如果您正苦于以下问题:Java NeighbourSelection.init方法的具体用法?Java NeighbourSelection.init怎么用?Java NeighbourSelection.init使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在org.cpsolver.ifs.heuristics.NeighbourSelection的用法示例。


在下文中一共展示了NeighbourSelection.init方法的4个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: init

import org.cpsolver.ifs.heuristics.NeighbourSelection; //导入方法依赖的package包/类
@Override
public void init(Solver<V, T> solver) {
    super.init(solver);
    iProgress = Progress.getInstance(solver.currentSolution().getModel());
    iSolver = solver;
    solver.currentSolution().addSolutionListener(this);
    // solver.setUpdateProgress(false);
    for (NeighbourSelection<V, T> neighbour: iNeighbours)
        neighbour.init(solver);
    iTotalBonus = 0;
    for (NeighbourSelector<V,T> s: iNeighbours) {
        s.init(solver);
        iTotalBonus += s.getBonus();
    }
}
 
开发者ID:UniTime,项目名称:cpsolver,代码行数:16,代码来源:NeighbourSearch.java

示例2: init

import org.cpsolver.ifs.heuristics.NeighbourSelection; //导入方法依赖的package包/类
/** Initialization */
@Override
public void init(Solver<Exam, ExamPlacement> solver) {
    super.init(solver);
    solver.currentSolution().addSolutionListener(this);
    for (NeighbourSelection<Exam, ExamPlacement> neighbour: iNeighbours)
        neighbour.init(solver);
    solver.setUpdateProgress(false);
    iProgress = Progress.getInstance(solver.currentSolution().getModel());
    getContext(solver.currentSolution().getAssignment()).reset();
}
 
开发者ID:UniTime,项目名称:cpsolver,代码行数:12,代码来源:ExamGreatDeluge.java

示例3: init

import org.cpsolver.ifs.heuristics.NeighbourSelection; //导入方法依赖的package包/类
/**
 * Initialization
 */
@Override
public void init(Solver<Exam, ExamPlacement> solver) {
    super.init(solver);
    iReheatLength = Math.round(iReheatLengthCoef * iTemperatureLength);
    iRestoreBestLength = Math.round(iRestoreBestLengthCoef * iTemperatureLength);
    solver.currentSolution().addSolutionListener(this);
    for (NeighbourSelection<Exam, ExamPlacement> neighbour: iNeighbours)
        neighbour.init(solver);
    solver.setUpdateProgress(false);
    iProgress = Progress.getInstance(solver.currentSolution().getModel());
}
 
开发者ID:UniTime,项目名称:cpsolver,代码行数:15,代码来源:ExamSimulatedAnnealing.java

示例4: init

import org.cpsolver.ifs.heuristics.NeighbourSelection; //导入方法依赖的package包/类
/**
 * Initialization
 */
@Override
public void init(Solver<Exam, ExamPlacement> solver) {
    super.init(solver);
    solver.currentSolution().addSolutionListener(this);
    for (NeighbourSelection<Exam, ExamPlacement> neighbour: iNeighbours)
        neighbour.init(solver);
    solver.setUpdateProgress(false);
    iProgress = Progress.getInstance(solver.currentSolution().getModel());
    getContext(solver.currentSolution().getAssignment()).reset();
}
 
开发者ID:UniTime,项目名称:cpsolver,代码行数:14,代码来源:ExamHillClimbing.java


注:本文中的org.cpsolver.ifs.heuristics.NeighbourSelection.init方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。