Agir, aprender, formar, intervir, agir uma experiência dos consultores internos na gestão do conhecimento da Petrobrás UN-RNCE

This research aims at studying the formation of internal consultants in organizational setting in the joint resolution of problems, around the conversion of knowledge. The objective of research is to understand and explain the meanings attributed by Petrobras internal consultants to their practice and training for the conversion process of tacit knowledge into explicit, around the joint resolution of their problems with their collaborators. It has directed the next question: what the meanings assigned by the consultants of Unidade de Negócios Rio Grande do Norte e Ceara (UN-RNCE) in Knowledge Management (KM), for their interventionist and formative practices in problem solving, as well as conversion of tacit knowledge in explicit? This paper has assumed that there is a dual logic integrated into its daily practices: solving troubles and converting knowledge. The thesis has considered the daily practices of these consultants are characterized as epistemic spaces and permanent education through the conversion of knowledge. It has adopted the principles of multi-referential approach as foundations, regarding the translation of a variety of angles, perspectives and prospects which allow the interpretation and understanding of complex issues that are part of conversion of knowledge. The understanding and explanation of the senses are based on the methodology of the comprehensive interview; taking ownership is the sensitive listening for comprehensive interpretation of oral discourses of ten consultants, in addition to the autoscopy that putting into practice, thus, the stance of the researcher as an intellectual craftsman. Furthermore, it has assessed that the limits and possibilities for training and learning in the conversion of knowledge arise, on one hand from a predominantly driven training culture by the paradigm of technical rationality and one the other hand, from a set of relationship to knowledge and relation to know , revealed in the search for training in other dimensions. There are tensions between the local and global demands located in a situation marked by a systemic organization of knowledge. However, the context is perceived by researchers as impregnated by the discontinuity, unpredictability and uncertainty; mobilizing a number of elements necessary for the mediation in training practices of these consultants. Finally, it has set an instrumental and technological support, restricting the formation and undermining the position of the consultancy as nuclear function in Knowledge Management

Metaheurísticas evolutivas para o problema de roteamento de unidades móveis de pistoneio

This paper presents metaheuristic strategies based on the framework of evolutionary algorithms (Genetic and Memetic) with the addition of Technical Vocabulary Building for solving the Problem of Optimizing the Use of Multiple Mobile Units Recovery of Oil (MRO units). Because it is an NP-hard problem, a mathematical model is formulated for the problem, allowing the construction of test instances that are used to validate the evolutionary metaheuristics developed

Metodologia estatística na solução do problema do caixeiro viajante e na avaliação de algoritmos : um estudo aplicado à transgenética computacional

The problems of combinatory optimization have involved a large number of researchers in search of approximative solutions for them, since it is generally accepted that they are unsolvable in polynomial time. Initially, these solutions were focused on heuristics. Currently, metaheuristics are used more for this task, especially those based on evolutionary algorithms. The two main contributions of this work are: the creation of what is called an -Operon- heuristic, for the construction of the information chains necessary for the implementation of transgenetic (evolutionary) algorithms, mainly using statistical methodology - the Cluster Analysis and the Principal Component Analysis; and the utilization of statistical analyses that are adequate for the evaluation of the performance of the algorithms that are developed to solve these problems. The aim of the Operon is to construct good quality dynamic information chains to promote an -intelligent- search in the space of solutions. The Traveling Salesman Problem (TSP) is intended for applications based on a transgenetic algorithmic known as ProtoG. A strategy is also proposed for the renovation of part of the chromosome population indicated by adopting a minimum limit in the coefficient of variation of the adequation function of the individuals, with calculations based on the population. Statistical methodology is used for the evaluation of the performance of four algorithms, as follows: the proposed ProtoG, two memetic algorithms and a Simulated Annealing algorithm. Three performance analyses of these algorithms are proposed. The first is accomplished through the Logistic Regression, based on the probability of finding an optimal solution for a TSP instance by the algorithm being tested. The second is accomplished through Survival Analysis, based on a probability of the time observed for its execution until an optimal solution is achieved. The third is accomplished by means of a non-parametric Analysis of Variance, considering the Percent Error of the Solution (PES) obtained by the percentage in which the solution found exceeds the best solution available in the literature. Six experiments have been conducted applied to sixty-one instances of Euclidean TSP with sizes of up to 1,655 cities. The first two experiments deal with the adjustments of four parameters used in the ProtoG algorithm in an attempt to improve its performance. The last four have been undertaken to evaluate the performance of the ProtoG in comparison to the three algorithms adopted. For these sixty-one instances, it has been concluded on the grounds of statistical tests that there is evidence that the ProtoG performs better than these three algorithms in fifty instances. In addition, for the thirty-six instances considered in the last three trials in which the performance of the algorithms was evaluated through PES, it was observed that the PES average obtained with the ProtoG was less than 1% in almost half of these instances, having reached the greatest average for one instance of 1,173 cities, with an PES average equal to 3.52%. Therefore, the ProtoG can be considered a competitive algorithm for solving the TSP, since it is not rare in the literature find PESs averages greater than 10% to be reported for instances of this size.