Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Boston, MA, 1997.
S. Martello and P. Toth. An algorithm for the generalised assignment problem. In Proceedings of the 9th IFORS Conference, Hamburg, Germany, 1981.
I. Osman. Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches. OR Spektrum, 17:211–225, 1995.
M. Randall and D. Abramson. A general meta-heuristic solver for combinatorial optimisation problems. Journal of Compuautional Optimization and Applications, 20:185–210, 2001.
P. van Laarhoven and E. Aarts. Simulated Annealing: Theory and Applications. D Reidel Publishing Company, Dordecht, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Randall, M. (2003). A Template Approach to Producing Incremental Objective Cost Functions for Local Search Meta-heuristics. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_27
Download citation
DOI: https://doi.org/10.1007/3-540-36605-9_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00976-4
Online ISBN: 978-3-540-36605-8
eBook Packages: Springer Book Archive