An effective hybrid algorithm for the problem of packing circles into a larger containing circle |
| |
| Affiliation: | 1. Jiangsu Engineering Center of Network Monitoring, Nanjing University of Information Science & Technology, Nanjing 210044, China;2. School of Computer & Software, Nanjing University of Information Science & Technology, Nanjing 210044, China;3. Office of Informationization Construction and Management, Nanjing University of Information Science & Technology, Nanjing 210044, China;4. School of Mathematics and Statistics, Nanjing University of Information Science & Technology, Nanjing 210044, China |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
