CAREER: Dynamic Programming Approximations for Large-Scale Logistics Problems

这笔赠款为研究开发解决大规模动态和随机优化问题的近似方法提供了资金。这些类型的问题在许多应用中都会遇到，特别是在必须定期作出决定的情况下，决策者并不确切知道未来将如何影响正在审议的进程的目标和演变。将使用的具体方法是开发动态规划近似。这些方法还将用于解决物流和运输中遇到的一些重要问题。这笔赠款还为与这项研究相关的教材的开发提供资金。将开发模拟驱动的物流游戏，帮助教玩家如何在动态和随机的环境中做出决定。这项研究将有助于提高我们解决复杂动态和随机优化问题的能力。这将提高决策者在动态变化、未来结果不确定的环境中做出良好决策的能力。将制定实施这些方法的指导方针，以使从业人员更容易获得这项技术。通过与物流和运输业的合作，他们将获得帮助，改善他们的一些业务。将开发的教材可用于研究生和本科教育，以及行业决策者的培训。

This grant provides funding for research to develop approximation methods for the solution of large-scale dynamic and stochastic optimization problems. These types of problems are encountered in many applications, especially when decisions have to be made on a regular basis, and the decision maker does not know exactly how the future will impact the objective and the evolution of the process under consideration. The specific approach that will be used is the development of dynamic programming approximations. The methods will also be used to address a number of important problems encountered in logistics and transportation. The grant also provides funding for the development of teaching materials associated with the research. Simulation driven logistics games will be developed that will help to teach the player how to make decisions in dynamic and stochastic environments. The research will contribute to our capability to solve complex dynamic and stochastic optimization problems. This will improve the ability of decision makers to make good decisions in a dynamically changing environment with uncertainty about future outcomes. Guidelines for the implementation of these methods willbe developed to make the technology more accessible to practitioners. Through collaboration with the logistics and transportation industries, they will be helped to improve some of their operations. The teaching materials that will be developed can be used for graduate and undergraduate education, as well as the training of decision makers in industry.