当前位置: X-MOL 学术Networks › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A multi-vehicle covering tour problem with speed optimization
Networks ( IF 2.1 ) Pub Date : 2021-05-10 , DOI: 10.1002/net.22041
Joshua T. Margolis 1 , Yongjia Song 1 , Scott J. Mason 1
Affiliation  

In the multi-vehicle covering tour problem with speed optimization, we aim to construct a set of maximal coverage routes for a fleet of vehicles that serve (observe) a set of secondary sites, given a fixed time schedule and coverage requirements. We develop an exact solution approach using a branch-and-price framework with a label-correcting algorithm and a set of innovative dominance rules to solve the resulting pricing problem. We also develop a two-stage heuristic capable of finding effective initial solutions. In addition, we consider practical extensions to the model by incorporating risk thresholds, energy capacities, and time windows. To validate our proposed solution approaches, we perform an extensive set of numerical experiments. Numerical results show the computational advantage of our proposed solution approaches compared with a state-of-the-art commercial solver.

中文翻译:

具有速度优化的多车覆盖游览问题

在具有速度优化的多车辆覆盖游览问题中,我们的目标是在给定固定的时间安排和覆盖要求的情况下,为服务(观察)一组辅助站点的车队构建一组最大覆盖路线。我们使用带有标签校正算法和一组创新优势规则的分支和价格框架开发了一种精确的解决方案,以解决由此产生的定价问题。我们还开发了一种能够找到有效初始解决方案的两阶段启发式算法。此外,我们通过结合风险阈值、能量容量和时间窗口来考虑模型的实际扩展。为了验证我们提出的解决方案方法,我们进行了大量的数值实验。
更新日期:2021-05-10
down
wechat
bug