Algorítmo evolucionário para a distribuição de produtos de petróleo por redes de polidutos

The distribution of petroleum products through pipeline networks is an important problem that arises in production planning of refineries. It consists in determining what will be done in each production stage given a time horizon, concerning the distribution of products from source nodes to demand nodes, passing through intermediate nodes. Constraints concerning storage limits, delivering time, sources availability, limits on sending or receiving, among others, have to be satisfied. This problem can be viewed as a biobjective problem that aims at minimizing the time needed to for transporting the set of packages through the network and the successive transmission of different products in the same pipe is called fragmentation. This work are developed three algorithms that are applied to this problem: the first algorithm is discrete and is based on Particle Swarm Optimization (PSO), with local search procedures and path-relinking proposed as velocity operators, the second and the third algorithms deal of two versions based on the Non-dominated Sorting Genetic Algorithm II (NSGA-II). The proposed algorithms are compared to other approaches for the same problem, in terms of the solution quality and computational time spent, so that the efficiency of the developed methods can be evaluated

Análise das medidas de boa e má diversidade na construção de comitês de classificadores através de metaheurísticas de otimização multiobjetivo

Committees of classifiers may be used to improve the accuracy of classification systems, in other words, different classifiers used to solve the same problem can be combined for creating a system of greater accuracy, called committees of classifiers. To that this to succeed is necessary that the classifiers make mistakes on different objects of the problem so that the errors of a classifier are ignored by the others correct classifiers when applying the method of combination of the committee. The characteristic of classifiers of err on different objects is called diversity. However, most measures of diversity could not describe this importance. Recently, were proposed two measures of the diversity (good and bad diversity) with the aim of helping to generate more accurate committees. This paper performs an experimental analysis of these measures applied directly on the building of the committees of classifiers. The method of construction adopted is modeled as a search problem by the set of characteristics of the databases of the problem and the best set of committee members in order to find the committee of classifiers to produce the most accurate classification. This problem is solved by metaheuristic optimization techniques, in their mono and multi-objective versions. Analyzes are performed to verify if use or add the measures of good diversity and bad diversity in the optimization objectives creates more accurate committees. Thus, the contribution of this study is to determine whether the measures of good diversity and bad diversity can be used in mono-objective and multi-objective optimization techniques as optimization objectives for building committees of classifiers more accurate than those built by the same process, but using only the accuracy classification as objective of optimization

Multicast packing problem: abordagem multiobjetivo

This work presents a algorithmic study of Multicast Packing Problem considering a multiobjective approach. The first step realized was an extensive review about the problem. This review serverd as a reference point for the definition of the multiobjective mathematical model. Then, the instances used in the experimentation process were defined, this instances were created based on the main caracteristics from literature. Since both mathematical model and the instances were definined, then several algoritms were created. The algorithms were based on the classical approaches to multiobjective optimization: NSGA2 (3 versions), SPEA2 (3 versions). In addition, the GRASP procedures were adapted to work with multiples objectives, two vesions were created. These algorithms were composed by three recombination operators(C1, C2 e C3), two operator for build solution, a mutation operator and a local search procedure. Finally, a long experimentation process was performed. This process has three stages: the first consisted of adjusting the parameters; the second was perfomed to indentify the best version for each algorithm. After, the best versions for each algorithm were compared in order to identify the best algorithm among all. The algorithms were evaluated based on quality indicators and Hypervolume Multiplicative Epsilon

Uma colônia de formigas para o caminho mais curto multiobjetivo

Multi-objective combinatorial optimization problems have peculiar characteristics that require optimization methods to adapt for this context. Since many of these problems are NP-Hard, the use of metaheuristics has grown over the last years. Particularly, many different approaches using Ant Colony Optimization (ACO) have been proposed. In this work, an ACO is proposed for the Multi-objective Shortest Path Problem, and is compared to two other optimizers found in the literature. A set of 18 instances from two distinct types of graphs are used, as well as a specific multiobjective performance assessment methodology. Initial experiments showed that the proposed algorithm is able to generate better approximation sets than the other optimizers for all instances. In the second part of this work, an experimental analysis is conducted, using several different multiobjective ACO proposals recently published and the same instances used in the first part. Results show each type of instance benefits a particular type of instance benefits a particular algorithmic approach. A new metaphor for the development of multiobjective ACOs is, then, proposed. Usually, ants share the same characteristics and only few works address multi-species approaches. This works proposes an approach where multi-species ants compete for food resources. Each specie has its own search strategy and different species do not access pheromone information of each other. As in nature, the successful ant populations are allowed to grow, whereas unsuccessful ones shrink. The approach introduced here shows to be able to inherit the behavior of strategies that are successful for different types of problems. Results of computational experiments are reported and show that the proposed approach is able to produce significantly better approximation sets than other methods

Using genetic algorithm to design protein sequence

In this work, genetic algorithms concepts along with a rotamer library for proteins side chains are used to optimize the tertiary structure of the hydrophobic core of Cytochrome b(562) starting from the known PDB structure of its backbone which is kept fixed while the side chains of the hydrophobic core are allowed to adopt the conformations present in the rotamer library. The atoms of the side chains forming the core interact via van der Waals energy. Besides the prediction of the native core structure, it is also suggested a set of different amino acid sequences for this core. Comparison between these new cores and the native are made in terms of their volumes, van der Waals energies values and the numbers of contacts made by the side chains forming the cores. This paper proves that genetic algorithms area efficient to design new sequence for the protein core. (C) 2007 Elsevier B.V. All rights reserved.

Search for anomalous heavy-flavor quark production in association with W bosons

We search for anomalous production of heavy-flavor quark jets in association with W bosons at the Fermilab Tevatron p(p) over bar Collider in final states in which the heavy-flavor quark content is enhanced by requiring at least one tagged jet in an event. Jets are tagged using one algorithm based on semileptonic decays of b/c hadrons, and another on their lifetimes. We compare e+jets (164 pb(-1)) and mu+jets (145 pb(-1)) channels collected with the D0 detector at root s = 1.96 TeV to expectations from the standard model and set upper limits on anomalous production of such events.

Search for pair production of scalar bottom quarks in p(p)over-bar collisions at root s = 1.96 TeV

A search for direct production of scalar bottom quarks ((b) over bar) is performed with 310 pb(-1) of data collected by the D0 experiment in p (p) over bar collisions at root s = 1.96 TeV at the Fermilab Tevatron Collider. The topology analyzed consists of two b jets and an imbalance in transverse momentum due to undetected neutralinos (chi(0)(1)), with chi(0)(1) assumed to be the lightest supersymmetric particle. We find the data consistent with standard model expectations, and set a 95% C.L. exclusion domain in the (m(b), m(chi 1)(0)) mass plane, improving significantly upon the results from run I of the Tevatron.

Search for heavy Majorana neutrinos in mu(+/-)mu(+/-) + jets and e(+/-)e(+/-) + jets events in pp collisions at root s=7 TeV

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

A combined search for the standard model Higgs boson at root S=1.96 TeV

We present new results of the search for WH --> lvb (b) over bar production in p (p) over bar collisions at a center-of-mass energy of root S = 1.96 TeV, based on a dataset with integrated luminosity of 0.44 fb(-1). We combine these new results with previously published searches by the do collaboration, for WH and ZH production analyzed in the E(T)b (b) over bar final state, for ZH (--> l(+)l(-)b (b) over bar) production, for WH (-->. WWW) production, and for H (--> W W) direct production. No signal-like excess is observed either in the W H analysis or in the combination of all D0 Higgs boson analyses. We set 95% C.L. (expected) upper limits on sigma(p (p) over bar --> WH) x B(H --> b (b) over bar) ranging from 1.6 (2.2) ph to 1.9 (3.3) pb for Higgs boson masses between 105 and 145 GeV, to be compared to the theoretical prediction of 0.13 pb for a Standard Model (SM) Higgs boson with mass in m(H) = 115 GeV. After combination with the other do Higgs boson searches, we obtain for in H = 115 GeV an observed (expected) limit 8.5 (12.1) times higher than the SM predicted Higgs boson production cross section. For m(H) = 160 GeV, the corresponding observed (expected) ratio is 10.2 (9.0). (C) 2008 Elsevier B.V. All rights reserved.

Search for anomalous Wtb couplings in single top quark production in p(p)over-bar collisions at root s=1.96 TeV

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

Search for microscopic black hole signatures at the Large Hadron Collider

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

Search for first generation scalar leptoquarks in the e nu jj channel in pp collisions at root s=7 TeV

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

Search for Anomalous Wtb Couplings in Single Top Quark Production

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

Search for Sneutrino Production in e mu Final States in 5.3 fb(-1) of p(p)over-bar Collisions at root s = 1.96 TeV

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

Search for Pair Production of First-Generation Scalar Leptoquarks in pp Collisions at root s=7 TeV

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