Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating t...Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating the moving of elastic objects, which can avoid the blindness of simulatedannealing search and make iteration process converge fast. Inspired by the life experiences of people,an e?ective personified strategy to jump out of local minima is given. Based on the simulatedannealing idea and personification strategy, an e?ective personified annealing algorithm for circlespacking problem is developed. Numerical experiments on benchmark problem instances show thatthe proposed algorithm outperforms the best algorithm in the literature.展开更多
文摘Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating the moving of elastic objects, which can avoid the blindness of simulatedannealing search and make iteration process converge fast. Inspired by the life experiences of people,an e?ective personified strategy to jump out of local minima is given. Based on the simulatedannealing idea and personification strategy, an e?ective personified annealing algorithm for circlespacking problem is developed. Numerical experiments on benchmark problem instances show thatthe proposed algorithm outperforms the best algorithm in the literature.
