车辆路径问题
数学优化
布线(电子设计自动化)
整数(计算机科学)
整数规划
概率分布
数学
计算机科学
统计
程序设计语言
计算机网络
作者
Jean‐François Côté,Michel Gendreau,Jean‐Yves Potvin
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:2020-01-23
卷期号:54 (2): 453-469
被引量:42
标识
DOI:10.1287/trsc.2019.0904
摘要
We consider a stochastic vehicle routing problem where a discrete probability distribution characterizes the two-dimensional size (height and width) as well as the weight of a subset of items to be delivered to customers. Although some item sizes and weights are not known with certainty when the routes are planned, they become known when it is time to load the vehicles, just before their departure. If it happens that not all items can be loaded in a vehicle, the items of one or more customers are put aside at a penalty or recourse cost. The objective is to minimize the sum of the routing and expected recourse costs. The problem is modeled as a two-stage stochastic program and solved with the integer L-shaped method. Some new inequalities and lower bounds are proposed. Computational results are reported on test instances specifically generated for this problem, as well as on classical instances for the deterministic case.
科研通智能强力驱动
Strongly Powered by AbleSci AI