.png){kind=icon}
返回
An event-driven optimization framework for dynamic vehicle routing
.png){kind=icon}
OA
AI
DOI：10.1016/j.dss.2012.06.007.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The real-time operation of a fleet of vehicles introduces challenging optimization problems. In this work, we propose an event-driven framework that anticipates unknown changes arising in the context of dynamic vehicle routing. The framework is intrinsically parallelized to take advantage of modem multi-core and multi-threaded computing architectures. It is also designed to be easily embeddable in decision support systems that cope with a wide range of contexts and side constraints. We illustrate the flexibility of the framework by showing how it can be adapted to tackle the dynamic vehicle routing problem with stochastic demands. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Dynamic vehicle routing
Event-driven framework
Multiple scenario approach
Online stochastic optimization
VRPSD
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.8
论文数:
3.8K
被引数:
1.5W
机构
引用论文
An approximate dynamic programming approach for the vehicle routing problem with stochastic demands具有随机需求的车辆路径问题的近似动态规划方法
.png){kind=icon}
PREAI
分享收藏分享收藏
查看更多内容