Documents disponibles écrits par cet auteur

Local search-based metaheuristics for the split delivery vehicle routing problem / U. Derigs in Journal of the operational research society (JORS), Vol. 61 N° 9 (Septembre 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 9 (Septembre 2010) . - pp. 1356–1364 Titre : Local search-based metaheuristics for the split delivery vehicle routing problem Type de document : texte imprimé Auteurs : U. Derigs, Auteur ; B. Li, Auteur ; U. Vogel, Auteur Année de publication : 2011 Article en page(s) : pp. 1356–1364 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Heuristics  Local  search  Split  deliveries  Transport  Vehicle  routing Index. décimale : 001.424 Résumé : The split delivery vehicle routing problem is a variant of the standard vehicle routing problem where the single-visit assumption is waived and a customer might be served on more than one vehicle tour. In this article we report on a study where we have applied the standard local search-based metaheuristics using adaptations of the most widely used inter-tour and intra-tour exchange operators for solving the standard vehicle routing problem now allowing splitting and joining of deliveries. As we will show we could find new best solutions for 51 out of 57 benchmark instances, which have been defined for this problem class. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n9/abs/jors2009100a.html [article] Local search-based metaheuristics for the split delivery vehicle routing problem [texte imprimé] / U. Derigs, Auteur ; B. Li, Auteur ; U. Vogel, Auteur . - 2011 . - pp. 1356–1364. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 9 (Septembre 2010) . - pp. 1356–1364 Mots-clés : Heuristics  Local  search  Split  deliveries  Transport  Vehicle  routing Index. décimale : 001.424 Résumé : The split delivery vehicle routing problem is a variant of the standard vehicle routing problem where the single-visit assumption is waived and a customer might be served on more than one vehicle tour. In this article we report on a study where we have applied the standard local search-based metaheuristics using adaptations of the most widely used inter-tour and intra-tour exchange operators for solving the standard vehicle routing problem now allowing splitting and joining of deliveries. As we will show we could find new best solutions for 51 out of 57 benchmark instances, which have been defined for this problem class. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n9/abs/jors2009100a.html