.png){kind=icon}
返回
The Time Window Assignment Vehicle Routing Problem
.png){kind=icon}
OA
AI
DOI：10.1287/trsc.2013.0510.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we introduce the time window assignment vehicle routing problem (TWAVRP). In this problem, time windows have to be assigned before demand is known. Next, a realization of demand is revealed, and a vehicle routing schedule is made that satisfies the assigned time windows. The objective is to minimize the expected traveling costs. We propose a branch-price-and-cut algorithm to solve the TWAVRP to optimality. We provide results of computational experiments performed using this algorithm. Finally, we offer insight on the value of an exact approach for the TWAVRP by comparing the optimal solution to the solution found by assigning time windows based on solving a vehicle routing problem with time windows with average demand.
Keyword:
vehicle routing problem
time window assignment
pricing problem with linear node costs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.8
论文数:
1.9K
被引数:
8.4K
机构
引用论文
.png){kind=icon}
Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows带时间窗的车辆路径问题的禁忌搜索，部分元素和广义k路径不等式
PREAI
分享收藏
An approximate dynamic programming approach for the vehicle routing problem with stochastic demands具有随机需求的车辆路径问题的近似动态规划方法
PREAI
分享收藏
查看更多内容