- Type Parameters:
V
- Variable
T
- Value
- All Implemented Interfaces:
- CanHoldContext, HasAssignmentContext<V,T,NeighbourSearch.NeighbourSearchContext>, NeighbourSelection<V,T>, LazyNeighbour.LazyNeighbourAcceptanceCriterion<V,T>, SolutionListener<V,T>
public class StepCountingHillClimber<V extends Variable<V,T>,T extends Value<V,T>>
extends HillClimber<V,T>
Step counting hill climber. Unlike with the ordinary hill climber, there is a bound.
The bound is updated (to the value of the current solution) after a given number of
moves. Based on the given mode, either all moves, only accepted moves, or only improving
moves are counted.
- Version:
- IFS 1.3 (Iterative Forward Search)
Copyright (C) 2014 Tomáš Müller
muller@unitime.org
http://muller.unitime.org
This library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation; either version 3 of the
License, or (at your option) any later version.
This library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not see
http://www.gnu.org/licenses/.
- Author:
- Tomáš Müller