首页 | 官方网站   微博 | 高级检索  
     

带静不平衡约束的正交矩形布局问题的启发式模拟退火算法*
引用本文:刘景发,张振,薛羽,刘文杰,蒋宇聪.带静不平衡约束的正交矩形布局问题的启发式模拟退火算法*[J].模式识别与人工智能,2015,28(7):626-632.
作者姓名:刘景发  张振  薛羽  刘文杰  蒋宇聪
作者单位:1.南京信息工程大学 江苏省网络监控工程中心 南京 210044
2.南京信息工程大学 计算机与软件学院 南京 210044
3.南京信息工程大学 网络信息中心 南京 210044
基金项目:国家自然科学基金项目(No.61403206,61373016,41275117)、江苏省自然科学基金项目(No.BK20141005)、江苏省“六大人才高峰”项目(No.DZXX-041)资助
摘    要:以卫星舱布局为背景,研究一类带静不平衡约束的正交矩形布局问题.借鉴拟物策略,定义矩形与矩形、矩形与圆形容器之间的嵌入度计算公式,将该问题转变为无约束的优化问题.通过将启发式格局更新策略、基于梯度法的局部搜索机制与具有全局优化功能的模拟退火算法相结合,提出一种求解带静不平衡约束的正交矩形布局问题的启发式模拟退火算法.算法中的启发式格局更新策略产生新格局和跳坑,梯度法搜索新格局附近能量更低的格局.另外,在布局优化过程中,通过在挤压弹性势能的基础上增加静不平衡量惩罚项,并采用质心平移的方法,使布局系统的静不平衡量达到约束要求.实验表明,文中算法是一种解决带静不平衡约束的正交矩形布局问题的有效算法.

关 键 词:静不平衡约束  正交矩形布局  模拟退火算法  梯度法  
收稿时间:2014-05-26

Heuristic Simulated Annealing Algorithm for Orthogonal Rectangle Packing Problem with Static Non-Equilibrium Constraints
LIU Jing-Fa,ZHANG Zhen,XUE Yu,LIU Wen-Jie,JIANG Yu-Cong.Heuristic Simulated Annealing Algorithm for Orthogonal Rectangle Packing Problem with Static Non-Equilibrium Constraints[J].Pattern Recognition and Artificial Intelligence,2015,28(7):626-632.
Authors:LIU Jing-Fa  ZHANG Zhen  XUE Yu  LIU Wen-Jie  JIANG Yu-Cong
Affiliation:1.Jiangsu Engineering Center of Network Monitoring, Nanjing University of Information Science and Technology, Nanjing 210044
2.School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing 210044
3.Network Information Center, Nanjing University of Information Science and Technology, Nanjing 210044
Abstract:With the background of the satellite module layout, the orthogonal rectangle packing problem with static non-equilibrium constraints is studied. By drawing lessons from quasiphysical strategy and defining embedded computing formula between each two rectangles, and between the rectangle and the circular container, this problem is converted into an unconstrained optimization problem. By incorporating heuristic configuration update strategies, local search strategy based on the gradient method and the simulated annealing algorithm with global optimization, a heuristic simulated annealing algorithm for orthogonal rectangle packing problem with static non-equilibrium constraints is put forward.The heuristic configuration update strategies in this algorithm produce new configurations and jump out of trap. The gradient method is searched for lower-energy minima near newly generated configurations. In addition, in the process of layout optimization, a static non-equilibrium penalty term on the basis of the extrusive elastic energy is introduced. Subsequently, by adopting the translation of the center of mass, the static non-equilibrium constraints of the whole system can be satisfied. The experimental results show that the proposed algorithm is an effective algorithm for solving the orthogonal rectangle packing problem with static non-equilibrium constraints.
Keywords:Static Non-Equilibrium Constraint  Orthogonal Rectangle Packing  Simulated Annealing Algorithm  Gradient Method  
点击此处可从《模式识别与人工智能》浏览原始摘要信息
点击此处可从《模式识别与人工智能》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号