Article

Journal of Mathematical Modelling and Algorithms

, Volume 3, Issue 2, pp 167-178

First online:

The Attribute Based Hill Climber

  • Ian M. WhittleyAffiliated withSchool of Computing Sciences, University of East Anglia (UEA)
  • , George D. SmithAffiliated withSchool of Computing Sciences, University of East Anglia (UEA)

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper we introduce the Attribute Based Hill Climber, a parameter-free algorithm that provides a concrete, stand-alone implementation of a little used technique from the Tabu Search literature known as “regional aspiration”. Results of applying the algorithm to two classical optimisation problems, the Travelling Salesman Problem and the Quadratic Assignment Problem, show it to be competitive with existing general purpose heuristics in these areas.

local search metaheuristics aspiration travelling salesman problem quadratic assignment problem