Robust vehicle routing problem with deadlines and travel time/demand uncertainty / C. Lee in Journal of the operational research society (JORS), Vol. 63 N° 9 (Septembre 2012)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1294–1306 Titre : Robust vehicle routing problem with deadlines and travel time/demand uncertainty Type de document : texte imprimé Auteurs : C. Lee, Auteur ; K. Lee, Auteur ; S. Park, Auteur Année de publication : 2012 Article en page(s) : pp. 1294–1306 Note générale : Operational research Langues : Anglais (eng) Mots-clés : Vehicle routing Robust optimization Column generation Index. décimale : 001.424 Résumé : 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. Note de contenu : In an earlier version of this article S Park's affiliation was wrongly given as ETRI. The correct affiliation, KAIST, is shown in this final version of the article. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011136a.html [article] Robust vehicle routing problem with deadlines and travel time/demand uncertainty [texte imprimé] / C. Lee, Auteur ; K. Lee, Auteur ; S. Park, Auteur . - 2012 . - pp. 1294–1306. Operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 9 (Septembre 2012) . - pp. 1294–1306 Mots-clés : Vehicle routing Robust optimization Column generation Index. décimale : 001.424 Résumé : 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. Note de contenu : In an earlier version of this article S Park's affiliation was wrongly given as ETRI. The correct affiliation, KAIST, is shown in this final version of the article. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n9/abs/jors2011136a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire