Aplicación de las Cadenas de Markov en la Determinación de Circuitos Turísticos del Perú

Published in: Engineering for a Smarter Planet: Innovation, ITC, and Computational Tools for Sustainable Development: Proceedings of the 9th Latin American and Caribbean Conference for Engineering and Technology
Date of Conference: August 3-5, 2011
Location of Conference: Medellin, Colombia
Authors: Wilmer Atoche Díaz
Víctor Farro Díaz
Refereed Paper: #244

Abstract

This research aims to present the regional governments with major probability of being visited by a tourist, national or international, and provide the shortest route to travel between these regions.
The theoretical basis of the study is comprised of the Markov chain issues and Design of Routes. In addition, the study of the tourism sector which aims to provide information on how it is currently, data collection was based on internal and external tourist surveys and information provided by travel agencies and tourism.
The application of Markov Chains to the tourist tours is demostrated in formulating national models, that when they are developing, they offer the chance of arrival of tourists to the different regions.
For the design of routes using the Method or Algorithm "Savings", for which only used the regions with major probability, obtaining the Tourist Circuits with the least possible travel.
Finally, the results obtained show that the main national road less traveled is: Lima - Arequipa - Puno - Cuzco - Ica - Lima, and the different routes that follow from it.