ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Sortierung

Digitale Medien

Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method (1999)

Dell'amico, Mauro ; Lodi, Andrea ; Maffioli, Francesco

Springer

Journal of heuristics 5 (1999), S. 123-143

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1572-9397

Schlagwort(e): metaheuristics ; linear assignment ; cumulative functions ; tabu search

Quelle: Springer Online Journal Archives 1860-2000

Thema: Mathematik

Notizen: 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.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1023/A:1009647225748

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer