Package net.sf.cpsolver.ifs.model

Examples of net.sf.cpsolver.ifs.model.Neighbour

132
133
134
135
136
137
138
139
140
141
142
    }

    /** Neighbour selection  -- based on the phase, construction strategy is used first,
     * than it iterates between two or three given neighbour selections*/
    public Neighbour selectNeighbour(Solution solution) {
        Neighbour n = null;
        switch (iPhase) {
            case 0:
                n = iConstruct.selectNeighbour(solution);
                if (n != null)
                    return n;
View Full Code Here
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
                    ns = (NeighbourSelector)e.nextElement();
                    points -= (iUpdatePoints?ns.getPoints():ns.getBonus());
                    if (points<=0) break;
                }
            }
            Neighbour n = ns.selectNeighbour(solution);
            if (n!=null) {
                if (n instanceof ItcLazyNeighbour) {
                    ((ItcLazyNeighbour)n).setAcceptanceCriterion(this);
                    return n;
                } else if (n.value()<=0.0) return n;
            }
        }
        iIter = 0; iLastImprovingIter = 0; iT0 = -1;
        return null;
    }
View Full Code Here
237
238
239
240
241
242
243
244
245
246
247
         * update stats if desired.
         */
        public Neighbour selectNeighbour(Solution solution) {
            if (iUpdate) {
                long t0 = System.currentTimeMillis();
                Neighbour n = iSelection.selectNeighbour(solution);
                long t1 = System.currentTimeMillis();
                update(n, t1-t0);
                return n;
            } else
                return iSelection.selectNeighbour(solution);
View Full Code Here
231
232
233
234
235
236
237
238
239
240
                    points -= (iUpdatePoints ? ns.getPoints() : ns.getBonus());
                    if (points <= 0)
                        break;
                }
            }
            Neighbour n = ns.selectNeighbour(solution);
            if (n != null)
                return n;
        }
    }
View Full Code Here
274
275
276
277
278
279
280
281
282
283
284
        return false;
    }

    /** Neighbour selection */
    public Neighbour selectNeighbour(Solution solution) {
        Neighbour neighbour = null;
        while ((neighbour = genMove(solution)) != null) {
            iMoves++;
            if (accept(solution, neighbour)) {
                iAcceptedMoves++;
                break;
View Full Code Here
261
262
263
264
265
266
267
268
269
                    ns = (NeighbourSelector)e.nextElement();
                    points -= (iUpdatePoints?ns.getPoints():ns.getBonus());
                    if (points<=0) break;
                }
            }
            Neighbour n = ns.selectNeighbour(solution);
            if (n!=null) return n;
        }
    }
View Full Code Here
311
312
313
314
315
316
317
318
319
320
321
322
323
324
        return false;
    }
   
    /** Neighbour selection */
    public Neighbour selectNeighbour(Solution solution) {
        Neighbour neighbour = null;
        while ((neighbour=genMove(solution))!=null) {
            if (sInfo) {
                iMoves++; iAbsValue += neighbour.value() * neighbour.value();
            }
            if (accept(solution,neighbour)) break;
        }
        return (neighbour==null?null:neighbour);
    }
View Full Code Here
TOP

Related Classes of net.sf.cpsolver.ifs.model.Neighbour

  • net.sf.cpsolver.itc.heuristics.ItcNeighbourSelection
  • net.sf.cpsolver.itc.heuristics.search.ItcGreatDeluge
  • net.sf.cpsolver.itc.heuristics.search.ItcHillClimber
  • net.sf.cpsolver.itc.heuristics.search.ItcHillClimber$NeighbourSelector
  • net.sf.cpsolver.itc.heuristics.search.ItcSimulatedAnnealing
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.