Cultura organizacional orientada à qualidade: um survey nas concessionárias automotivas brasileiras certificadas com a ISO 9001

The study aims identify the existence of quality culture in Brazilian automotive dealerships with ISO 9001, motivated by this research problem: exist a quality culture in this dealerships, which facilitates the adoption of quality practices supported by ISO 9001? For referencing, the theoretical review was written in five themes: organizational culture, quality culture, total quality management, ISO 9001 quality management system and the Brazilian automobile industry. As regards the methodological aspects, the research has an applied nature, with a quantitative approach, being exploratory in their objectives, and bibliographic, documental and survey as technical procedures. The organizations participating in the study were all Brazilian automotive dealerships certified with ISO 9001. The research intended cover all the 80 active dealers with ISO 9001 certification identified by the Brazilian Committee for Quality (ABNT CB-25). The survey recorded participation of 32 companies (response rate 40%). The questionnaire was sent to seller managers, formatted into five sections: 1) introductory message 2) manager profile, 3) reasons for implementation and benefits generated by ISO 4) adoption levels of quality practices and 5) diagnosis of organizational culture. The questions contained in sections 2 and 3 were structured in multiple choice, and in the remaining sections were structured in Likert 5-point scale. The statistical method used (data analysis), was the descriptive statistics, for data representation in frequency percentage (FP) and standard level (SL). The results showed that the interviewed dealerships have an organizational culture with very high levels of prevalence in "outcome orientation" and "attention to detail" cultural dimensions. In addition, about the other two dimensions considered conducive to quality (innovation and teamwork/respect for people), both observed high prevalence. Based on the present results, concluded that the organizational culture of Brazilian dealerships with ISO 9001 are quality oriented, being conducive to adoption of quality practices supported by TQM Systems. However, it is important to mention that the quality culture identified is not sufficiently developed to adopt quality practices at optimal levels, which sets up an unfavorable scenario to deals with highly rigorous customer

Algoritmo memético com infecção viral: uma aplicação ao problema do caixeiro viajante assimétrico

The Combinatorial Optimization is a basic area to companies who look for competitive advantages in the diverse productive sectors and the Assimetric Travelling Salesman Problem, which one classifies as one of the most important problems of this area, for being a problem of the NP-hard class and for possessing diverse practical applications, has increased interest of researchers in the development of metaheuristics each more efficient to assist in its resolution, as it is the case of Memetic Algorithms, which is a evolutionary algorithms that it is used of the genetic operation in combination with a local search procedure. This work explores the technique of Viral Infection in one Memetic Algorithms where the infection substitutes the mutation operator for obtaining a fast evolution or extinguishing of species (KANOH et al, 1996) providing a form of acceleration and improvement of the solution . For this it developed four variants of Viral Infection applied in the Memetic Algorithms for resolution of the Assimetric Travelling Salesman Problem where the agent and the virus pass for a symbiosis process which favored the attainment of a hybrid evolutionary algorithms and computational viable

Algoritmo Q-learning como estratégia de exploração e/ou explotação para metaheurísticas GRASP e algoritmo genético

Techniques of optimization known as metaheuristics have achieved success in the resolution of many problems classified as NP-Hard. These methods use non deterministic approaches that reach very good solutions which, however, don t guarantee the determination of the global optimum. Beyond the inherent difficulties related to the complexity that characterizes the optimization problems, the metaheuristics still face the dilemma of xploration/exploitation, which consists of choosing between a greedy search and a wider exploration of the solution space. A way to guide such algorithms during the searching of better solutions is supplying them with more knowledge of the problem through the use of a intelligent agent, able to recognize promising regions and also identify when they should diversify the direction of the search. This way, this work proposes the use of Reinforcement Learning technique - Q-learning Algorithm - as exploration/exploitation strategy for the metaheuristics GRASP (Greedy Randomized Adaptive Search Procedure) and Genetic Algorithm. The GRASP metaheuristic uses Q-learning instead of the traditional greedy-random algorithm in the construction phase. This replacement has the purpose of improving the quality of the initial solutions that are used in the local search phase of the GRASP, and also provides for the metaheuristic an adaptive memory mechanism that allows the reuse of good previous decisions and also avoids the repetition of bad decisions. In the Genetic Algorithm, the Q-learning algorithm was used to generate an initial population of high fitness, and after a determined number of generations, where the rate of diversity of the population is less than a certain limit L, it also was applied to supply one of the parents to be used in the genetic crossover operator. Another significant change in the hybrid genetic algorithm is the proposal of a mutually interactive cooperation process between the genetic operators and the Q-learning algorithm. In this interactive/cooperative process, the Q-learning algorithm receives an additional update in the matrix of Q-values based on the current best solution of the Genetic Algorithm. The computational experiments presented in this thesis compares the results obtained with the implementation of traditional versions of GRASP metaheuristic and Genetic Algorithm, with those obtained using the proposed hybrid methods. Both algorithms had been applied successfully to the symmetrical Traveling Salesman Problem, which was modeled as a Markov decision process

Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço

