Journal of Mathematical Modelling and Algorithms

, Volume 3, Issue 2, pp 167–178

The Attribute Based Hill Climber

Authors

  • Ian M. Whittley
    • School of Computing SciencesUniversity of East Anglia (UEA)
  • George D. Smith
    • School of Computing SciencesUniversity of East Anglia (UEA)
Article

DOI: 10.1023/B:JMMA.0000036583.17284.02

Cite this article as:
Whittley, I.M. & Smith, G.D. Journal of Mathematical Modelling and Algorithms (2004) 3: 167. doi:10.1023/B:JMMA.0000036583.17284.02

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 searchmetaheuristicsaspirationtravelling salesman problemquadratic assignment problem

Copyright information

© Kluwer Academic Publishers 2004