用动态规划方法求解最短运输路线问题  

Solving the shortest route problem using dynamic programming

作　　者：赵娟[1] 王建新 

机构地区：[1]西安工业大学北方信息工程学院计算机信息与技术系,陕西西安710025 [2]西安航天动力测控技术研究所,陕西西安710025

出　　处：《现代电子技术》2012年第17期120-122,共3页Modern Electronics Technique

摘　　要：在日常生活中,很多领域都要涉及到最短路径问题,如何求解最短路径的问题是非常重要的。阐述了动态规划方法的基本思想、求解最短路径问题的步骤,并使用C语言编程解决了最短运输路线问题,说明了动态规划求解最短路径的可行性。In daily life, many fields are concerned with the shortest route problem. It is very important to find the solution to the shortest route problem. The basic ideas of the dynamic programming, the procedure of the solution to the shortest problem are presented and finally the shortest route problem is solved by using C language. And the feasibility of the dynamic programming for solving the shortest route problem is explained.

关 键 词：动态规划 最短路径 C语言 可行性 

分 类 号：TN711-34[电子电信—电路与系统]