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

Cited 27 time in webofscience Cited 0 time in scopus
  • Hit : 422
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorHan, Jinilko
dc.contributor.authorLee, Chungmokko
dc.contributor.authorPark, Sungsooko
dc.date.accessioned2015-01-27T02:43:59Z-
dc.date.available2015-01-27T02:43:59Z-
dc.date.created2014-09-22-
dc.date.created2014-09-22-
dc.date.issued2014-08-
dc.identifier.citationTRANSPORTATION SCIENCE, v.48, no.3, pp.373 - 390-
dc.identifier.issn0041-1655-
dc.identifier.urihttp://hdl.handle.net/10203/193152-
dc.description.abstractWe 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.-
dc.languageEnglish-
dc.publisherINFORMS-
dc.subjectSTOCHASTIC DEMANDS-
dc.subjectLINEAR-PROGRAMS-
dc.subjectOPTIMIZATION-
dc.subjectALGORITHM-
dc.subjectCONSTRAINTS-
dc.subjectCUSTOMERS-
dc.subjectPRICE-
dc.titleA Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times-
dc.typeArticle-
dc.identifier.wosid000340729400004-
dc.identifier.scopusid2-s2.0-84907719406-
dc.type.rimsART-
dc.citation.volume48-
dc.citation.issue3-
dc.citation.beginningpage373-
dc.citation.endingpage390-
dc.citation.publicationnameTRANSPORTATION SCIENCE-
dc.identifier.doi10.1287/trsc.2013.0476-
dc.contributor.localauthorPark, Sungsoo-
dc.contributor.nonIdAuthorHan, Jinil-
dc.contributor.nonIdAuthorLee, Chungmok-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorvehicle routing-
dc.subject.keywordAuthorstochastic travel times-
dc.subject.keywordAuthorrobust optimization-
dc.subject.keywordAuthorstochastic programming-
dc.subject.keywordAuthorbranch and cut-
dc.subject.keywordPlusSTOCHASTIC DEMANDS-
dc.subject.keywordPlusLINEAR-PROGRAMS-
dc.subject.keywordPlusOPTIMIZATION-
dc.subject.keywordPlusALGORITHM-
dc.subject.keywordPlusCONSTRAINTS-
dc.subject.keywordPlusCUSTOMERS-
dc.subject.keywordPlusPRICE-
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 27 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0