Search

One field of the most fertile in the study of the strategies is the Theory of Games, which aims to capture the behavior of individuals in strategic situations. This paper aims to analyze the evolution of strategies of suppliers and borrowers credit by proposing two simultaneous and reflective games, making, for both, computational simulations. Two games were held simultaneously, where the results of an influence the pay-offs of each other. After 400 generations, it's believed that this is due to the complex interaction between the two groups of actors and is not seen as a setback by the authors of the study, whereas data on the evolution of strategies is fertile ground for valuable analysis on the interaction of actors in this study. The conclusions show the potential of techniques for analyzing and understanding the strategic behavior of SMCs in their relationship with suppliers of large companies. [ABSTRACT FROM AUTHOR]

The Chinese Postman Problem is an optimization problem that aims to cover all the arcs of a graph, minimizing the total distance traveled. Can be applied to non-directed graphs (two-way streets), directed (one-way streets) or mixed (some two-way streets and other one-way). These arch for the route is done by algorithms that generate approximate solutions. In this work we used a genetic algorithm for the construction of routes that approximate the optimal solution. The main objective is to minimize the cost of the course of collection and transportation solid waste in the city of Irati (PR), Brazil. The application of the algorithm was performed in a downtown area. Were used formapping, real data courtesy of City Hall officials. With the help of the online application Google Earth, we obtained the geographical coordinates of the vertices of the graph associated with the problem. The results generated by the genetic algorithm were compared with the optimal solution obtained by LINGO ® 12.0 software. These results were satisfactory for this mall instance of problems analyzed. [ABSTRACT FROM AUTHOR]