/*
 * Copyright 2015 Thiago Nascimento
 * 
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 *     http://www.apache.org/licenses/LICENSE-2.0
 *     
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package mmo.metaheuristic.single;

import mmo.problem.Problem;
import mmo.solution.Solution;

/**
 * Hill Climbing Algorithm
 * 
 * @author Thiago Nascimento
 * @since 2015-03-17
 * @version 1.0
 */
public class HillClimbing extends SingleSolution {

	@Override
	public Solution solve(Problem p) {
		Solution s = p.generateRandomSolution();

		while (!terminationCondition()) {
			Solution r = tweak(p, copy(s));

			if (p.evaluate(r) < p.evaluate(s)) {
				s = r;
			}
		}

		return s;
	}

	protected Solution tweak(Problem p, Solution s) {
		return p.generateNeighborhoodSolution(s);
	}

	protected Solution copy(Solution s) {
		return s.clone();
	}
}
