论文部分内容阅读
动态规划是管理数学的一个分支,目前已广泛应用于工程技术、经济管理、工业生产和军事等部门,并取得了显著效果。它是解决多阶段决策过程最优化的一种方法。本文试图对动态规划在汽车运输方面的应用进行一些初步探讨。全文共分三部分,第一部分主要阐述动态规划的基本概念和基本方程,用一个简单的“最短路线”问题的例子来说明动态规划的基本概念,最后抽象为数学模型,即基本方程。并归纳出五个基本特性。第二部分主要论述应用动态规划法确定最经济的汽车运输路线的实际例子。第三部分主要论述应用动态规划法确定汽车的最优更新年限的实际例子。
Dynamic programming is a branch of management mathematics, which has been widely used in engineering, economic management, industrial production and military departments at present, and has achieved remarkable results. It is a method to solve the optimization of multi-stage decision-making process. This paper attempts to make some preliminary discussions about the application of dynamic programming in the field of automobile transportation. The full text is divided into three parts. The first part mainly elaborates the basic concepts and basic equations of dynamic programming. The basic concept of dynamic programming is illustrated with a simple example of the shortest path problem. Finally, the mathematical model, namely the basic equation, is abstracted. And summed up five basic characteristics. The second part focuses on the practical examples of using the dynamic programming method to determine the most economical route for a car. The third part mainly discusses the practical examples of using dynamic programming to determine the optimum life of a car.