A heuristic method for the capacitated arc routing problem with refill points and multiple loads / C-A. Amaya in Journal of the operational research society (JORS), Vol. 61 N° 7 (Juillet 2010)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1095–1103 Titre : A heuristic method for the capacitated arc routing problem with refill points and multiple loads Type de document : texte imprimé Auteurs : C-A. Amaya, Auteur ; A. Langevin, Auteur ; M. Trépanier, Auteur Année de publication : 2011 Article en page(s) : pp. 1095–1103 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Logistics Optimization Networks and graphs Vehicle routing Capacitated arc problem Heuristics Index. décimale : 001.424 Résumé : We describe a solution procedure for a capacitated arc routing problem with refill points and multiple loads. This problem stems from the road network marking in Quebec, Canada. Two different types of vehicles are used: the first type (called servicing vehicle—SV) with a finite capacity to service the arcs and the other (called refilling vehicle—RV) to refill the SV vehicle. The RV can deliver multiple loads, which means that it meets the SV several times before returning to the depot. The problem consists of simultaneously determining the vehicle routes that minimize the total cost of the two vehicles. We present an integer formulation and a route first-cluster second heuristic procedure. Computational results are provided. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200958a.html [article] A heuristic method for the capacitated arc routing problem with refill points and multiple loads [texte imprimé] / C-A. Amaya, Auteur ; A. Langevin, Auteur ; M. Trépanier, Auteur . - 2011 . - pp. 1095–1103. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 7 (Juillet 2010) . - pp. 1095–1103 Mots-clés : Logistics Optimization Networks and graphs Vehicle routing Capacitated arc problem Heuristics Index. décimale : 001.424 Résumé : We describe a solution procedure for a capacitated arc routing problem with refill points and multiple loads. This problem stems from the road network marking in Quebec, Canada. Two different types of vehicles are used: the first type (called servicing vehicle—SV) with a finite capacity to service the arcs and the other (called refilling vehicle—RV) to refill the SV vehicle. The RV can deliver multiple loads, which means that it meets the SV several times before returning to the depot. The problem consists of simultaneously determining the vehicle routes that minimize the total cost of the two vehicles. We present an integer formulation and a route first-cluster second heuristic procedure. Computational results are provided. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n7/abs/jors200958a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire