作业车间调度
布线(电子设计自动化)
车辆路径问题
启发式
数学优化
计算机科学
标准差
数学
统计
计算机网络
作者
Iurii Bakach,Ann Melissa Campbell,Jan Fabian Ehmke,Timothy L. Urban
标识
DOI:10.1016/j.ejtl.2021.100029
摘要
In this paper, we examine a vehicle routing problem with a makespan objective incorporating both stochastic and correlated travel times, which is usually not considered in routing problems. As an alternative to simulation, we develop an approach based on extreme-value theory to estimate the expected makespan (and standard deviation) and show how this approach can be embedded within an existing routing heuristic. We present results that demonstrate the impact of different correlation patterns and levels of correlation on route planning using real-world motivated instances. Depending on the particular objective, cost savings of up to 13.76% can be obtained by considering correlation.
科研通智能强力驱动
Strongly Powered by AbleSci AI