A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times

Cited 26 time in webofscience Cited 0 time in scopus
  • Hit : 410
  • Download : 0
We consider a vehicle routing problem with uncertain travel times in which a penalty is incurred for each vehicle that exceeds a given time limit. A traditional stochastic programming approach would require precise knowledge of the underlying probability distributions of random data. In a novel approach presented here, we assume that only rough information on future travel times is available, leading to the multiple range forecasts of travel times and the probabilities of each range being realized. In this setting, we replace the point estimates of travel times on a scenario by range estimates. For each scenario, we then find the robust routes that protect the solution against the worst case within the given ranges, and finally we find the routes with the minimum expected cost. We propose a branch-and-cut algorithm to solve the problem and report computational results on both randomly generated and the well-known Solomon's instances. The results demonstrate that our approach is a favorable one when exact information of probability distributions is not available.
Publisher
INFORMS
Issue Date
2014-08
Language
English
Article Type
Article
Keywords

STOCHASTIC DEMANDS; LINEAR-PROGRAMS; OPTIMIZATION; ALGORITHM; CONSTRAINTS; CUSTOMERS; PRICE

Citation

TRANSPORTATION SCIENCE, v.48, no.3, pp.373 - 390

ISSN
0041-1655
DOI
10.1287/trsc.2013.0476
URI
http://hdl.handle.net/10203/193152
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 26 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0