Robust vehicle routing problem with deadlines and travel time/demand uncertainty

Cited 49 time in webofscience Cited 0 time in scopus
  • Hit : 423
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorLee, C.ko
dc.contributor.authorLee, K.ko
dc.contributor.authorPark, Sungsooko
dc.date.accessioned2013-03-12T17:39:53Z-
dc.date.available2013-03-12T17:39:53Z-
dc.date.created2012-10-11-
dc.date.created2012-10-11-
dc.date.issued2012-09-
dc.identifier.citationJOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.63, no.9, pp.1294 - 1306-
dc.identifier.issn0160-5682-
dc.identifier.urihttp://hdl.handle.net/10203/103041-
dc.description.abstractIn this article, we investigate the vehicle routing problem with deadlines, whose goal is to satisfy the requirements of a given number of customers with minimum travel distances while respecting both of the deadlines of the customers and vehicle capacity. It is assumed that the travel time between any two customers and the demands of the customer are uncertain. Two types of uncertainty sets with adjustable parameters are considered for the possible realizations of travel time and demand. The robustness of a solution against the uncertain data can be achieved by making the solution feasible for any travel time and demand defined in the uncertainty sets. We propose a Dantzig-Wolfe decomposition approach, which enables the uncertainty of the data to be encapsulated in the column generation subproblem. A dynamic programming algorithm is proposed to solve the subproblem with data uncertainty. The results of computational experiments involving two well-known test problems show that the robustness of the solution can be greatly improved. Journal of the Operational Research Society (2012) 63, 1294-1306. doi:10.1057/jors.2011.136 Published online 7 December 2011; corrected online 11 January 2012-
dc.languageEnglish-
dc.publisherPALGRAVE MACMILLAN LTD-
dc.subjectBRANCH-AND-PRICE-
dc.subjectTIME WINDOWS-
dc.subjectSALESMAN PROBLEM-
dc.subjectSTOCHASTIC DEMANDS-
dc.subjectCOLUMN GENERATION-
dc.subjectOPTIMIZATION-
dc.subjectALGORITHM-
dc.subjectCUSTOMERS-
dc.subjectCUT-
dc.titleRobust vehicle routing problem with deadlines and travel time/demand uncertainty-
dc.typeArticle-
dc.identifier.wosid000307872200010-
dc.identifier.scopusid2-s2.0-84864707453-
dc.type.rimsART-
dc.citation.volume63-
dc.citation.issue9-
dc.citation.beginningpage1294-
dc.citation.endingpage1306-
dc.citation.publicationnameJOURNAL OF THE OPERATIONAL RESEARCH SOCIETY-
dc.identifier.doi10.1057/jors.2011.136-
dc.contributor.localauthorPark, Sungsoo-
dc.contributor.nonIdAuthorLee, C.-
dc.contributor.nonIdAuthorLee, K.-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorvehicle routing-
dc.subject.keywordAuthorrobust optimization-
dc.subject.keywordAuthorcolumn generation-
dc.subject.keywordPlusBRANCH-AND-PRICE-
dc.subject.keywordPlusTIME WINDOWS-
dc.subject.keywordPlusSALESMAN PROBLEM-
dc.subject.keywordPlusSTOCHASTIC DEMANDS-
dc.subject.keywordPlusCOLUMN GENERATION-
dc.subject.keywordPlusOPTIMIZATION-
dc.subject.keywordPlusALGORITHM-
dc.subject.keywordPlusCUSTOMERS-
dc.subject.keywordPlusCOLONY-
dc.subject.keywordPlusCUT-
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 49 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0