.png){kind=icon}
返回
Two-dimensional equilibrium constraint layout using simulated annealing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2010.06.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper studies the layout optimization problem with equilibrium constraint. It is a two-dimensional packing problem with the industrial background of simplified satellite module layout design, and is known as NP-hard problem. By incorporating the heuristic neighborhood search mechanism and the adaptive gradient method into the simulated annealing procedure, a heuristic simulated annealing algorithm is put forward for this problem. The special neighborhood search mechanism can avoid the disadvantage of blind search in the simulated annealing algorithm, and the adaptive gradient method is used to execute local search and speed up finding the global optimal solution. Numerical examples are illustrated to verify the effectiveness of the proposed algorithm. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Packing problem
Equilibrium constraint
Layout optimization
Simulated
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
Metaheuristics in combinatorial optimization: Overview and conceptual comparison组合优化中的元启发式: 概述和概念比较
PREAI
分享收藏分享收藏Evaluation of Spinal Laminar Fixation by a New, Flexible Stainless Steel Cable (Sof'wire).png)
Neurosurgery
NeurosurgeryIF0
PREAI
分享收藏Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints
PREAI
分享收藏
查看更多内容