| 一种求解次优路径的算法 |
| |
| 引用本文： | 郭朝珍,吴发明.一种求解次优路径的算法[J].福州大学学报(自然科学版),1992(2):7-13. |
| |
| 作者姓名： | 郭朝珍 吴发明 |
| |
| 作者单位： | 福州大学计算机系
(郭朝珍)，福州大学教务处(吴发明) |
| |
| 摘 要： | 根据动态规则的原理，利用最优路径的中间轨迹结果，给出一种快速优选次优路径的算法，并将求解最优和次优路径的算法归纳完整．本算法已在IPM－PC机上编程调试通过．
|
| 关 键 词： | 动态规划 最优路径 次优路径 算法 |
An Algorithm for Seeking Suboptimization |
| |
| Guo Chaozhen.An Algorithm for Seeking Suboptimization[J].Journal of Fuzhou University(Natural Science Edition),1992(2):7-13. |
| |
| Authors: | Guo Chaozhen |
| |
| Institution: | Guo Chaozhen (Department of Computer Scisnce) Wu Famin (Academic Administration) |
| |
| Abstract: | Basing on the dynamic propramming, an efficient suboptimization algorithm has been obtained by using intermediate locus results of optimal path. The algorithm of optimization and suboptimization is completely summarized. It has been experimented on IBM-PC computer and passed debugging. |
| |
| Keywords: | dynamic programming optimal path suboptimal path algorithm |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文 |
