| 多目标动态规划时段轮换并行算法 |
| |
| 引用本文： | 康一梅, 吴沧浦. 多目标动态规划时段轮换并行算法. 自动化学报, 1994, 20(5): 561-569. |
| |
| 作者姓名： | 康一梅 吴沧浦 |
| |
| 作者单位： | 1.中科院自动化所,北京;;;2.北京理工大学自控系,北京 |
| |
| 摘 要： | 针对SIMD和MIMD结构的并行机提出多目标动态规划时段轮换并行算法,多目标动态规划的时段轮换迭代算法,将全过程优化问题转化成子过程优化问题,然后在子过程非劣解集中寻找全过程非劣解.这样,将多目标动态规划内存不足的问题转化成时间问题,然后利用并行机超高速运算的优势来有效地解决内存不足问题.通过时间复杂性、加速比分析及实例.说明了算法的有效性及优越性.
|
| 关 键 词： | 并行算法 时间复杂性 加速比 时段轮换 |
| 收稿时间： | 1992-12-09 |
Time Cycling Parallel Algorithm of Multiobjective Dynamic Programming |
| |
| Kang Yimei, Wu Cangpu. Time Cycling Parallel Algorithm of Multiobjective Dynamic Programming. ACTA AUTOMATICA SINICA, 1994, 20(5): 561-569. |
| |
| Authors: | Kang Yimei Wu Cangpu |
| |
| Affiliation: | 1. Institute of Automation,Chinese Academy of Sciences Beijing;Department of Automatic Control,Beijing Institute of Technology |
| |
| Abstract: | Time cycling parallel algorithm of multiobjective dynamic programming are presented for SIMD and MIMD parallel computers, respectively. The time cycling algorithm of multiobjective dynamic programming is such a method that transforms the optimization problem of whole procedure into the optimization problem of subprocedures, then finds the non-inferior solutions of whole procedure in the set of the non-inferior solutions of subprocedures. With this idea, the problem of memories of multiobjective dynamic programming can be transformed into a problem of time,then the problem can be solved effectively through parallel computers with very high computing speeds. |
| |
| Keywords: | Parallel algorithm time complexity speedup time cycling. |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
|
