當前位置: 首頁>>代碼示例>>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;未經允許,請勿轉載。