Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1068.90095
Zhang, De-fu; Deng, An-sheng
An effective hybrid algorithm for the problem of packing circles into a larger containing circle. (English)
[J] Comput. Oper. Res. 32, No. 8, 1941-1951 (2005). ISSN 0305-0548

Summary: Simulated annealing is a powerful stochastic search method, but it still has the disadvantage of blind search. Tabu search (TS) which can prevent cycling and enhance diversification, is an adaptive strategy based on tabu list. By reasonably combining simulated annealing with TS, an effective hybrid algorithm for the problem of packing circles into a larger containing circle is presented. Based on a special neighborhood and tabu strategy, some benchmark problem instances can be well solved by the presented hybrid algorithm, and the computational results can compete with the best literature results.

MSC 2000:: *90C27 Combinatorial programming
90B40 Search theory

Keywords: Packing problem; Simulated annealing; Tabu search; NP-hard

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

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

Advanced Search

Zentralblatt MATH Berlin [Germany]