On a periodic vehicle routing problem / S. Coene in Journal of the operational research society (JORS), Vol. 61 N° 12 (Décembre 2010)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 61 N° 12 (Décembre 2010) . - pp. 1719–1728 Titre : On a periodic vehicle routing problem Type de document : texte imprimé Auteurs : S. Coene, Auteur ; A. Arnout, Auteur ; F. C. R. Spieksma, Auteur Année de publication : 2011 Article en page(s) : pp. 1719–1728 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Periodic routing Logistics Integer programming Index. décimale : 001.424 Résumé : This paper deals with a study on a variant of the Periodic Vehicle Routing Problem (PVRP). As in the traditional Vehicle Routing Problem, customer locations each with a certain daily demand are given, as well as a set of capacitated vehicles. In addition, the PVRP has a horizon, say T days, and there is a frequency for each customer stating how often within this T-day period this customer must be visited. A solution to the PVRP consists of T sets of routes that jointly satisfy the demand constraints and the frequency constraints. The objective is to minimize the sum of the costs of all routes over the planning horizon. We develop different algorithms solving the instances of the case studied. Using these algorithms we are able to realize considerable cost reductions compared to the current situation. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n12/abs/jors2009154a.html [article] On a periodic vehicle routing problem [texte imprimé] / S. Coene, Auteur ; A. Arnout, Auteur ; F. C. R. Spieksma, Auteur . - 2011 . - pp. 1719–1728. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 12 (Décembre 2010) . - pp. 1719–1728 Mots-clés : Periodic routing Logistics Integer programming Index. décimale : 001.424 Résumé : This paper deals with a study on a variant of the Periodic Vehicle Routing Problem (PVRP). As in the traditional Vehicle Routing Problem, customer locations each with a certain daily demand are given, as well as a set of capacitated vehicles. In addition, the PVRP has a horizon, say T days, and there is a frequency for each customer stating how often within this T-day period this customer must be visited. A solution to the PVRP consists of T sets of routes that jointly satisfy the demand constraints and the frequency constraints. The objective is to minimize the sum of the costs of all routes over the planning horizon. We develop different algorithms solving the instances of the case studied. Using these algorithms we are able to realize considerable cost reductions compared to the current situation. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n12/abs/jors2009154a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire