A genetic algorithm for the resource constrained multi-project scheduling problem

This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm.

Analysis of the domain of applicability of an algorithm for a resources system selection problem for Distributed/Agile/Virtual Enterprises integration

The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.

Catalytic behavior of alkali-treated Pt/HMOR n-hexane hydroisomerization

Bifunctional Pt-HMOR catalysts were prepared by incipient wetness impregnation of various desilicated MOR obtained by alkaline treatment using NaOH concentrations ranging from 0.1 to 0.5 M. The zeolite structural changes upon modification were investigated by several techniques including powder X-ray diffraction,Al-27 and Si-29 MAS-NMR spectroscopy, N-2 adsorption, pyridine adsorption followed by infrared spectroscopy and the catalytic model reaction of m-xylene transformation. For low alkaline concentration the zeolite acidity is preserved, along with a slight increase of the volume correspondent to the larger micropores due to the removal of extra-framework debris already existent at the parent zeolite. At higher NaOH concentrations there is a significant loss of crystalinity and acidity as well as the formation of mesoporosity. The characterization of the metal function shows similar patterns for Pt-HMOR and Pt-M/0.1 samples, with Pt particles located mainly inside the inner porosity. In contrast, large Pt particles become visible at the intercrystalline mesoporosity of MOR crystals developed during the desilication treatments at severe alkaline conditions. The catalytic results obtained for n-hexane hydroisomerization showed an improved selectivity for dibranched over monobranched isomers for Pt-M/0.1 sample, likely due to the preservation of the support acidity and the slight enlargement of the micropores. This work is a new example in which the mesoporous development does not improve the catalytic efficiency of the zeolites, whereas mild alkaline desilication might be considered as an effective solution to produce customized catalysts with enhanced performance for a given application. (C) 2014 Elsevier B.V. All rights reserved.

Adaptive tackling of the swinging problem for a 2 DOF crane – payload system

The control of a crane carrying its payload by an elastic string corresponds to a task in which precise, indirect control of a subsystem dynamically coupled to a directly controllable subsystem is needed. This task is interesting since the coupled degree of freedom has little damping and it is apt to keep swinging accordingly. The traditional approaches apply the input shaping technology to assist the human operator responsible for the manipulation task. In the present paper a novel adaptive approach applying fixed point transformations based iterations having local basin of attraction is proposed to simultaneously tackle the problems originating from the imprecise dynamic model available for the system to be controlled and the swinging problem, too. The most important phenomenological properties of this approach are also discussed. The control considers the 4th time-derivative of the trajectory of the payload. The operation of the proposed control is illustrated via simulation results.

A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem

This paper presents a biased random-key genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. Active schedules are constructed using a priority-rule heuristic in which the priorities of the activities are defined by the genetic algorithm. A forward-backward improvement procedure is applied to all solutions. The chromosomes supplied by the genetic algorithm are adjusted to reflect the solutions obtained by the improvement procedure. The heuristic is tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.

A two-level genetic algorithm for the multi-mode resource-constrained project scheduling problem

This paper presents a genetic algorithm for the multimode resource-constrained project scheduling problem (MRCPSP), in which multiple execution modes are available for each of the activities of the project. The objective function is the minimization of the construction project completion time. To solve the problem, is applied a two-level genetic algorithm, which makes use of two separate levels and extend the parameterized schedule generation scheme by introducing an improvement procedure. It is evaluated the quality of the schedule and present detailed comparative computational results for the MRCPSP, which reveal that this approach is a competitive algorithm.

Positive radial solutions of the Dirichlet problem for the Minkowski-Curvature equation in a ball

We study the existence and multiplicity of positive radial solutions of the Dirichlet problem for the Minkowski-curvature equation { -div(del upsilon/root 1-vertical bar del upsilon vertical bar(2)) in B-R, upsilon=0 on partial derivative B-R,B- where B-R is a ball in R-N (N >= 2). According to the behaviour off = f (r, s) near s = 0, we prove the existence of either one, two or three positive solutions. All results are obtained by reduction to an equivalent non-singular one-dimensional problem, to which variational methods can be applied in a standard way.

Crossing genetic and swarm intelligence algorithms to generate logic circuits

Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary ideas of natural selection and genetic. The basic concept of GAs is designed to simulate processes in natural system necessary for evolution, specifically those that follow the principles first laid down by Charles Darwin of survival of the fittest. On the other hand, Particle swarm optimization (PSO) is a population based stochastic optimization technique inspired by social behavior of bird flocking or fish schooling. PSO shares many similarities with evolutionary computation techniques such as GAs. The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. PSO is attractive because there are few parameters to adjust. This paper presents hybridization between a GA algorithm and a PSO algorithm (crossing the two algorithms). The resulting algorithm is applied to the synthesis of combinational logic circuits. With this combination is possible to take advantage of the best features of each particular algorithm.

Sedentary behavior in Brazilian children and adolescents: a systematic review

ABSTRACT OBJECTIVE To describe the methodological characteristics of the studies selected and assess variables associated with sedentary behavior in Brazilian children and adolescents. METHODS For this systematic review, we searched four electronic databases: PubMed, Web of Knowledge, LILACS, SciELO. Also, electronic searches were applied in Google Scholar. A supplementary search was conducted in the references lists of the included articles and in non-indexed journals. We included observational studies with children and adolescents aged from three to 19 years developed in Brazil, presenting analyses of associations based on regression methods and published until September 30, 2014. RESULTS Of the 255 potential references retrieved by the searches, 49 met the inclusion criteria and composed the descriptive synthesis. In this set, we identified a great number of cross-sectional studies (n = 43; 88.0%) and high methodological variability on the types of sedentary behavior assessed, measurement tools and cut-off points used. The variables most often associated with sedentary behavior were “high levels of body weight” (in 15 out of 27 studies; 55.0%) and “lower level of physical activity” (in eight out of 16 studies; 50.0%). CONCLUSIONS The findings of this review raise the following demands to the Brazilian agenda of sedentary behavior research geared to children and adolescents: development of longitudinal studies, validation of measuring tools, establishment of risk cut-offs, measurement of sedentary behavior beyond screen time and use of objective measures in addition to questionnaires. In the articles available, the associations between sedentary behavior with “high levels of body weight” and “low levels of physical activity” were observed in different regions of Brazil.

Mechanical behavior and localized failure modes in a porous basalt from the Azores

Basaltic rocks are the main component of the oceanic upper crust, thus of potential interest for water and geothermal resources, storage of CO2 and volcanic edifice stability. In this work, we investigated experimentally the mechanical behavior and the failure modes of a porous basalt, with an initial connected porosity of 18%. Results were acquired under triaxial compression experiments at confining pressure in the range of 25-200 MPa on water saturated samples. In addition, a purely hydrostatic test was also performed to reach the pore collapse critical pressure P*. During hydrostatic loading, our results show that the permeability is highly pressure dependent, which suggests that the permeability is mainly controlled by pre-existing cracks. When the sample is deformed at pressure higher than the pore collapse pressure P*, some very small dilatancy develops due to microcracking, and an increase in permeability is observed. Under triaxial loading, two modes of deformation can be highlighted. At low confining pressure (Pc < 50 MPa), the samples are brittle and shear localization occurs. For confining pressure > 50 MPa, the stress-strain curves are characterized by strain hardening and volumetric compaction. Stress drops are also observed, suggesting that compaction may be localized. The presence of compaction bands is confirmed by our microstructure analysis. In addition, the mechanical data allows us to plot the full yield surface for this porous basalt, which follows an elliptic cap as previously observed in high porosity sandstones and limestones.

A random key based genetic algorithm for the resource constrained project scheduling problem

This paper presents a genetic algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities of the activities are defined by the genetic algorithm. The heuristic generates parameterized active schedules. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.

Integrando problem frames com aspectos

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Informática

An optimization approach for the job shop scheduling problem

This paper presents an optimization approach for the job shop scheduling problem (JSSP). The JSSP is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. The proposed approach is based on a genetic algorithm technique. The scheduling rules such as SPT and MWKR are integrated into the process of genetic evolution. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities and delay times of the operations are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local search heuristic is applied to improve the solution. The approach is tested on a set of standard instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed approach.

A new approach to the initial value problem

5th Portuguese Conference on Automatic Control, September, 5-7, 2002, Aveiro, Portugal

Ser menina é gostar de cor-de-rosa: desocultar questões de género no jardim de infância

Relatório da Prática Profissional Supervisionada apresentado à Escola Superior de Educação de Lisboa para obtenção de grau de mestre em Educação Pré-Escolar