A new heuristic algorithm for the circular packing problem with equilibrium constraints  被引量:5

A new heuristic algorithm for the circular packing problem with equilibrium constraints

在线阅读下载全文

作  者:LIU JingFa LI Gang GENG HuanTong 

机构地区:[1]School of Computer and Software,Nanjing University of Information Science & Technology,Nanjing 210044,China [2]Network Information Center,Nanjing University of Information Science & Technology, Nanjing 210044,China [3]School of Mathematics and Physics,Nanjing University of Information Science & Technology,Nanjing 210044,China

出  处:《Science China(Information Sciences)》2011年第8期1572-1584,共13页中国科学(信息科学)(英文版)

基  金:supported by China Postdoctoral Science Foundation(Grant No.20100471350);the Natural Science Foundation of Jiangsu Province(Grant No.BK2010570);the Natural Science Foundation of Education Committee of Jiangsu Province(Grant No.09KJB520008);the National Public Benefit Research Foundation of China(Grant No.GYHY200906006);Jiangsu Planned Projects for Postdoctoral Research Foundations(GrantNo.1001030B);Qing Lan Project

摘  要: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.

关 键 词:equilibrium constraints packing problem heuristic algorithm tabu search layout optimization 

分 类 号:TP391[自动化与计算机技术—计算机应用技术] O223[自动化与计算机技术—计算机科学与技术]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象