首页> 美国政府科技报告 >Using Approximate Dynamic Programming to Solve the Stochastic Demand Military Inventory Routing Problem with Direct Delivery.

【24h】

Using Approximate Dynamic Programming to Solve the Stochastic Demand Military Inventory Routing Problem with Direct Delivery.

机译：用近似动态规划求解随机需求军事库存路径问题的直接交付。

获取原文

页面导航

著录项
相似文献
相关主题

著录项

作者
Salgado, E. L.;
展开▼
作者单位

展开▼
年度 2016
页码 1-56
总页数 56
原文格式 PDF
正文语种 eng
中图分类
关键词

相似文献

外文文献
中文文献
专利

1. Approximate dynamic programming for the military inventory routing problem [J] . McKenna Rebekah S., Robbins Matthew J., Lunday Brian J., Annals of Operations Research . 2020,第1期

机译：军事库存路由问题的近似动态规划
2. An approximate dynamic programming approach for the vehicle routing problem with stochastic demands [J] . Novoa C, Storer R European Journal of Operational Research . 2009,第2期

机译：具有随机需求的车辆路径问题的近似动态规划方法
3. An approximate dynamic programming approach to solving adynamic, stochastic multiple knapsack problem [J] . Thomas C. Perry, Joseph C. Hartman International transactions in operational research: A journal of The International Federation of Operational Research Societies . 2009,第3期

机译：解决动态随机多背包问题的近似动态规划方法
4. Solving inventory routing problem with stochastic demand [C] . Noor Hasnah Moin, Huda Zuhrah Ab Halim National Symposium on Mathematical Sciences . 2017

机译：用随机需求解决库存路由问题
5. Online Vehicle Routing under Stochastic Demands Using Approximate Dynamic Programming [D] . Douge, Louis Edouard. 2018

机译：随机需求下的近似动态规划在线车辆路径
6. Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming [O] . Verena Schmid -1

机译：用近似动态规划解决动态救护车的调动和调度问题
7. COMBINING MONTE CARLO SIMULATION WITH HEURISTICS FOR SOLVING THE INVENTORY ROUTING PROBLEM WITH STOCHASTIC DEMANDS [O] . C. Laroque, J. Himmelspach, R. Pasupathy, 2014

机译：将蒙特卡洛模拟与启发式理论相结合，以解决随机需求下的库存路由问题

Using Approximate Dynamic Programming to Solve the Stochastic Demand Military Inventory Routing Problem with Direct Delivery.

著录项

相似文献

相关主题

期刊订阅