.png){kind=icon}
返回
A new heuristic algorithm for the circular packing problem with equilibrium constraints
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-011-4351-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The circular packing problem with equilibrium constraints is an optimization problem about simplified satellite module layout design. A heuristic algorithm based on tabu search is put forward for solving this problem. The algorithm begins from a random initial configuration and applies the gradient method with an adaptive step length to search for the minimum energy configuration. To jump out of the local minima and avoid the search doing repeated work, the algorithm adopts the strategy of tabu search. In the process of tabu search, we improve the traditional neighboring solutions, tabu objects and the acceptance criteria of the current solution effectively. We test two sets of benchmarks consisting of 11 representative instances from the current literature. The numerical results show that the proposed algorithm breaks the records in seven out of 11 instances, and obtains the optimal solutions for the other four instances.
Keyword:
equilibrium constraints
packing problem
heuristic algorithm
tabu search
layout optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
暂无机构信息
引用论文
.png){kind=icon}
Metaheuristics in combinatorial optimization: Overview and conceptual comparison组合优化中的元启发式: 概述和概念比较
PREAI
分享收藏Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II)，Pb(II) 和Cd(II) 离子的吸附
PREAI
分享收藏Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints
PREAI
分享收藏
查看更多内容