期刊名称：International Journal of Industrial Engineering Computations
印刷版ISSN：1923-2926
电子版ISSN：1923-2934
出版年度：2020
卷号：11
期号：1
页码：1-16
DOI：10.5267/j.ijiec.2019.7.002
语种：English
出版社：Growing Science Publishing Company
摘要：The main purpose of this paper is to study the vehicle routing problem with hard time windows where the main challenges is to include both sources of uncertainties, namely the travel and the service time that can arise due to multiple causes. We propose a new approach for the robust problem based on the implementation of an adaptive large neighborhood search algorithm and the use of efficient mechanisms to derive the best robust solution that responds to all uncertainties with reduced running times. The computational experiments are performed and improve the objective function of a set of instances with different levels of the uncertainty polytope to obtain the best robust solutions that protect from the violation of time windows for different scenarios.
关键词：Robust approach; ALNS; Uncertainty; Measures of robustness; Monte-Carlo simulation
