Desenvolvimento de solução para o problema de alocação de navios em berços de terminais portuários: aplicação de algoritmos genéticos e otimização por nuvens de partículas

This work proposes two optimization algorithms for the solution of the Berth Allocation Problem (PAB). Due to the economic development of the country, it became necessary for the improvement of means of transport, which mainly shipping. For this, you need a better system management port, you will receive a lot of ships carrying cargo. In this work the PAB is approached so that the goals are to reduce costs and time handling in ports. For this, we applied two computational techniques, genetic algorithms and optimization for cloud particles, to obtain the best results for this problem. The results obtained with each type of algorithm are compared to conclude which method is more efficient for the port system

Uso de algoritmos genéticos na otimização do sistema de coleta do palhiço de cana-de-açúcar

The Brazilian government has convinced the world that ethanol deriving from sugar cane is a promissory means of sustainable fuel for vehicles. There is a great growth of ex vehicles , i.e, run both by ethanol and gasoline, due to competent automotive industries and e cient alcohol production technology. In 2009 and 2010 the ethanol production was 25.7 billion liters and 53.8% of sugar cane production was destined to alcohol production. Nevertheless, the sugar production also derived from sugar cane should increase in 2011. Brazil produced 33 million tons of sugar in the last harvest. With sugar cane on the rise production is arising new environmental problems. The harvest using mechanized cut besides improving the logistic transportation system leaves the generating residue in the eld. This residue is a mixture of straw, leavings and scrap of sugar cane named sugar cane crop residue and corresponds to 30% of biomass and can be burned and produce electricity by cogeneration. But the transport the sugar cane crop from the eld is expensive due costs involved in the transport system. This work aims to propose a formulation for the bales collecting problem from sugar cane eld to mill that minimize the costs involved in the transport system. The computational tests use the C++ language and an algorithm based on genetic algorithms techniques

Modelos matemáticos e computacionais em dengue

This work was developed starting the study of traditionals mathematical models that describe the epidemiology of infectious díseases by direct or indirect transmission. We did the classical approach of equilibrium solutions search, its analysis of stability analytically and by numerical solutions. After, we applied these techniques in a compartimental model of Dengue transmission that consider the mosquito population (susceptible vector Vs and 'infected vector VI), human population (suseeptíble humans S, infected humans I and recovered humans R) and just one sorotype floating in this population. We found the equilibrium solutions and from their analises, it was possible find the reprodution rate of dísease and which define if the disease will be endemic or not in the population.- ext, we used the method described a..~, [1] to study the infíuence of seasonalíty at vírus transmission, when it just acts on one of rates related with the vector. Lastly, we made de modeling considering the periodicity of alI rates, thereby building, a modeI with temporal dependence that permits to study periodicity of transmission through of the approach of parametrical ressonance and genetic algorithm

Novo algoritimo genético para problemas de cobertura de conjuntos

The Set Covering Problem (SCP) plays an important role in Operational Research since it can be found as part of several real-world problems. In this work we report the use of a genetic algorithm to solve SCP. The algorithm starts with a population chosen by a randomized greedy algorithm. A new crossover operator and a new adaptive mutation operator were incorporated into the algorithm to intensify the search. Our algorithm was tested for a class of non-unicost SCP obtained from OR-Library without applying reduction techniques. The algorithms found good solutions in terms of quality and computational time. The results reveal that the proposed algorithm is able to find a high quality solution and is faster than recently published approaches algorithm is able to find a high quality solution and is faster than recently published approaches using the OR-Library.

Identificação de parâmetros em sistemas rotativos utilizando funções de otimização e observadores de estado

Pós-graduação em Engenharia Mecânica - FEIS

Improvements in the sensibility of MSA-GA tool using COFFEE objective function

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

Developing an optimization tool for evaluating the transmission system expansion

The transmission system is responsible for connecting the power generators to consumers safely and reliably, its constant expansion is necessary to transport increasing amounts of electricity. In order to help the power systems engineers, an optimization tool for optimize the expansion of the transmission system was developed using the modeling method of the linearized load flow and genetic. This tool was designed to simulate the impact of different scenarios on the cost of transmission expansion. The proposed tool was used to simulate the effects of the presence of distributed generation in the expansion of a fictitious transmission system, where it was found a clear downward trend in investment required for the expansion of the transmission system taking account of increasing levels of distributed generation.

Diferentes métodos de aglutinação para melhoria de processos com múltiplas respostas

Pós-graduação em Engenharia Mecânica - FEG

Metaheuristics for a crop rotation problem

This paper presents a mathematical model adapted from literature for the crop rotation problem with demand constraints (CRP-D). The main aim of the present work is to study metaheuristics and their performance in a real context. The proposed algorithms for solution of the CRP-D are a genetic algorithm, a simulated annealing and hybrid approaches: a genetic algorithm with simulated annealing and a genetic algorithm with local search algorithm. A new constructive heuristic was also developed to provide initial solutions for the metaheuristics. Computational experiments were performed using a real planting area and semi-randomly generated instances created by varying the number, positions and dimensions of the lots. The computational results showed that these algorithms determined good feasible solutions in a short computing time as compared with the time spent to get optimal solutions, thus proving their efficacy for dealing with this practical application of the CRP-D.

Algoritmo neurogenético com vistas para o planejamento de rotas de robôs móveis autônomos

Pós-graduação em Ciência da Computação - IBILCE

An approach to implement data fusion techniques in wireless sensor networks using genetic machine learning algorithms

Wireless Sensor Networks (WSNs) can be used to monitor hazardous and inaccessible areas. In these situations, the power supply (e.g. battery) of each node cannot be easily replaced. One solution to deal with the limited capacity of current power supplies is to deploy a large number of sensor nodes, since the lifetime and dependability of the network will increase through cooperation among nodes. Applications on WSN may also have other concerns, such as meeting temporal deadlines on message transmissions and maximizing the quality of information. Data fusion is a well-known technique that can be useful for the enhancement of data quality and for the maximization of WSN lifetime. In this paper, we propose an approach that allows the implementation of parallel data fusion techniques in IEEE 802.15.4 networks. One of the main advantages of the proposed approach is that it enables a trade-off between different user-defined metrics through the use of a genetic machine learning algorithm. Simulations and field experiments performed in different communication scenarios highlight significant improvements when compared with, for instance, the Gur Game approach or the implementation of conventional periodic communication techniques over IEEE 802.15.4 networks. © 2013 Elsevier B.V. All rights reserved.

Transmission system expansion planning by an extended genetic algorithm

The paper presents an extended genetic algorithm for solving the optimal transmission network expansion planning problem. Two main improvements have been introduced in the genetic algorithm: (a) initial population obtained by conventional optimisation based methods; (b) mutation approach inspired in the simulated annealing technique, the proposed method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Excellent performance is reported in the test results section of the paper for a difficult large-scale real-life problem: a substantial reduction in investment costs has been obtained with regard to previous solutions obtained via conventional optimisation methods and simulated annealing algorithms; statistical comparison procedures have been employed in benchmarking different versions of the genetic algorithm and simulated annealing methods.

Permanent Genetic Resources added to Molecular Ecology Resources Database 1 May 2009-31 July 2009

This article documents the addition of 512 microsatellite marker loci and nine pairs of Single Nucleotide Polymorphism (SNP) sequencing primers to the Molecular Ecology Resources Database. Loci were developed for the following species: Alcippe morrisonia morrisonia, Bashania fangiana, Bashania fargesii, Chaetodon vagabundus, Colletes floralis, Coluber constrictor flaviventris, Coptotermes gestroi, Crotophaga major, Cyprinella lutrensis, Danaus plexippus, Fagus grandifolia, Falco tinnunculus, Fletcherimyia fletcheri, Hydrilla verticillata, Laterallus jamaicensis coturniculus, Leavenworthia alabamica, Marmosops incanus, Miichthys miiuy, Nasua nasua, Noturus exilis, Odontesthes bonariensis, Quadrula fragosa, Pinctada maxima, Pseudaletia separata, Pseudoperonospora cubensis, Podocarpus elatus, Portunus trituberculatus, Rhagoletis cerasi, Rhinella schneideri, Sarracenia alata, Skeletonema marinoi, Sminthurus viridis, Syngnathus abaster, Uroteuthis (Photololigo) chinensis, Verticillium dahliae, Wasmannia auropunctata, and Zygochlamys patagonica. These loci were cross-tested on the following species: Chaetodon baronessa, Falco columbarius, Falco eleonorae, Falco naumanni, Falco peregrinus, Falco subbuteo, Didelphis aurita, Gracilinanus microtarsus, Marmosops paulensis, Monodelphis Americana, Odontesthes hatcheri, Podocarpus grayi, Podocarpus lawrencei, Podocarpus smithii, Portunus pelagicus, Syngnathus acus, Syngnathus typhle,Uroteuthis (Photololigo) edulis, Uroteuthis (Photololigo) duvauceli and Verticillium albo-atrum. This article also documents the addition of nine sequencing primer pairs and sixteen allele specific primers or probes for Oncorhynchus mykiss and Oncorhynchus tshawytscha; these primers and assays were cross-tested in both species.

Genetic variation between several species of sections Extranervosae, Caulorrhizae, Heteranthae, and Triseminatae (genus Arachis) estimated by DNA polymorphism

Genetic variation within and among accessions of the genus Arachis representing sections Extranervosae, Caulorrhizae, Heteranthae, and Triseminatae was evaluated using RFLP and RAPD markers. RAPD markers revealed a higher level of genetic diversity than did RFLP markers, both within and among the species evaluated. Phenograms based on various band-matching algorithms revealed three major clusters of similarity among the sections evaluated. The first group included the species from section Extranervosae, the second group consisted of sections Triseminatae, Caulorrhizae, and Heteranthae, and the third group consisted of one accession of Arachis hypogaea, which had been included as a representative of section Arachis. The phenograms obtained from the RAPD and RFLP data were similar but not identical. Arachis pietrarellii, assayed only by RAPD, showed a high degree of genetic similarity with Arachis villosulicarpa. This observation supported the hypothesis that these two species are closely related. It was also shown that accession V 7786, previously considered to be Arachis sp. aff. pietrarellii, and assayed using both RFLPs and RAPDs, was possibly a new species from section Extranervosae, but very distinct from A. pietrarellii.

Planning of secondary distribution circuits through evolutionary algorithms

In this work, the planning of secondary distribution circuits is approached as a mixed integer nonlinear programming problem (MINLP). In order to solve this problem, a dedicated evolutionary algorithm (EA) is proposed. This algorithm uses a codification scheme, genetic operators, and control parameters, projected and managed to consider the specific characteristics of the secondary network planning. The codification scheme maps the possible solutions that satisfy the requirements in order to obtain an effective and low-cost projected system-the conductors' adequate dimensioning, load balancing among phases, and the transformer placed at the center of the secondary system loads. An effective algorithm for three-phase power flow is used as an auxiliary methodology of the EA for the calculation of the fitness function proposed for solutions of each topology. Results for two secondary distribution circuits are presented, whereas one presents radial topology and the other a weakly meshed topology. © 2005 IEEE.