zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
An effective hybrid algorithm for the problem of packing circles into a larger containing circle. (English) Zbl 1068.90095
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.

90C27Combinatorial optimization
90B40Search theory (optimization)
Tabu search
Full Text: DOI
[1] Garey, M. R.; Johnson, D. S.: Computers and intractability: a guide to the theory of NP-completeness. (1979) · Zbl 0411.68039
[2] Hochbaum, D. S.; Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the association for computing machinery 1, No. 32, 130-136 (1985) · Zbl 0633.68027
[3] Huaiqing, Wa.Ng.; Wenqi, Hu.An.G.; Quan, Zh.An.G.; Dongming, Xu.: An improved algorithm for the packing of unequal circles within a larger containing circle. European journal of operational research 141, 440-453 (2002) · Zbl 1081.90593
[4] Dowsland, K. A.; Dowsland, W. B.: Packing problems. European journal of operational research 56, No. 1, 2-14 (1992) · Zbl 0825.90355
[5] Lodi, A.; Martello, S.; Monaci, M.: Two-dimensional packing problemsa survey. European journal of operational research 141, 241-252 (2002) · Zbl 1081.90576
[6] Pisinger, D.: Heuristics for the container loading problem. European journal of operational research 141, 382-392 (2002) · Zbl 1081.90613
[7] Fleszar, K.; Hindi, K. S.: New heuristics for one-dimensional bin-packing. Computers & operations research 29, 821-839 (2002) · Zbl 0994.90134
[8] Dowsland, K. A.: Palletisation of cylinders in cases. Operations research spektrum 13, 171-172 (1991) · Zbl 0729.90912
[9] Fraser, H. J.; George, J. A.: Integrated container loading software for pulp and paper industry. European journal of operational research 77, 466-674 (1994) · Zbl 0800.90656
[10] Lubachevsky, D.; Graham, R. L.: Curved hexagonal packing of equal circles in a circle. Discrete & computational geometry 18, 179-194 (1997) · Zbl 0881.52010
[11] George, J. A.; George, J. M.; Lammar, B. W.: Packing different-sized circles into a rectangular container. European journal of operational research 84, 693-712 (1995) · Zbl 0928.90077
[12] Huang, We.Nq.I.; Kang, Ya.N.: A heuristic quasi-physical strategy for solving disks packing problem. Simulation modelling practice and theory 10, 195-207 (2002)
[13] Huang, We.Nq.I.; Zhan, Sh.Uh.Ao.: A quasi-physical method for solving packing problem. Acta mathematicae applagatae sinica 2, No. 2, 176-180 (1979)
[14] Huang, We.Nq.I.; Xu, Ru.Ch.U.: Two personification strategies for solving circles packing problem. Science in China (Series E) 29, No. 4, 347-353 (1999)
[15] Kirkpatrick, S.; Gelatt, C. D.; Vecchi, M. P.: Optimization by simulated annealing. Science 220, 671-689 (1983) · Zbl 1225.90162
[16] Glover, F.: Tabu searchpart I. ORSA journal on computing 11, No. 3, 190-206 (1989) · Zbl 0753.90054
[17] Glover, F.; Laguna, M.: Tabu search. Modern heuristic techniques for combinatorial problems, 70-150 (1993)
[18] Kang Lishan, et al. Non-numerical parallel algorithms: simulated annealing, vol. 1. Moscow: Science Press; 1998.
[19] Zhang, De.Fu.; Huang, We.Nq.I.; Wang, Ho.Ux.Ia.Ng.: Personification annealing algorithm for solving SAT problem. Chinese journal of computer 25, No. 2, 148-152 (2002)
[20] Huang, We.Nq.I.; Zhang, De.Fu.; Wang, Ho.Ux.Ia.Ng.: An algorithm based on tabu search for satisfiability problem. Journal of computer science and technology 17, No. 3, 340-346 (2002)