International Journal of Industrial Engineering Computations · 2019 · 24 citations · 1 references
Natural SciencesMathematicsOperations ManagementOptimizationTransportationUncertainty QuantificationHeuristic SearchOptimization Under UncertaintyRobust OptimizationRoutingTransportation ProblemsVehicle SchedulingAdaptive Large Neighborhood SearchLarge Neighborhood SearchNeighborhood SearchRobust RoutingRouting ProblemsTime WindowsVehicle RoutingVehicle Routing Problems
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 resolution 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.
1
Mehdi Nasri, Abdelmoutalib Metrane, Imad Hafidi et al. · International Journal of Industrial Engineering Computations · 2019 · 24 citations · Full text