Documents disponibles écrits par cet auteur

Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier / Potvin, J.-Y. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 326–336 Titre : Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier Type de document : texte imprimé Auteurs : Potvin, J.-Y., Auteur ; Naud, M.-A., Auteur Année de publication : 2011 Article en page(s) : pp. 326–336 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Vehicle  routing  Private  fleet  Common  carrier  Tabu  search  Ejection  chains Index. décimale : 001.424 Résumé : The problem reported in this paper is a variant of the classical vehicle routing problem, where customer requests for a transportation company can be served either by its private fleet of vehicles or assigned to an external common carrier. The latter case occurs if the demand exceeds the total capacity of the private fleet or if it is more economical to do so. Accordingly, the objective is to minimize the variable and fixed costs of the private fleet plus the costs charged by the common carrier. A tabu search heuristic with a neighbourhood structure based on ejection chains is proposed to solve this problem. It is empirically demonstrated that this algorithm outperforms the best approaches reported in the literature on a set of benchmark instances with both homogeneous and heterogeneous fleets. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010102a.html [article] Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier [texte imprimé] / Potvin, J.-Y., Auteur ; Naud, M.-A., Auteur . - 2011 . - pp. 326–336. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 326–336 Mots-clés : Vehicle  routing  Private  fleet  Common  carrier  Tabu  search  Ejection  chains Index. décimale : 001.424 Résumé : The problem reported in this paper is a variant of the classical vehicle routing problem, where customer requests for a transportation company can be served either by its private fleet of vehicles or assigned to an external common carrier. The latter case occurs if the demand exceeds the total capacity of the private fleet or if it is more economical to do so. Accordingly, the objective is to minimize the variable and fixed costs of the private fleet plus the costs charged by the common carrier. A tabu search heuristic with a neighbourhood structure based on ejection chains is proposed to solve this problem. It is empirically demonstrated that this algorithm outperforms the best approaches reported in the literature on a set of benchmark instances with both homogeneous and heterogeneous fleets. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010102a.html