Hybrid metaheuristics for the profitable arc tour problem / J. Euchi in Journal of the operational research society (JORS), Vol. 62 N° 11 (Novembre 2011)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 2013–2022 Titre : Hybrid metaheuristics for the profitable arc tour problem Type de document : texte imprimé Auteurs : J. Euchi, Auteur ; Chabchoub, H., Auteur Année de publication : 2011 Article en page(s) : pp. 2013–2022 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Vehicle routing Profitable arc tour problem Metaheuristics Index. décimale : 001.424 Résumé : The profitable arc tour problem is a variant in the vehicle routing problems. It is included in the family of the vehicle routing with profit problems in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the vehicle tours that maximize the collection of profits minus travel costs, subject to constraints limiting the length of cycles that profit is available on arcs. To solve this variant we adopted two metaheuristics based on adaptive memory. We show that our algorithms provide good results in terms of solution quality and running times. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010179a.html [article] Hybrid metaheuristics for the profitable arc tour problem [texte imprimé] / J. Euchi, Auteur ; Chabchoub, H., Auteur . - 2011 . - pp. 2013–2022. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 11 (Novembre 2011) . - pp. 2013–2022 Mots-clés : Vehicle routing Profitable arc tour problem Metaheuristics Index. décimale : 001.424 Résumé : The profitable arc tour problem is a variant in the vehicle routing problems. It is included in the family of the vehicle routing with profit problems in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the vehicle tours that maximize the collection of profits minus travel costs, subject to constraints limiting the length of cycles that profit is available on arcs. To solve this variant we adopted two metaheuristics based on adaptive memory. We show that our algorithms provide good results in terms of solution quality and running times. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n11/abs/jors2010179a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire