An effective hybrid algorithm for the problem of packing circles into a larger containing circle

作者：Zhang DF^*; Deng AS

来源：Computers & Operations Research, 2005, 32(8): 1941-1951.

DOI：10.1016/j.cor.2003.12.006

• packing problem
• simulated annealing
• tabu search
• NP-hard

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.

• 出版日期2005-8
• 单位厦门大学