期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Discrete differential evolution algorithm for integer linear bilevel programming problems 被引量:1
1
作者 Hong Li Li Zhang Yongchang Jiao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2016年第4期912-919,共8页
A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forc... A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forced to be integer. An integer coding for upper level variables is adopted, and then a discrete differential evolution algorithm with an improved feasibility-based comparison is developed to directly explore the integer solution at the upper level. For a given upper level integer variable, the lower level integer programming problem is solved by the existing branch and bound algorithm to obtain the optimal integer solution at the lower level. In the same framework of the algorithm, two other constraint handling methods, i.e. the penalty function method and the feasibility-based comparison method are also tested. The experimental results demonstrate that the discrete differential evolution algorithm with different constraint handling methods is effective in finding the global optimal integer solutions, but the improved constraint handling method performs better than two compared constraint handling methods. 展开更多
关键词 discrete linear bilevel programming problem discrete differential evolution constraint handling method branch and bound algorithm
下载PDF
MULTI-AGENT PARALLEL COMPUTATIONAL MODEL BASED ON DDM
2
作者 MINGYUAN JIN LISHAN KANG DECHUN PENG(State Key Laboratory of Software Engineering mahan University mahan, 430072, P. K of China) 《Wuhan University Journal of Natural Sciences》 CAS 1996年第Z1期391-396,共6页
The parallel algorithms based on domain decomposition method (DDM) have become one of foundations of asynchronous parallel algorithms on MIMD computers for large-scale scientific computations. We can find in this pape... The parallel algorithms based on domain decomposition method (DDM) have become one of foundations of asynchronous parallel algorithms on MIMD computers for large-scale scientific computations. We can find in this paper that DDM can also become the foundations of Object-Oriented parallel computational model for larch-scale scientific computations, In the paper, Multi-Agent parallel computational model based on DDNI is proposed. The implements of software environment on the model for solving elliptic pantal differential equations can be got from the paper. Especially an application instance for solving Dirichlet problems of Poisson equation is given. Some conclusions are drawn in the end. 展开更多
关键词 Domain Decomposition .Agent. program evolution program Packaged
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部