Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0876.90080
Soriano, P.; Gendreau, M.
Foundations and applications of tabu search methods. (Fondements et applications des méthodes de recherche avec tabous.) (French)
[J] RAIRO, Rech. Opér. 31, No.2, 133-159 (1997). ISSN 0399-0559

Summary: Among the new general heuristics developed over recent years in the field of combinatorial optimization, the tabu search method (TS) due to Glover has been found to be very promising having been successfully applied to several difficult problems. TS is in fact a meta-heuristic which combines a local search procedure with a number of rules and mechanisms that enable it to overcome the obstacle of local optimality while preventing it from cycling. In this paper, we present a description of the principles underlying the TS method and of its various elements. A review of the main applications of TS to date is also provided.

MSC 2000:: *90C27 Combinatorial programming

Keywords: approximate algorithms; combinatorial optimization; tabu search; meta-heuristic; local search

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]