Summary

The contribution of this paper is to present how a series of operations research techniques can help prepare a more pleasant trip to a tourist visiting a region. The techniques involved are Multi attribute models, the traveling salesman problem, the routing problem and the problem of the shortest route.

The model indicates which places to visit and what the tourism corridors are to continue to provide him with greater satisfaction, according to the restrictions laid down therein.

Abstract

The contribution of esta paper is to present how a series of Operations Research techniques, can Contribute to prepare pleasant trip for a tourist visiting a Certain Region. The Involved techniques are: The multiattribute models, the traveling salesman problem, the vehicle routing problem and the problem of shorter route.


The model Indicates Which Which places to visit and routes to follow, so That Provides the greater satisfaction, According to the constraints established the tourist.

Introduction

The evolution of the media, which increasingly facilitate the handling of the information, has made those wishing to visit, especially for tourism, a country, city, place or place, every day become more demanding and regardless the reason for your visit, always determine a number of issues waiting to be satisfied in their travels, so that they are more pleasant, so it is necessary that the different localities wishing to receive visitors, prepare for the tourist, and make efforts to maximize the satisfaction that they could provide.

Speaking maximization, albeit satisfaction of tourists, suggests Operations Research, and so the question of whether it might be possible to use algorithms to maximize the satisfaction of tourists arises with certain well-defined purposes visit a particular place. In response to this question the purpose of this investigation: to create an algorithm that starting order of preference, obtained through a multi-attribute model, which for a visitor have a set of tourist sites, you indicate which or what to visit and what tourist runners to follow it is, to provide him with greater satisfaction, according to the restrictions laid down by the.

tourism

Tourism is not a science (Buollón, 1990, Davila and Di Campo, 1997), since, Tourism, was not born of a theory, but a spontaneous reality, while its components are material and not ideal. However, tourism has its rules, as well, so that there tourism is necessary for the user to remain outside their usual home at least one day and spend the night in a different place of

His habitual residence. Moreover (Cardenas, 1991), inbound tourism and domestic tourism is established, the latter being on the residents of a country, while the former refers to that produced in a country when they reach him residents of other nations with the intention to remain limited in the same time.

Another concept to note is the reference to tourist space, as the territorial presence and distribution of interest, in which case one can speak of tourist area, tourist area or resort, depending on the size and area of ​​influence of the space.

It should also emphasize the concept of tourism corridors, which are pathways connecting areas, areas, facilities, attractive, input ports inbound tourism and squares stations domestic tourism, which function as the element It gives structure to space tourism. These corridors will be analyzed from the point of view of routing problems, and this is the next thing to discuss in this conceptual framework for this work.

Pathing problems

Then the problems discussed routes, especially those that are of most interest when establishing tourist routes: Problems shortest path routing problem and the traveling salesman problem.

Shortest Path Problems

Although you may have other generalities, in general we can say: if in a R (V, E, d) network, where d is a quantity called Distance function, E represents the set of arcs or directed sides and V the set of vertices or nodes, you want to know some of the following:

the shortest path between any pair of vertices V,
the shortest path between a couple of them (x, y) well-defined path, or
the shortest path between one of them can be denoted as a source or root (s)
Routing problems

Generally it is known as the problem of road vehicle (Vehicle routing problem [VRP]), one can say that is to visit a set of clients, using a fleet of vehicles, within the constraints of these vehicles, as well as restrictions customers, drivers and the like, with the final aim to minimize the cost of the operation, which usually involves a combination of minimizing the distances and the number of used vehicles, respecting the vehicles leaving a place and return to the same place.

Traveling salesman problems

The Traveling salesman problem (Traveling Salesman Problem [TSP]) is the typical problem of trade visitors, that from a local source (root node), should visit once and only once a set of cities (remaining vertices graph), and return to the source node, provided that the total distance, according to the measurement parameter, is minimal.

Although there are already optimal solution, even for many cities the traveling salesman problem and its variations are still studying insistently, two of these variations are of paramount importance to this work: The traveling salesman problem maximization and the problem of multiple commercial travelers.

Traveling salesman problems maximization

The traveling salesman problem maximization is not as common as the minimization, which is the natural case, however, his presence no longer interesting, and generally can point to, when you want to make the maximum travel, being a interesting case of the traveling salesman problem of maximizing the a company which organizes concerts or exhibitions in different locations in a city or different cities in a country and even in different countries in a continent, since the public could be in the neighboring towns, and not interested in returning to that environment immediately, but on the contrary, most remote in time as possible, so instead of having interest in the minimum travel is interested in the maximum travel.

conclusions

The first conclusion is that integration can make a set of tools of operations research to solve an everyday problem, as is the established tourist routes that maximize the satisfaction of tourists.

Not only should discuss problems of shorter routes, as is easy to wait, or routing problem or traveling salesman, where through them a better hierarchy is allowed and therefore choose more appropriately, both places They are representing the greatest satisfaction, as routes that offer.

It should also be separate commentary measure of satisfaction, that while this on a general scale is actually unique to each individual and measures directly, and expressed by, the more you satisfy a certain place or tourist corridor.

Furthermore it should be noted the flexibility, since every tourist

It is operated independently, as is done with every day of his visit, which may be of different lengths, and even could separate the morning of the afternoon and evening or combine afternoon and evening or morning and afternoon without it means any difficulty.

In addition to flexibility before mentioned, it also should be noted that operations research helps us to estimate the time actually spent on each day of visit and the daily satisfaction estimated, as well as the total, although this level of satisfaction, as it was said, either own for every tourist.

It should also be noted the use, albeit indirectly, in two variants. The traveling salesman problem, the traveler agent maximization, maximizing satisfaction, and multiple traveling salesman, with multiple limiting factors driving time constraints.

Bibliography

• Applegate, D.; Bixby, R.; Chvatal, V.; Cook, W.; Helsgaun, K. (2004) “Optimal tour of Sweeden”
• Belfiore P., Patricia Y.; Yoshizaki Y. H. (2006) “Scatter search for heterogeneous fleet vehicle routing problems with time windows and split deliveries”, Producao 16 (3):455–469.
• Boullón, R. (1990). Las Actividades Turísticas y Recreacionales Trillas, México.
• Cárdenas, F. (1991)