Documents disponibles écrits par cet auteur

Some applications of the generalized vehicle routing problem / R. Baldacci in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1072–1077 Titre : Some applications of the generalized vehicle routing problem Type de document : texte imprimé Auteurs : R. Baldacci, Auteur ; E. Bartolini, Auteur ; G. Laporte, Auteur Année de publication : 2011 Article en page(s) : pp. 1072–1077 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Generalized  Vehicle  routing  problem  Models  Applications Index. décimale : 001.424 Résumé : The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP) in which the vertex set is partitioned into clusters and vehicles must visit exactly one (or at least one) vertex per cluster. The GVRP provides a useful modelling framework for a wide variety of applications. The purpose of this paper is to provide such examples of applications and models. These include the Travelling Salesman with Profits, several VRP extensions, the Windy Routing Problem, and the design of tandem configurations for automated guided vehicles. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200951a.html [article] Some applications of the generalized vehicle routing problem [texte imprimé] / R. Baldacci, Auteur ; E. Bartolini, Auteur ; G. Laporte, Auteur . - 2011 . - pp. 1072–1077. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1072–1077 Mots-clés : Generalized  Vehicle  routing  problem  Models  Applications Index. décimale : 001.424 Résumé : The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle Routing Problem (VRP) in which the vertex set is partitioned into clusters and vehicles must visit exactly one (or at least one) vertex per cluster. The GVRP provides a useful modelling framework for a wide variety of applications. The purpose of this paper is to provide such examples of applications and models. These include the Travelling Salesman with Profits, several VRP extensions, the Windy Routing Problem, and the design of tandem configurations for automated guided vehicles. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200951a.html