期刊
IEEE ACCESS
卷 8, 期 -, 页码 158115-158124出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2020.3020093
关键词
Stochastic processes; Vehicle routing; Search problems; Microsoft Windows; Programming; Mathematical model; Clustering algorithms; Stochastic travel times; stochastic service times; soft time windows; stochastic programming model; tabu search
资金
- National Natural Science Foundation of China [61440049, 61866025, 61866026]
- Natural Science Foundation of Jiangxi Province [20181BAB202025]
- Superiority Science and Technology Innovation Team Program of Jiangxi Province [20181BCB24008]
In real-world environments, vehicle travel and service time will be affected by unpredictable factors and present a random state. Because of this situation, this article proposes the vehicle routing problem with soft time windows and stochastic travel and service time (SVRP-STW). The probability distribution of vehicle travel and service time are introduced into the model, and a stochastic programming model with modification is established to minimize the distribution cost. An Improved Tabu Search algorithm (I-TS) based on greedy algorithm is proposed, in which adaptive tabu length and neighborhood structure are introduced; the greedy algorithm is used instead of the random methods to generate the initial solution. Experiments on different scale instances prove the effectiveness and superiority of the proposed algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据