The metaheuristics techiniques are known to solve optimization problems classified as NP-complete and are successful in obtaining good quality solutions. They use non-deterministic approaches to generate solutions that are close to the optimal, without the guarantee of finding the global optimum. Motivated by the difficulties in the resolution of these problems, this work proposes the development of parallel hybrid methods using the reinforcement learning, the metaheuristics GRASP and Genetic Algorithms. With the use of these techniques, we aim to contribute to improved efficiency in obtaining efficient solutions. In this case, instead of using the Q-learning algorithm by reinforcement learning, just as a technique for generating the initial solutions of metaheuristics, we use it in a cooperative and competitive approach with the Genetic Algorithm and GRASP, in an parallel implementation. In this context, was possible to verify that the implementations in this study showed satisfactory results, in both strategies, that is, in cooperation and competition between them and the cooperation and competition between groups. In some instances were found the global optimum, in others theses implementations reach close to it. In this sense was an analyze of the performance for this proposed approach was done and it shows a good performance on the requeriments that prove the efficiency and speedup (gain in speed with the parallel processing) of the implementations performed

Estudo Comparativo de Métricas de Pontuação para Aprendizagem Estrutural de Redes Bayesianas

Bayesian networks are powerful tools as they represent probability distributions as graphs. They work with uncertainties of real systems. Since last decade there is a special interest in learning network structures from data. However learning the best network structure is a NP-Hard problem, so many heuristics algorithms to generate network structures from data were created. Many of these algorithms use score metrics to generate the network model. This thesis compare three of most used score metrics. The K-2 algorithm and two pattern benchmarks, ASIA and ALARM, were used to carry out the comparison. Results show that score metrics with hyperparameters that strength the tendency to select simpler network structures are better than score metrics with weaker tendency to select simpler network structures for both metrics (Heckerman-Geiger and modified MDL). Heckerman-Geiger Bayesian score metric works better than MDL with large datasets and MDL works better than Heckerman-Geiger with small datasets. The modified MDL gives similar results to Heckerman-Geiger for large datasets and close results to MDL for small datasets with stronger tendency to select simpler network structures

Aplicação de tensoativos não iônicos na recuperação de fluidos de perfuração poliméricos

The drilling fluid used to assist in the drilling operation of oil wells, accumulates solids inherent in the formation as it is circulated in the well, interfering in the fluid performance during operation. It is discarded after use. The disposal of these fluids causes one of the most difficult environmental problems in the world. This study aims to promote liquid phase separation of drilling fluids, which have circulated in oil wells, and enable this recovered liquid to formulate a new fluid. For this, non-ionic surfactants were used in order to select the best outcome in phase separation. Five real water-based drilling fluids were utilized, which were collected directly from the fields of drilling oil wells, classified as polymeric fluids. The methodology used consisted in combining the fluid with surfactant and then subjecting it to a process of centrifugation or decantation. The decantating tests were scheduled through experimental planning 23 and 32, using as variables the percentage (%) of surfactant utilized and the stirring time in minutes. The surfactants used were ethoxylated nonylphenol and lauryl alcohol ethoxylated with different degrees of ethoxylation. Phase separation was monitored first by tests of stability, and subsequently by the height of the interface in beakers of 100 mL. The results showed that from the surfactants studied, the lauryl alcohol ethoxylated with 3 ethoxylation units has been the most effective in the phase separation process of the drilling fluids tested. The statistical tool used was of great industrial value regarding the programming phase separation in drilling fluids. In conclusion, the liquid phase separated using surfactant can be reused for a new formulation of drilling fluid with similar properties of a new fluid, assuring its efficiency. And in the resulting analysis it is also suggested that the adsorption is the mechanism that leads the phase separation, with surfactant adsorbing in the active solids

Aí marcador de especificidade de SN indefinidos: um estudo funcionalista com implicações para o ensino

This body of work aims to describe and analyze the behavior of the Aí specificity marker of indefinite Noun Phrases (NP), one of the many functions this linguistic item is developing in contemporary Brazilian Portuguese. From the Functional Linguistic theory perspective, the North American declivity, this project intends to outline the possible grammaticalization trajectory taken by the Aí specificity marker. It will be followed from its function as a spatial deitic up to its integration of indefinite NP, and the action of the fundamental principles of the theory, such as iconicity and informativity, will be observed on the use of this item. Following this, Aí specificity marker behavior will be described in respect to various linguistic and social factors: type of text where the occurrence is encountered, language modality in which the latter is produced, syntactic function developed by the NP specified by Aí , the existence or lack of material intervening between Aí and the NP nuclear noun, informational status of the NP adjugated to Aí , and finally, sex, education and age of the speaker. The occurrence of conversational implicatures will also be verified (GRICE, 1982) within the contexts of Aí specificity marker use. Reflections on the teaching of grammar will be made, as well as on the possibility and validity of working with noun phrase specificity markers in elementary and high school Portuguese language classes. The data used in this research project stem from Corpus Discurso & Gramática A língua falada e escrita na cidade do Natal (FURTADO DA CUNHA, 1998), and from Corpus Discurso & Gramática A língua falada e escrita na cidade do Rio de Janeiro (VOTRE; OLIVEIRA, 1995)

AI, LA, ALI e AQUI: gramaticalização de um paradigma emergente no domínio funcional da especificação nominal

In the light of the Functional Linguistic Theory, in its North-American version (HOPPER, 1987, 1991, 1998, 2008, 2010; GIVÓN, 2001; LEHMANN, 2002; HOPPER; TRAUGOTT, 2003; FURTADO DA CUNHA; OLIVEIRA; MARTELOTTA, 2003, among others), the general objective of this research is to demonstrate, based on morphosyntactic and semantic-pragmatic properties, that AQUI (HERE), AÍ, ALI and LÁ (THERE) are part of an emerging paradigm in Brazilian Portuguese recently constituted and still developing of forms indicating specificity in indefinite noun phrases (NP). The data that make up the corpus of this research were collected in the following large Brazilian oral corpora: the Corpus Discurso & Gramática: a língua falada e escrita na cidade de Natal (FURTADO DA CUNHA, 1998), the Banco Conversacional de Natal (FURTADO DA CUNHA, 2010), the Projeto Variação Linguística no Estado da Paraíba VALPB (HORA, 2005) and the Projeto Variação Linguística Urbana na Região Sul do Brasil VARSUL (VANDRESEN, 2002). Firstly, the behavior of the specificity markings AQUI, AÍ, ALI and LÁ is described with respect to many factors of morphosyntactic and semantic-pragmatic nature: type of construction in which the markers appeared; existence or not of intervening material between the specificity marker item and the NP s nuclear noun; type of noun to which AQUI, AÍ, ALI and LÁ are linked; syntactic function of the specified SN; informational status of the NP to which the specificity markers AQUI, AÍ, ALI and LÁ are attached; occurrence of conversational implicatures (GRICE, 1982) in the context of use of these specificity markers. Next, a possible grammaticalization trajectory is outlined, according to which AQUI, AÍ, ALI and LÁ would had gone from an early spatial deictic indication to the specificity indication. The results point to the existence of forms with varying degree of emergence in this new paradigm of nominal specification, with AÍ being, probably, the item most grammaticalized, followed by LÁ, then ALI and AQUI, which permanence in the paradigm do not yet appear to be consolidated

Respostas fisiológicas durante teste de caminhada dos 6 minutos em mulheres com diferentes níveis de adiposidade

Backgroud: Obesity is a major public health problem and is related to the low physical capacity when obese are compared to no-obese people, however the cause of this limitation is not completely understood. The measurement associated of physiological response to the telemetric 6MWT adds information of metabolic and respiratory system for diagnose of the functional limitation. Objective: Analyze physiological, metabolic and ventilatory responses in women with different body fat during the 6MWT. Methods: 32 women (8 non-obese, 8 Overweight, 8 Obese and 8 morbidly obese) were evaluated for anthropometry, lung function and exercise capacity. Results: Morbidly obese walked the shortest distance (400.2±38.7m), had lower VO2/Kg (12.75±3.20l/Kg/min) and lower R (0.74± 0.11) in the 6MWT compared to other groups. Analyses of metabolic (VO2 and VCO2) and respiratory (VE, VT and BF) during the test did not identify differences between groups. The evaluation of cardiac function (O2 pulse) found higher values in the OM (12.3 ± 4.9ml/bat). Conclusion: The OM had worse performance in the 6MWT compared to other groups. The physical performance may be reduced in this population related to a protocol-dependent response because the speed of 6MWT is self-adjusted allows the individual himself select the intensity of the test, making it set at a speed where there is energy saving

Avaliação da poatencialidade da perlita natural e expandida na adsorção de metais

The contamination by metal ions has been occurring for decades through the introduction of liquid effluent not treated, mainly from industrial activities, rivers and lakes, affecting water quality. For that the effluent can be disposed in water bodies, environmental standards require that they be adequately addressed, so that the concentration of metals does not exceed the limits of standard conditions of release in the receptor. Several methods for wastewater treatment have been reported in the literature, but many of them are high cost and low efficiency. The adsorption process has been used as effective for removal of metal ions. This paper presents studies to evaluate the potential of perlite as an adsorbent for removing metals in model solution. Perlite, in its natural form (NP) and expanded (EP), was characterized by X-ray fluorescence, X-ray diffraction, surface area analysis using nitrogen adsorption (BET method), scanning electron microscopy and Fourier transform infrared spectroscopy. The physical characteristic and chemical composition of the material presented were appropriate for the study of adsorption. Adsorption experiments by the method of finite bath for model solutions of metal ions Cr3+, Cu2+, Mn2+ and Ni2+ were carried out in order to study the effect of pH, mass of the adsorbent and the contact time on removal of ions in solution. The results showed that perlite has good adsorption capacity. The NP has higher adsorption capacity (mg g-1) than the EP. According to the values of the constant of Langmuir qm (mg g-1), the maximum capacity of the monolayer was obtained and in terms of proportion of mass, we found the following order experimental adsorption: Cr3+ (2.194 mg g- 1) > Ni2+ (0.585 mg g-1) > Mn2+ (0.515 mg g-1) > Cu2+ (0.513 mg g-1) and Cr3+ (1.934 mg g-1)> Ni2+ (0.514 mg g-1) > Cu2+ (0.421 mg g-1) > Mn2+ (0.364 mg g-1) on the NP and EP, respectively. The experimental data were best fitted the Langmuir model compared to Freundlich for Cu2+, Mn2+ and Ni2+. However, for the Cr3+, both models fit the experimental data

O problema do caixeiro viajante alugador : um estudo algorítmico

The Car Rental Salesman Problem (CaRS) is a variant of the classical Traveling Salesman Problem which was not described in the literature where a tour of visits can be decomposed into contiguous paths that may be performed in different rental cars. The aim is to determine the Hamiltonian cycle that results in a final minimum cost, considering the cost of the route added to the cost of an expected penalty paid for each exchange of vehicles on the route. This penalty is due to the return of the car dropped to the base. This paper introduces the general problem and illustrates some examples, also featuring some of its associated variants. An overview of the complexity of this combinatorial problem is also outlined, to justify their classification in the NPhard class. A database of instances for the problem is presented, describing the methodology of its constitution. The presented problem is also the subject of a study based on experimental algorithmic implementation of six metaheuristic solutions, representing adaptations of the best of state-of-the-art heuristic programming. New neighborhoods, construction procedures, search operators, evolutionary agents, cooperation by multi-pheromone are created for this problem. Furtermore, computational experiments and comparative performance tests are conducted on a sample of 60 instances of the created database, aiming to offer a algorithm with an efficient solution for this problem. These results will illustrate the best performance reached by the transgenetic algorithm in all instances of the dataset

O problema biobjetivo da árvore geradora quadrática em adjacência de arestas

