DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, C. | ko |
dc.contributor.author | Lee, K. | ko |
dc.contributor.author | Park, Sungsoo | ko |
dc.date.accessioned | 2013-03-12T17:39:53Z | - |
dc.date.available | 2013-03-12T17:39:53Z | - |
dc.date.created | 2012-10-11 | - |
dc.date.created | 2012-10-11 | - |
dc.date.issued | 2012-09 | - |
dc.identifier.citation | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.63, no.9, pp.1294 - 1306 | - |
dc.identifier.issn | 0160-5682 | - |
dc.identifier.uri | http://hdl.handle.net/10203/103041 | - |
dc.description.abstract | In 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.language | English | - |
dc.publisher | PALGRAVE MACMILLAN LTD | - |
dc.subject | BRANCH-AND-PRICE | - |
dc.subject | TIME WINDOWS | - |
dc.subject | SALESMAN PROBLEM | - |
dc.subject | STOCHASTIC DEMANDS | - |
dc.subject | COLUMN GENERATION | - |
dc.subject | OPTIMIZATION | - |
dc.subject | ALGORITHM | - |
dc.subject | CUSTOMERS | - |
dc.subject | CUT | - |
dc.title | Robust vehicle routing problem with deadlines and travel time/demand uncertainty | - |
dc.type | Article | - |
dc.identifier.wosid | 000307872200010 | - |
dc.identifier.scopusid | 2-s2.0-84864707453 | - |
dc.type.rims | ART | - |
dc.citation.volume | 63 | - |
dc.citation.issue | 9 | - |
dc.citation.beginningpage | 1294 | - |
dc.citation.endingpage | 1306 | - |
dc.citation.publicationname | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.identifier.doi | 10.1057/jors.2011.136 | - |
dc.contributor.localauthor | Park, Sungsoo | - |
dc.contributor.nonIdAuthor | Lee, C. | - |
dc.contributor.nonIdAuthor | Lee, K. | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | vehicle routing | - |
dc.subject.keywordAuthor | robust optimization | - |
dc.subject.keywordAuthor | column generation | - |
dc.subject.keywordPlus | BRANCH-AND-PRICE | - |
dc.subject.keywordPlus | TIME WINDOWS | - |
dc.subject.keywordPlus | SALESMAN PROBLEM | - |
dc.subject.keywordPlus | STOCHASTIC DEMANDS | - |
dc.subject.keywordPlus | COLUMN GENERATION | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | CUSTOMERS | - |
dc.subject.keywordPlus | COLONY | - |
dc.subject.keywordPlus | CUT | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.