A robust enhancement to the Clarke–Wright savings algorithm / Doyuran, T. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 223–231 Titre : A robust enhancement to the Clarke–Wright savings algorithm Type de document : texte imprimé Auteurs : Doyuran, T., Auteur ; Çatay, B., Auteur Année de publication : 2011 Article en page(s) : pp. 223–231 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Vehicle routing Clarke–Wright savings algorithm Heuristics Index. décimale : 001.424 Résumé : We address the Clarke and Wright (CW) savings algorithm proposed for the Capacitated Vehicle Routing Problem. We first consider a recent enhancement that uses the put first larger items idea originally proposed for the bin packing problem and show that the conflicting idea of putting smaller items first has a comparable performance. Next, we propose a robust enhancement to the CW savings formulation. The proposed formulation is normalized to efficiently solve different problems, independent from the measurement units and parameter intervals. To test the performance of the proposed savings function, we conduct an extensive computational study on a large set of well-known instances from the literature. Our results show that the proposed savings function provides shorter distances in the majority of the instances and the average performance is significantly better than previously presented enhancements. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009176a.html [article] A robust enhancement to the Clarke–Wright savings algorithm [texte imprimé] / Doyuran, T., Auteur ; Çatay, B., Auteur . - 2011 . - pp. 223–231. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 223–231 Mots-clés : Vehicle routing Clarke–Wright savings algorithm Heuristics Index. décimale : 001.424 Résumé : We address the Clarke and Wright (CW) savings algorithm proposed for the Capacitated Vehicle Routing Problem. We first consider a recent enhancement that uses the put first larger items idea originally proposed for the bin packing problem and show that the conflicting idea of putting smaller items first has a comparable performance. Next, we propose a robust enhancement to the CW savings formulation. The proposed formulation is normalized to efficiently solve different problems, independent from the measurement units and parameter intervals. To test the performance of the proposed savings function, we conduct an extensive computational study on a large set of well-known instances from the literature. Our results show that the proposed savings function provides shorter distances in the majority of the instances and the average performance is significantly better than previously presented enhancements. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009176a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire