QQ客服 官方微博 反馈留言

	A simulated annealing algorithm for the circles packing problem
	Zhang, D. F. ; Huang, W. Q. ; Zhang DF(张德富)
	2004
英文摘要	We present a heuristic simulated annealing algorithm to solve the circles packing problem. For constructing a special neighborhood and jumping out of the local minimum trap, some effective heuristic strategies are presented. These strategies are from nature and can allow the iterative process to converge fast. The HSA algorithm inherits the merit of the simulated annealing algorithm, and can avoid the disadvantage of blind search in the simulated annealing algorithm to some extent according to the special neighborhood. The computational results show that the performance of the presented algorithm outperforms that of the quasi-physical quasi-human algorithm.
语种	英语
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/70924]
专题	信息技术－已发表论文
推荐引用方式 GB/T 7714	Zhang, D. F.,Huang, W. Q.,Zhang DF. A simulated annealing algorithm for the circles packing problem[J],2004.
APA	Zhang, D. F.,Huang, W. Q.,&张德富.(2004).A simulated annealing algorithm for the circles packing problem..
MLA	Zhang, D. F.,et al."A simulated annealing algorithm for the circles packing problem".(2004).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。