An incremental tabu search heuristic for the generalized vehicle routing problem with time windows / L. Moccia in Journal of the operational research society (JORS), Vol. 63 N° 2 (Fevrier 2012)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 232–244 Titre : An incremental tabu search heuristic for the generalized vehicle routing problem with time windows Type de document : texte imprimé Auteurs : L. Moccia, Auteur ; J.-F. Cordeau, Auteur ; G. Laporte, Auteur Année de publication : 2012 Article en page(s) : pp. 232–244 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Generalized vehicle routing problem Time windows Tabu search Large neighbourhood Index. décimale : 001.424 Résumé : This paper describes an incremental neighbourhood tabu search heuristic for the generalized vehicle routing problem with time windows. The purpose of this work is to offer a general tool that can be successfully applied to a wide variety of specific problems. The algorithm builds upon a previously developed tabu search heuristic by replacing its neighbourhood structure. The new neighbourhood is exponential in size, but the proposed evaluation procedure has polynomial complexity. Computational results are presented and demonstrate the effectiveness of the approach. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201125a.html [article] An incremental tabu search heuristic for the generalized vehicle routing problem with time windows [texte imprimé] / L. Moccia, Auteur ; J.-F. Cordeau, Auteur ; G. Laporte, Auteur . - 2012 . - pp. 232–244. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 232–244 Mots-clés : Generalized vehicle routing problem Time windows Tabu search Large neighbourhood Index. décimale : 001.424 Résumé : This paper describes an incremental neighbourhood tabu search heuristic for the generalized vehicle routing problem with time windows. The purpose of this work is to offer a general tool that can be successfully applied to a wide variety of specific problems. The algorithm builds upon a previously developed tabu search heuristic by replacing its neighbourhood structure. The new neighbourhood is exponential in size, but the proposed evaluation procedure has polynomial complexity. Computational results are presented and demonstrate the effectiveness of the approach. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201125a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire