ISSN:
1572-9397
Keywords:
metaheuristics
;
linear assignment
;
cumulative functions
;
tabu search
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract The Cumulative Assignment Problem is an NP-complete problem obtained by substituting the linear objective function of the classic Linear Assignment Problem, with a non-linear cumulative function. In this paper we present a first attempt to solve the Cumulative Assignment Problem with metaheuristic techniques. In particular we consider two standard techniques, namely the Simulated Annealing and the Multi-Start methods, and we describe the eXploring Tabu Search: a new structured Tabu Search algorithm which uses an iterative multi-level approach to improve the search. The new method is analyzed through extensive computational experiments and proves to be more effective than the standard methods.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1009647225748
Permalink
