Busca heurística através de algoritmo genético e memético com construção de vocábulos para o problema de atribuição de localidades a anéis Sonet

Telecommunications play a key role in contemporary society. However, as new technologies are put into the market, it also grows the demanding for new products and services that depend on the offered infrastructure, making the problems of planning telecommunications networks, despite the advances in technology, increasingly larger and complex. However, many of these problems can be formulated as models of combinatorial optimization, and the use of heuristic algorithms can help solving these issues in the planning phase. In this project it was developed two pure metaheuristic implementations Genetic algorithm (GA) and Memetic Algorithm (MA) plus a third hybrid implementation Memetic Algorithm with Vocabulary Building (MA+VB) for a problem in telecommunications that is known in the literature as Problem SONET Ring Assignment Problem or SRAP. The SRAP arises during the planning stage of the physical network and it consists in the selection of connections between a number of locations (customers) in order to meet a series of restrictions on the lowest possible cost. This problem is NP-hard, so efficient exact algorithms (in polynomial complexity ) are not known and may, indeed, even exist

Análise de usabilidade de livro digital na EaD: aplicação da avaliação heurística proposta por Pechansky

Nowadays the Distance Learning (DL) is in its fifth generation and New Information and Communication Technologies (NICT) mediate it. In this technological context it is then called Distance e-Learning (DeL). DeL has also in the e-books a potential interactive tool to the collaborative learning. So, this study was accomplished with the purpose of analyzing the e-books developed by SEDIS – Secretaria de Educação a Distância (Department of Distance Learning). This study was performed in two phases: Firstly it was done an exploratory study to check out the reading and the handling of digital e-learning material available to the student-users. These e-books are obtainable on SEDIS Moodle platform. Secondly, it was performed some analysis of an e-book sample by means of the heuristic evaluation. This research aims both to identify potential problems and give some suggestions to solve them. At last it is presented a final report with diagnosis and suggestions for a more applicable design in order to optimize the e-book by means of the distance e-learning usability guidelines

Análise da sobre-reação e sub-reação nos ativos de primeira e segunda lina do mercado acionário brasileiro

The Behavioral Finance develop as it is perceived anomalies in these markets efficient. This fields of study can be grouped into three major groups: heuristic bias, tying the shape and inefficient markets. The present study focuses on issues concerning the heuristics of representativeness and anchoring. This study aimed to identify the then under-reaction and over-reaction, as well as the existence of symmetry in the active first and second line of the Brazilian stock market. For this, it will be use the Fuzzy Logic and the indicators that classify groups studied from the Discriminant Analysis. The highest present, indicator in the period studied, was the Liabilities / Equity, demonstrating the importance of the moment to discriminate the assets to be considered "winners" and "losers." Note that in the MLCX biases over-reaction is concentrated in the period of financial crisis, and in the remaining periods of statistically significant biases, are obtained by sub-reactions. The latter would be in times of moderate levels of uncertainty. In the Small Caps the behavioral responses in 2005 and 2007 occur in reverse to those observed in the Mid-Large Cap. Now in times of crisis would have a marked conservatism while near the end of trading on the Bovespa speaker, accompanied by an increase of negotiations, there is an overreaction by investors. The other heuristics in SMLL occurred at the end of the period studied, this being a under-reaction and the other a over-reaction and the second occurring in a period of financial-economic more positive than the first. As regards the under / over-reactivity in both types, there is detected a predominance of either, which probably be different in the context in MLCX without crisis. For the period in which such phenomena occur in a statistically significant to note that, in most cases, such phenomena occur during the periods for MLCX while in SMLL not only biases are less present as there is no concentration of these at any time . Given the above, it is believed that while detecting the presence of bias behavior at certain times, these do not tend to appear to a specific type or heuristics and while there were some indications of a seasonal pattern in Mid- Large Caps, the same behavior does not seem to be repeated in Small Caps. The tests would then suggest that momentary failures in the Efficient Market Hypothesis when tested in semistrong form as stated by Behavioral Finance. This result confirms the theory by stating that not only rationality, but also human irrationality, is limited because it would act rationally in many circumstances

Memorial de formação: um dispositivo de pesquisa ação - formação

La recherche prend comme point de départ la dimension formative du mémoire de formation, considerée comme constitutive de l´écriture de soi, et cherche à problématiser cette dimension au tour du questionnement suivant: Comment le mémoire de formation devient-il un instrument de recherche-action-formation? Les analyses s´appuient sur les principes théoriques du paradigme anthropoformateur, proposé par Pineau (2005), les études réalisées par Passeggi (2006ª, 2006b, 2007, 2008ª, 2008b) sur les mémoires, les travaux de recherche de Nóvoa (1988, 1995), de Josso (2004), de Souza (2006) et de Fontana (2000), qui conçoivent la formação du point de vue de l´ apprenant. L´univers de la recherche s´est circonscrit à la situation de formation des éducateurs de la zone rurale, étudiants en Pédagogie dans le PROFORMAÇÃO (CAMEAM), à l´Univeristé de l´Etat du Rio Grande du Nord (UERN), pendant le second semestre de 2005. La recherche a croisé diférents types de démarche pour recueillir les données empiriques: l´observation du processus d´élaboration des mémoires; un questionnaire; des entretiens informels avec les enseignants en formation et avec les formateurs; et 09 mémoires, écrits par les participants de la recherche. Les analyses des données empiriques montrent que l´écriture des mémoires, en tant que démarche de recherche-action-formation, révelent que la dimension formative se dédouble en d´autres dimensions: etnosociologique, heuristique, herméneutique, social et afective, autopoiétique et politique. Dans la quête de soi (recherche), mise en oeuvre dans et par l´écriture (action), chaque narrateur construit de nouveaux sens à la vie et (re)signifient les représentations de soi (formation). Les résultats confirment la richesse et les potentialités du mémoire, même dans des conditions non ideal, ce qui permet d´affirmer as valeur travail académique important dans la formation des enseignants

