The travelling salesperson problem with hotel selection / P. Vansteenwegen 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. 207–217 Titre : The travelling salesperson problem with hotel selection Type de document : texte imprimé Auteurs : P. Vansteenwegen, Auteur ; W. Souffriau, Auteur ; K. Sörensen, Auteur Année de publication : 2012 Article en page(s) : pp. 207–217 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Travelling salesperson problem Hotel selection Heuristic Index. décimale : 001.424 Résumé : In this paper, we present the travelling salesperson problem with hotel selection (TSPHS), an extension of the TSP with a number of interesting applications. We present a mathematical formulation, explain the difference with related optimization problems and indicate what makes this problem inherently more difficult. We develop a simple but efficient heuristic that uses two constructive initialization procedures and an improvement procedure consisting of several neighbourhood search operators designed specifically for this problem, as well as some typical neighbourhoods from the literature. We generate several benchmark instances of varying sizes and compare the performance of our heuristic with CPLEX (10.0). We also generate some problems with known optimal solutions and use these to further demonstrate that our heuristic achieves good results in very limited computation times. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201118a.html [article] The travelling salesperson problem with hotel selection [texte imprimé] / P. Vansteenwegen, Auteur ; W. Souffriau, Auteur ; K. Sörensen, Auteur . - 2012 . - pp. 207–217. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 2 (Fevrier 2012) . - pp. 207–217 Mots-clés : Travelling salesperson problem Hotel selection Heuristic Index. décimale : 001.424 Résumé : In this paper, we present the travelling salesperson problem with hotel selection (TSPHS), an extension of the TSP with a number of interesting applications. We present a mathematical formulation, explain the difference with related optimization problems and indicate what makes this problem inherently more difficult. We develop a simple but efficient heuristic that uses two constructive initialization procedures and an improvement procedure consisting of several neighbourhood search operators designed specifically for this problem, as well as some typical neighbourhoods from the literature. We generate several benchmark instances of varying sizes and compare the performance of our heuristic with CPLEX (10.0). We also generate some problems with known optimal solutions and use these to further demonstrate that our heuristic achieves good results in very limited computation times. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n2/abs/jors201118a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire