首页 | 本学科首页   官方微博 | 高级检索  
     

一种求解随机线性二层规划问题的分支定界-粒子群混合算法
引用本文:张涛. 一种求解随机线性二层规划问题的分支定界-粒子群混合算法[J]. 西南师范大学学报(自然科学版), 2018, 43(6): 37-45
作者姓名:张涛
作者单位:长江大学信息与数学学院
基金项目:国家自然科学基金资助项目(61673006);国家留学基金委资助出国留学项目(201708420111).
摘    要:将一类随机线性二层规划模型转换为带期望约束的确定性线性二层协方差规划模型,并进一步利用KKT条件将二层协方差规划模型转化为单层规划模型,然后利用分支定界-粒子群混合算法对该模型进行求解.与传统分支定界算法的对比实验表明,该算法有效改善了上层问题的方差结果,且计算效率得到了较显著提高.

关 键 词:随机线性二层规划  带期望约束的二层协方差模型  粒子群优化算法  分支定界算法
收稿时间:2017-12-04

A Particle Swarm Optimization-Branch and Bound Algorithm for the Linear Stochastic Bilevel Programming Problem
ZHANG Tao. A Particle Swarm Optimization-Branch and Bound Algorithm for the Linear Stochastic Bilevel Programming Problem[J]. Journal of southwest china normal university(natural science edition), 2018, 43(6): 37-45
Authors:ZHANG Tao
Affiliation:School of Information and Mathematics, Yangtze University, Jingzhou Hubei 434023, China
Abstract:First, a class of stochastic linear bilevel programming models is transformed into a deterministic linear bilevel covariance programming model with expected constraints. Then, using the KKT condition, the deterministic bilevel covariance programming problem is transformed into a deterministic single level programming problem. After that, the single level programming problem is solved by the particle swarm optimization-branch and bound algorithm. The results of a comparative experiment show that the proposed algorithm can improve the variance results of the upper level problem and significantly increase the computational efficiency.
Keywords:linear stochastic bilevel programming  bilevel variance model with expectation constraints  particle swarm optimization algorithm  branch and bound method
本文献已被 CNKI 等数据库收录!
点击此处可从《西南师范大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《西南师范大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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