Um algoritmo híbrido para o problema de roteamento de veículos com frotas heterogêneas

This paper aims to propose a hybrid meta-heuristics for the Heterogeneous Fleet Vehicle Routing Problem (HVRP), which is a combinatorial optimization problem NP-hard, and is characterized by the use of a limited fleet consists of different vehicles with different capacities. The hybrid method developed makes use of a memetic algorithm associated with the component optimizer Vocabulary Building. The resulting hybrid meta-heuristic was implemented in the programming language C + + and computational experiments generated good results in relation to meta-heuristic applied in isolation, proving the efficiency of the proposed method.

Contribuições da pesquisa operacional para gestão da produção e operações : uma análise exploratória da literatura

This research aims to investigate the evolution presented during three decades (1980, 1990 and 2000) of using the tools of Operations Research (OR) as a suport to decision making in Production Operation Management (POM). Hypothesis tests were made to verify the proportional growth of a given area over the decades to the detriment of the areas of facility layout, capacity planning, production scheduling and inventory management. Six journals were selected and from them more than 800 articles were used for classification and analysis in the grounds of review. It also discussed possible ways for future research and comparisons are made with other papers of literature review. As a result, it was found that areas of heuristics and simulation showed a greater quantity of contributions in all POM areas of this study

Desenvolvimento de um modelo computacional para a ampliação do atendimento do Programa de Acessibilidade Especial Porta a Porta - PRAE

Worldwide, the demand for transportation services for persons with disabilities, the elderly, and persons with reduced mobility have increased in recent years. The population is aging, governments need to adapt to this reality, and this fact could mean business opportunities for companies. Within this context is inserted the Programa de Acessibilidade Especial porta a porta PRAE, a door to door public transportation service from the city of Natal-RN in Brazil. The research presented in this dissertation seeks to develop a programming model which can assist the process of decision making of managers of the shuttle. To that end, it was created an algorithm based on methods of generating approximate solutions known as heuristics. The purpose of the model is to increase the number of people served by the PRAE, given the available fleet, generating optimized schedules routes. The PRAE is a problem of vehicle routing and scheduling of dial-a-ride - DARP, the most complex type among the routing problems. The validation of the method of resolution was made by comparing the results derived by the model and the currently programming method. It is expected that the model is able to increase the current capacity of the service requests of transport

Um protocolo de comunicação multicast na camada de aplicação com Consciência de Localização

Internet applications such as media streaming, collaborative computing and massive multiplayer are on the rise,. This leads to the need for multicast communication, but unfortunately group communications support based on IP multicast has not been widely adopted due to a combination of technical and non-technical problems. Therefore, a number of different application-layer multicast schemes have been proposed in recent literature to overcome the drawbacks. In addition, these applications often behave as both providers and clients of services, being called peer-topeer applications, and where participants come and go very dynamically. Thus, servercentric architectures for membership management have well-known problems related to scalability and fault-tolerance, and even peer-to-peer traditional solutions need to have some mechanism that takes into account member's volatility. The idea of location awareness distributes the participants in the overlay network according to their proximity in the underlying network allowing a better performance. Given this context, this thesis proposes an application layer multicast protocol, called LAALM, which takes into account the actual network topology in the assembly process of the overlay network. The membership algorithm uses a new metric, IPXY, to provide location awareness through the processing of local information, and it was implemented using a distributed shared and bi-directional tree. The algorithm also has a sub-optimal heuristic to minimize the cost of membership process. The protocol has been evaluated in two ways. First, through an own simulator developed in this work, where we evaluated the quality of distribution tree by metrics such as outdegree and path length. Second, reallife scenarios were built in the ns-3 network simulator where we evaluated the network protocol performance by metrics such as stress, stretch, time to first packet and reconfiguration group time

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.

Determinação de Chaveamento para Recomposição do Serviço em Redes de Distribuição de Energia Elétrica em Média Tensão Através de Métodos Baseado em Parâmetros de Sensibilidade

The reconfiguration of a distribution network is a change in its topology, aiming to provide specific operation conditions of the network, by changing the status of its switches. It can be performed regardless of any system anomaly. The service restoration is a particular case of reconfiguration and should be performed whenever there is a network failure or whenever one or more sections of a feeder have been taken out of service for maintenance. In such cases, loads that are supplied through lines sections that are downstream of portions removed for maintenance may be supplied by the closing of switches to the others feeders. By classical methods of reconfiguration, several switches may be required beyond those used to perform the restoration service. This includes switching feeders in the same substation or for substations that do not have any direct connection to the faulted feeder. These operations can cause discomfort, losses and dissatisfaction among consumers, as well as a negative reputation for the energy company. The purpose of this thesis is to develop a heuristic for reconfiguration of a distribution network, upon the occurrence of a failure in this network, making the switching only for feeders directly involved in this specific failed segment, considering that the switching applied is related exclusively to the isolation of failed sections and bars, as well as to supply electricity to the islands generated by the condition, with significant reduction in the number of applications of load flows, due to the use of sensitivity parameters for determining voltages and currents estimated on bars and lines of the feeders directly involved with that failed segment. A comparison between this process and classical methods is performed for different test networks from the literature about networks reconfiguration

O ensino por problemas nos livros de química: uma análise do conteúdo estrutura atômica

La enseñanza de problemas se ha investigado en la didáctica de las ciencias naturales como un medio importante para desarrollar el aprendizaje de los conocimientos científicos y la formación de competencias básicas. Dada la importancia de los libros de texto para la enseñanza de la ciencia, con el fin de verificar el enfoque de la enseñanza con problemas en los libros de química, se procedió a una investigación realizada en las obras aprobadas en PNLD 2012, basado en el método de Análisis de Contenido. Se analizó el contenido de la estructura atómica, como marco teórico la perspectiva de la enseñanza problémica, basada en el materialismo histórico y dialéctico. Metodológicamente la investigación presenta un carácter cualitativo. Los resultados del análisis de contenido corroboraron la cuestiones de estudio iniciales relacionadas con la explicación centrándose en los problemas, lo que permitió inferir la elaboración de una Unidad Didactica basada en los métodos problémicos para la enseñanza de los modelos atómicos por la exposición problémica, la conversación heurística y la busca parcial, como forma de aproximar los estudiantes a la naturaleza de las ciencias naturales y contribuir al desarrollo de actitudes positivas en el aprendizaje de la química

Comunicação gráfica em interfaces de hipermídia de educação a distância via web

This study aims to analyze the communication graphics of layouts of hypermedia interfaces oriented to Distance Education via the Internet. This proposal is justified by widening the offer of courses that modality and the consequent application of items of hypermedia for teaching-learning. The method of analysis involved the search nethnographic, addressed to the cycle student intermediary of the Training Program Continuing Medias in Education, and the evaluation heuristic of the interfaces of Virtual Learning Environment "E-Proinfo" and of the modules of the Cycle. This evaluation we observed the implementation of the attributes of usability and the degree of interactivity of each interface. The results revealed an inefficient implementation of the attributes of usability, which meant a consequent reduction of the levels of interactivity. As proposing the present Design Virtual Learning, a model of hypermedia layout, designed to generate usability for Virtual learning environments and extend the acquisition of literancy for students and tutors. This proposal design not hypermedia aims the demarcation of models pre-conceived, but the proposal of layout in which each element of hypermedia is applied with a view to generate a seaworthiness intuitive, more agile and efficient, in these ambients

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

Uma abordagem por nuvem de partículas para problemas de otimização combinatória

Combinatorial optimization problems have the goal of maximize or minimize functions defined over a finite domain. Metaheuristics are methods designed to find good solutions in this finite domain, sometimes the optimum solution, using a subordinated heuristic, which is modeled for each particular problem. This work presents algorithms based on particle swarm optimization (metaheuristic) applied to combinatorial optimization problems: the Traveling Salesman Problem and the Multicriteria Degree Constrained Minimum Spanning Tree Problem. The first problem optimizes only one objective, while the other problem deals with many objectives. In order to evaluate the performance of the algorithms proposed, they are compared, in terms of the quality of the solutions found, to other approaches

Técnicas baseadas em etnografia e prototipagem no Design de interface de aplicativo mobile para gerenciamento acadêmico

Baseado na metodologia de design participativo, este artigo relata o processo de pesquisa e desenvolvimento de uma versão mobile de um sistema já existente para desktop e amplamente utilizado para o compartilhamento de informações acadêmicas em uma universidade federal do Brasil. A pesquisa foi realizada em duas etapas. Na ‘Etapa I’ foram realizados estudos baseados em etnografia envolvendo docentes e discentes: Grupo de Foco, Análise Contextual, Avaliação Heurística Participativa e Avaliação Cooperativa. Por meio dos resultados foi possível identificar funcionalidades e requisitos desejáveis, problemas de usabilidade de uma versão mobile já em processo inicial de desenvolvimento, bem como e elaboração de uma nova interface gráfica. Na ‘Etapa II’ foram avaliados modelos de interação por meio de protótipos especificamente projetados para testes no mecanismo de lançamento de frequência do sistema mobile que, em seguida, foram avaliados através de testes de usabilidade e questionário de satisfação do usuário.