Estimation of Expected Duration of Stay of Tourists in the Cultural and Religious Capital of India
Journal Title: International Journal of Mathematics and Computer Applications Research (IJMCAR) - Year 2019, Vol 9, Issue 1
Abstract
Since the ancient times Varanasi has been the capital of religion and culture of North India which always attracts tourists from abroad as well as from different parts of India. For every tourist, she offers a different experience. There is a natural tendency that a tourist came to visit various places in the Varanasi city and never really returns to their own place or country as they may extend their stay as per their own conditions or situations. This paper deals with a probability model for the number of tourists according to the length of their stay under certain assumptions. The parameters involved in this model have been estimated by the maximum likelihood (ML). This model has been applied to the real data set collected from various hotels in Varanasi. Each hotel from these regions is supposed to be a unit or cluster on the basis of number of tourists staying in that hotel which defines the size of a hotel. So, we have divided hotels into different clusters having an unequal size. Further, 10 clusters of unequal size were randomly selected in which 4 large clusters and 6 small clusters. Then all the tourists of the selected clusters were enumerated and the retrospective data was collected from hotels about the duration of stay of the tourists in the Varanasi district on a day during February, 2014. The total sample size is 386 and tourist’s information about their stay is analyzed. The international tourists mainly belong from USA, UK, France, Australia, Italy, Netherlands, Japan, China, South Korea etc., however majority of domestic tourist are from Tamil Nadu, Maharashtra, Kerala, Andhra Pradesh and Rajasthan. The mean duration of stay of international tourists is found less than the domestic tourists’ stay.
Authors and Affiliations
Brijesh P. Singh, Shiwani Tiwari, Sweta Singh
Keywords
Related Articles
- EP ID EP600733
- DOI 10.24247/ijmcarjun20198
- Views 102
- Downloads 0
The Maximum-Flow, Minimum-Cut in Transportation Problems
An important characteristic of a transport network is its capacity to carry the flow. In this work we develop a method of finding the maximum flow between source and target nodes of a network based on the “max-flow, min-...
Some New Exact Traveling Wave Solutions of the mKdV Equation by Khater Method
In this paper, Khater method is used to construct new analytical solutions of mKdV equation. As a result, some new types of exact traveling wave solutions are obtained using trigonometric, hyperbolic, exponential functio...
MULTI-OBJECTIVE STOCHASTIC INTUTIONISTIC FUZZY LINEAR PROGRAMMING PROBLEM
Stochastic or random programming (SP) is a framework for modeling Linear Programming Problems(LPP) that fasten haziness. The common goal is tattered in solving random LPPs has still been to alter a stochastic model into...
(a, d) Edge- Antimagic Total Labelling of Non-Planar Classes of Graphs
The (a, d) edge- antimagic total labeling of a graph G is a bijective function ρ: V (G)∪ E(G) → {1, 2,…,p + q} such that the set of edge-weights of all edges in G, {w(xy) = ρ(x) + ρ(xy) + ρ(y) : xy ∈ E(G)}, forms an arit...
AN EFFICIENT MODIFIED CUCKOO SEARCH OPTIMIZATION WITH THE RATIONAL BARRIER FUNCTION
Recent modern optimization algorithms are often very successful in solving NP-hard improvement problems. One of the main disadvantages of the search algorithm in cuckoo (CS) is the weakness of its ability as a local sear...