Vehicle routing problem with hard time window (VRPHTW) is extremely strict in travel time. However, the travel time is usually uncertain due to some stochastic factors such as weather and other road conditions. It is an important issue to take travel time uncertainty into consideration in VRPHTW. This paper develops a robust VRPHTW model to cope with time uncertainty. We use robustness method of Bertismas to consider the maximum change of uncertain travel time in the degree of robustness set by decision maker. The probability that the optimal solution violates constraints is derived. The violated probability shows that the robustness of VRPHTW model can reach a satisfactory level. Finally, one modified max-min ant system algorithm is proposed to solve this problem and one numerical example is conducted to illustrate the model and the algorithm. Both theory analysis and numerical example show the effectiveness of the proposed robust model.
Contents
-
Publicly AvailableA Robust VRPHTW Model with Travel Time UncertaintyAugust 25, 2014
-
Publicly AvailableDouble-principal Agent: False Accounting Information, Supervision Cost and Corporate PerformanceAugust 25, 2014
-
Publicly AvailablePricing Defaultable Securities under Actual Probability MeasureAugust 25, 2014
-
Publicly AvailableTime Series Forecasting Using a Hybrid Adaptive Particle Swarm Optimization and Neural Network ModelAugust 25, 2014
-
Publicly AvailableOptimal Sales Discount Decision Model with Fixed Ordered QuantitiesAugust 25, 2014
-
Publicly AvailableThe Order Quantity Decision of Newsboy Retailer with FinancingAugust 25, 2014
-
Publicly AvailableWidespread Traffic Congestion Prediction for Urban Road Network Based on Synergetic TheoryAugust 25, 2014
-
Publicly AvailableCalculating the Maximum Assembling on Nested Routing Platforms of Urban Rail Transit LineAugust 25, 2014