The open capacitated arc routing problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

GRASP with evolutionary path-relinking for the capacitated arc routing problem

The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.

Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm

A significant set of information stored in different databases around the world, can be shared through peer-topeer databases. With that, is obtained a large base of knowledge, without the need for large investments because they are used existing databases, as well as the infrastructure in place. However, the structural characteristics of peer-topeer, makes complex the process of finding such information. On the other side, these databases are often heterogeneous in their schemas, but semantically similar in their content. A good peer-to-peer databases systems should allow the user access information from databases scattered across the network and receive only the information really relate to your topic of interest. This paper proposes to use ontologies in peer-to-peer database queries to represent the semantics inherent to the data. The main contribution of this work is enable integration between heterogeneous databases, improve the performance of such queries and use the algorithm of optimization Ant Colony to solve the problem of locating information on peer-to-peer networks, which presents an improve of 18% in results. © 2011 IEEE.

Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support

In a peer-to-peer network, the nodes interact with each other by sharing resources, services and information. Many applications have been developed using such networks, being a class of such applications are peer-to-peer databases. The peer-to-peer databases systems allow the sharing of unstructured data, being able to integrate data from several sources, without the need of large investments, because they are used existing repositories. However, the high flexibility and dynamicity of networks the network, as well as the absence of a centralized management of information, becomes complex the process of locating information among various participants in the network. In this context, this paper presents original contributions by a proposed architecture for a routing system that uses the Ant Colony algorithm to optimize the search for desired information supported by ontologies to add semantics to shared data, enabling integration among heterogeneous databases and the while seeking to reduce the message traffic on the network without causing losses in the amount of responses, confirmed by the improve of 22.5% in this amount. © 2011 IEEE.

Análise do uso de SIG no roteamento dos veículos de coleta de resíduos sólidos domiciliares

Relata-se neste trabalho, a análise do uso de um Sistema de Informação Geográfica - SIG como ferramenta para roteirização de veículos de coleta de resíduos sólidos domiciliares. O software utilizado foi o TransCAD, versão 3.2, que permite desenvolver rotas utilizando algoritmos que incluem o procedimento de roteirização em arco. O objetivo é minimizar a extensão total a ser percorrida pelos veículos coletores. O estudo de caso foi realizado na cidade de Ilha Solteira - SP. Os dados coletados e os resultados obtidos pelo TransCAD foram processados no software Microsoft Excel. Os resultados obtidos demonstraram reduções percentuais de até 41% na distância total percorrida e de 68% no tempo total de percurso em relação ao serviço atual.

Predictive formulation of the Nambu-Jona-Lasinio model

A novel strategy to handle divergences typical of perturbative calculations is implemented for the Nambu-Jona-Lasinio model and its phenomenological consequences investigated. The central idea of the method is to avoid the critical step involved in the regularization process, namely, the explicit evaluation of divergent integrals. This goal is achieved by assuming a regularization distribution in an implicit way and making use, in intermediary steps, only of very general properties of such regularization. The finite parts are separated from the divergent ones and integrated free from effects of the regularization. The divergent parts are organized in terms of standard objects, which are independent of the ( arbitrary) momenta running in internal lines of loop graphs. Through the analysis of symmetry relations, a set of properties for the divergent objects are identified, which we denominate consistency relations, reducing the number of divergent objects to only a few. The calculational strategy eliminates unphysical dependencies of the arbitrary choices for the routing of internal momenta, leading to ambiguity-free, and symmetry-preserving physical amplitudes. We show that the imposition of scale properties for the basic divergent objects leads to a critical condition for the constituent quark mass such that the remaining arbitrariness is removed. The model becomes predictive in the sense that its phenomenological consequences do not depend on possible choices made in intermediary steps. Numerical results are obtained for physical quantities at the one-loop level for the pion and sigma masses and pion-quark and sigma-quark coupling constants.

Tracing metabolic routes of feed ingredients in tissues of broiler chickens using stable isotopes

The present study aimed to quantify the proportion of 13C from energy and protein feed ingredients that follow the metabolic routing of the liver and muscle in broiler chickens. A stable isotope of carbon technique was used that is based on the isotopic discrimination that occurs in the plants during the photosynthesis process. One-day-old male chicks were subjected to treatments based on free choice of energy and protein sources. Rice bran (R) and soybean meal (S), C3 plants, have higher isotopic ratios than corn (C), a C4 plant, and corn gluten meal (G). Choices were R+S, C+G, R+G, C+S, or R+C+G+S. A complete feed (CF) was a sixth treatment. Feed intake and BW were measured at 30 d of age, when liver and breast muscle were collected for isotopic analysis. Treatments affected the amount of feed intake and the choices of energy or protein sources. Complete feed had the largest intake, differing from the other treatments that had free-choice feeding. Final BW was a direct reflection of consumption by these birds in all treatments. The isotopic results indicated that the 13C/12C ratio was generally higher in breast muscle than in liver, probably because of higher protein content. Moreover, in the liver, the proportion of 13C retained from the energy ingredient was greater than the proportion from the protein ingredient. That is in contrast to muscle, where the proportion of 13C retained from the protein ingredient was greater than from the energy ingredient that was self-selected.

Traffic flow breakdown prediction using feature reduction through Rough-Neuro fuzzy Networks

The prediction of the traffic behavior could help to make decision about the routing process, as well as enables gains on effectiveness and productivity on the physical distribution. This need motivated the search for technological improvements in the Routing performance in metropolitan areas. The purpose of this paper is to present computational evidences that Artificial Neural Network ANN could be use to predict the traffic behavior in a metropolitan area such So Paulo (around 16 million inhabitants). The proposed methodology involves the application of Rough-Fuzzy Sets to define inference morphology for insertion of the behavior of Dynamic Routing into a structured rule basis, without human expert aid. The dynamics of the traffic parameters are described through membership functions. Rough Sets Theory identifies the attributes that are important, and suggest Fuzzy relations to be inserted on a Rough Neuro Fuzzy Network (RNFN) type Multilayer Perceptron (MLP) and type Radial Basis Function (RBF), in order to get an optimal surface response. To measure the performance of the proposed RNFN, the responses of the unreduced rule basis are compared with the reduced rule one. The results show that by making use of the Feature Reduction through RNFN, it is possible to reduce the need for human expert in the construction of the Fuzzy inference mechanism in such flow process like traffic breakdown. © 2011 IEEE.

Optimization of query results in peer-to-peer database supported by semantics

The development of new technologies that use peer-to-peer networks grows every day, with the object to supply the need of sharing information, resources and services of databases around the world. Among them are the peer-to-peer databases that take advantage of peer-to-peer networks to manage distributed knowledge bases, allowing the sharing of information semantically related but syntactically heterogeneous. However, it is a challenge to ensure the efficient search for information without compromising the autonomy of each node and network flexibility, given the structural characteristics of these networks. On the other hand, some studies propose the use of ontology semantics by assigning standardized categorization of information. The main original contribution of this work is the approach of this problem with a proposal for optimization of queries supported by the Ant Colony algorithm and classification though ontologies. The results show that this strategy enables the semantic support to the searches in peer-to-peer databases, aiming to expand the results without compromising network performance. © 2011 IEEE.

Métodos seguros para comunicação em sistemas de rede sem fio de múltiplos saltos

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Experiência audiovisual e infância: em busca do que escapa ao primeiro olhar

Pós-graduação em Educação - IBRC

Uso de sistema de informação geográfica para a análise do transporte e disposição final dos resíduos sólidos

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Análise de uso de SIG no sistema de coleta de resíduos sólidos domiciliares em uma cidade de pequeno porte

Pós-graduação em Engenharia Civil - FEIS

Saúde mental e trabalho: significados atribuídos pela equipe da saúde da família ao adoecimento dos usuários

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)