Orienteering problem with hotel selection: a variable neighborhood search methodReportar como inadecuado




Orienteering problem with hotel selection: a variable neighborhood search method - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

(2012)26th Annual Conference on the Belgian Operations Research Society, Book of Abstracts.p.36-37 Mark abstract In this research, we developed a skewed variable neighbourhood search algorithm to solve the orienteering problem (OP) with hotel selection, a non-investigated variant of the OP. We also designed two appropriate sets of benchmark instances with known optimal solutions. Applying the proposed algorithm on these instances shows the quality of the algorithm. The algorithm is also fast enough to be implemented in a tourist application.

Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-4178561



Autor: A Divsalar, Pieter Vansteenwegen and D Cattruysse

Fuente: https://biblio.ugent.be/publication/4178561



DESCARGAR PDF




Documentos relacionados