Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery / Y. Gajpal in Journal of the operational research society (JORS), Vol. 61 N° 10 (Octobre 2010)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 61 N° 10 (Octobre 2010) . - pp. 1498–1509 Titre : Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery Type de document : texte imprimé Auteurs : Y. Gajpal, Auteur ; P. Abad, Auteur Année de publication : 2011 Article en page(s) : pp. 1498–1509 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Vehicle routing Pickup and delivery Heuristic Combinatorial optimization Index. décimale : 001.424 Résumé : The vehicle routing problem (VRP) with simultaneous pickup and delivery (VRPSPD) is an extension of the classical capacitated VRP (CVRP). In this paper, we present the saving heuristic and the parallel saving heuristic for VRPSPD. Checking the feasibility of a route in VRPSPD is difficult because of the fluctuating load on the route. In the saving heuristic, a new route is created by merging the two existing routes. We use a cumulative net-pickup approach for checking the feasibility when two existing routes are merged. The numerical results show that the performance of the proposed heuristics is qualitatively better than the existing insertion-based heuristics. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n10/abs/jors200983a.html [article] Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery [texte imprimé] / Y. Gajpal, Auteur ; P. Abad, Auteur . - 2011 . - pp. 1498–1509. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 10 (Octobre 2010) . - pp. 1498–1509 Mots-clés : Vehicle routing Pickup and delivery Heuristic Combinatorial optimization Index. décimale : 001.424 Résumé : The vehicle routing problem (VRP) with simultaneous pickup and delivery (VRPSPD) is an extension of the classical capacitated VRP (CVRP). In this paper, we present the saving heuristic and the parallel saving heuristic for VRPSPD. Checking the feasibility of a route in VRPSPD is difficult because of the fluctuating load on the route. In the saving heuristic, a new route is created by merging the two existing routes. We use a cumulative net-pickup approach for checking the feasibility when two existing routes are merged. The numerical results show that the performance of the proposed heuristics is qualitatively better than the existing insertion-based heuristics. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n10/abs/jors200983a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire