A Template Approach to Producing Incremental Objective Cost Functions for Local Search Meta-heuristics

  • Marcus Randall
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2611)


Meta-heuristic search techniques based on local search operators have proven to be very effective at solving combinatorial optimisation problems. A characteristic of local search operators is that they usually only make a small change to the solution state when applied. As a result, it is often unnecessary to re-evaluate the entire objective function once a transition is made but to use an incremental cost function. For example in the travelling salesman problem, the position of two cities within a tour, may be interchanged. Using an incremental cost function, this equates to an O(1) operation as opposed to an O(n) operation (where n is the number of cities). In this paper, a new approach based on the use of templates is developed for the generic linked list modelling system [4]. It demonstrates that incremental objective cost functions can be automatically generated for given problems using different local search operators.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Boston, MA, 1997.zbMATHGoogle Scholar
  2. 2.
    S. Martello and P. Toth. An algorithm for the generalised assignment problem. In Proceedings of the 9th IFORS Conference, Hamburg, Germany, 1981.Google Scholar
  3. 3.
    I. Osman. Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches. OR Spektrum, 17:211–225, 1995.zbMATHCrossRefGoogle Scholar
  4. 4.
    M. Randall and D. Abramson. A general meta-heuristic solver for combinatorial optimisation problems. Journal of Compuautional Optimization and Applications, 20:185–210, 2001.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    P. van Laarhoven and E. Aarts. Simulated Annealing: Theory and Applications. D Reidel Publishing Company, Dordecht, 1987.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Marcus Randall
    • 1
  1. 1.School of Information TechnologyBond UniversityAustralia

Personalised recommendations