奖励收集斯坦利最小树的混合拉格朗日与分散搜索算法  

Hybrid Lagrange and scatter-search algorithm for prize-collecting Steiner tree problem

作　　者：潘常春[1] 杨根科[1] 

机构地区：[1]上海交通大学自动化系,上海200240

出　　处：《控制与决策》2007年第12期1341-1346,共6页Control and Decision

基　　金：国家自然科学基金项目(60574063)

摘　　要：针对PCSTP问题,提出了HLGSS混合算法.通过拉格朗日松弛策略,将PCSTP问题转化为简单的CMST问题;然后由Volume算法求解PCSTP的拉格朗日对偶问题并获得其下界.用SS算法优化原问题的可行解,利用求解拉格朗日对偶问题过程中获得的原始-对偶信息来指导SS算法的搜索.仿真结果表明,HLGSS比SS降低了算法的搜索空间,加速了算法的收敛性.The HLGSS is proposed for the PCSTP. The problem is transformed into an easier tractable CMST problem by using the method of Lagrange relaxation. A lower bound is obtained by solving the Lagrange dual problem and using the Volume algorithm. Then, the SS algorithm is used to optimize the feasible solutions of the PCSTP. The primal-dual information produced during solving the Lagrange-dual problem is exploited to guard the SS algorithm in the underlying procedure. The simulation results show that the proposed algorithm intensifies the search in the most promising regions of the solution space and thus speeds up the search time comparing with the SS algorithm.

关 键 词：奖励收集斯坦利最小树 拉格朗日松弛 分散搜索 混合算法 

分 类 号：O232[理学—运筹学与控制论]