The Quadratic Minimum Spanning Tree Problem (QMST) is a version of the Minimum Spanning Tree Problem in which, besides the traditional linear costs, there is a quadratic structure of costs. This quadratic structure models interaction effects between pairs of edges. Linear and quadratic costs are added up to constitute the total cost of the spanning tree, which must be minimized. When these interactions are restricted to adjacent edges, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). AQMST and QMST are NP-hard problems that model several problems of transport and distribution networks design. In general, AQMST arises as a more suitable model for real problems. Although, in literature, linear and quadratic costs are added, in real applications, they may be conflicting. In this case, it may be interesting to consider these costs separately. In this sense, Multiobjective Optimization provides a more realistic model for QMST and AQMST. A review of the state-of-the-art, so far, was not able to find papers regarding these problems under a biobjective point of view. Thus, the objective of this Thesis is the development of exact and heuristic algorithms for the Biobjective Adjacent Only Quadratic Spanning Tree Problem (bi-AQST). In order to do so, as theoretical foundation, other NP-hard problems directly related to bi-AQST are discussed: the QMST and AQMST problems. Bracktracking and branch-and-bound exact algorithms are proposed to the target problem of this investigation. The heuristic algorithms developed are: Pareto Local Search, Tabu Search with ejection chain, Transgenetic Algorithm, NSGA-II and a hybridization of the two last-mentioned proposals called NSTA. The proposed algorithms are compared to each other through performance analysis regarding computational experiments with instances adapted from the QMST literature. With regard to exact algorithms, the analysis considers, in particular, the execution time. In case of the heuristic algorithms, besides execution time, the quality of the generated approximation sets is evaluated. Quality indicators are used to assess such information. Appropriate statistical tools are used to measure the performance of exact and heuristic algorithms. Considering the set of instances adopted as well as the criteria of execution time and quality of the generated approximation set, the experiments showed that the Tabu Search with ejection chain approach obtained the best results and the transgenetic algorithm ranked second. The PLS algorithm obtained good quality solutions, but at a very high computational time compared to the other (meta)heuristics, getting the third place. NSTA and NSGA-II algorithms got the last positions

Um estudo algorítmico para otimização do plano de tratamento da radioterapia conformal

This work performs an algorithmic study of optimization of a conformal radiotherapy plan treatment. Initially we show: an overview about cancer, radiotherapy and the physics of interaction of ionizing radiation with matery. A proposal for optimization of a plan of treatment in radiotherapy is developed in a systematic way. We show the paradigm of multicriteria problem, the concept of Pareto optimum and Pareto dominance. A generic optimization model for radioterapic treatment is proposed. We construct the input of the model, estimate the dose given by the radiation using the dose matrix, and show the objective function for the model. The complexity of optimization models in radiotherapy treatment is typically NP which justifyis the use of heuristic methods. We propose three distinct methods: MOGA, MOSA e MOTS. The project of these three metaheuristic procedures is shown. For each procedures follows: a brief motivation, the algorithm itself and the method for tuning its parameters. The three method are applied to a concrete case and we confront their performances. Finally it is analyzed for each method: the quality of the Pareto sets, some solutions and the respective Pareto curves

Algoritomos transgenéticos aplicados ao problema da árvore geradora biobjetivo

The Multiobjective Spanning Tree is a NP-hard Combinatorial Optimization problem whose application arises in several areas, especially networks design. In this work, we propose a solution to the biobjective version of the problem through a Transgenetic Algorithm named ATIS-NP. The Computational Transgenetic is a metaheuristic technique from Evolutionary Computation whose inspiration relies in the conception of cooperation (and not competition) as the factor of main influence to evolution. The algorithm outlined is the evolution of a work that has already yielded two other transgenetic algorithms. In this sense, the algorithms previously developed are also presented. This research also comprises an experimental analysis with the aim of obtaining information related to the performance of ATIS-NP when compared to other approaches. Thus, ATIS-NP is compared to the algorithms previously implemented and to other transgenetic already presented for the problem under consideration. The computational experiments also address the comparison to two recent approaches from literature that present good results, a GRASP and a genetic algorithms. The efficiency of the method described is evaluated with basis in metrics of solution quality and computational time spent. Considering the problem is within the context of Multiobjective Optimization, quality indicators are adopted to infer the criteria of solution quality. Statistical tests evaluate the significance of results obtained from computational experiments

Um estudo algorítmico da programação da intervenção de sondas de produção

This work approaches the Scheduling Workover Rigs Problem (SWRP) to maintain the wells of an oil field, although difficult to resolve, is extremely important economical, technical and environmental. A mathematical formulation of this problem is presented, where an algorithmic approach was developed. The problem can be considered to find the best scheduling service to the wells by the workover rigs, taking into account the minimization of the composition related to the costs of the workover rigs and the total loss of oil suffered by the wells. This problem is similar to the Vehicle Routing Problem (VRP), which is classified as belonging to the NP-hard class. The goal of this research is to develop an algorithmic approach to solve the SWRP, using the fundamentals of metaheuristics like Memetic Algorithm and GRASP. Instances are generated for the tests to analyze the computational performance of the approaches mentioned above, using data that are close to reality. Thereafter, is performed a comparison of performance and quality of the results obtained by each one of techniques used