Project scheduling under multiple resources constraints using a genetic algorithm

The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. 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.

Project scheduling using a competitive genetic algorithm

- The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. 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

Optimal tuning of fractional controllers using genetic algorithms

This study addresses the optimization of fractional algorithms for the discrete-time control of linear and non-linear systems. The paper starts by analyzing the fundamentals of fractional control systems and genetic algorithms. In a second phase the paper evaluates the problem in an optimization perspective. The results demonstrate the feasibility of the evolutionary strategy and the adaptability to distinct types of systems.

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 genetic algorithm for the job shop scheduling with a new local search using Monte Carlo method

This paper presents a methodology for applying scheduling algorithms using Monte Carlo simulation. The methodology is based on a decision support system (DSS). The proposed methodology combines a genetic algorithm with a new local search using Monte Carlo Method. The methodology is applied to 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 methodology is tested on a set of standard instances taken from the literature and compared with others. The computation results validate the effectiveness of the proposed methodology. The DSS developed can be utilized in a common industrial or construction environment.

Optimal approximation of fractional derivatives through discrete-time fractions using genetic algorithms

This study addresses the optimization of rational fraction approximations for the discrete-time calculation of fractional derivatives. The article starts by analyzing the standard techniques based on Taylor series and Padé expansions. In a second phase the paper re-evaluates the problem in an optimization perspective by tacking advantage of the flexibility of the genetic algorithms.

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.

A mobile robot platform for open learning based on serious games and remote laboratories

Within the pedagogical community, Serious Games have arisen as a viable alternative to traditional course-based learning materials. Until now, they have been based strictly on software solutions. Meanwhile, research into Remote Laboratories has shown that they are a viable, low-cost solution for experimentation in an engineering context, providing uninterrupted access, low-maintenance requirements, and a heightened sense of reality when compared to simulations. This paper will propose a solution where both approaches are combined to deliver a Remote Laboratory-based Serious Game for use in engineering and school education. The platform for this system is the WebLab-Deusto Framework, already well-tested within the remote laboratory context, and based on open standards. The laboratory allows users to control a mobile robot in a labyrinth environment and take part in an interactive game where they must locate and correctly answer several questions, the subject of which can be adapted to educators' needs. It also integrates the Google Blockly graphical programming language, allowing students to learn basic programming and logic principles without needing to understand complex syntax.

The importance to update the guidelines for the use of genetic testing in noncancer patients in Brazil

The Brazilian National Regulatory Agency for Private Health Insurance and Plans has recently published a technical note defining the criteria for the coverage of genetic testing to diagnose hereditary cancer. In this study we show the case of a patient with a breast lesion and an extensive history of cancer referred to a private service of genetic counseling. The patient met both criteria for hereditary breast and colorectal cancer syndrome screening. Her private insurance denied coverage for genetic testing because she lacks current or previous cancer diagnosis. After she appealed by lawsuit, the court was favorable and the test was performed using next-generation sequencing. A deletion of MLH1 exon 8 was found. We highlight the importance to offer genetic testing using multigene analysis for noncancer patients.

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.

Serum trace elements in dysphagic gastrostomy candidates before endoscopic gastrostomy for long term enteral feeding

Background & aims - Patients who underwent endoscopic gastrostomy (PEG) present protein-energy malnutrition, but little is known about Trace Elements (TE), Zinc (Zn), Copper (Cu), Selenium (Se), Iron (Fe), Chromium (Cr). Our aim was the evaluation of serum TE in patients who underwent PEG and its relationship with serum proteins, BMI and nature of underlying disorder. Methods - A prospective observational study was performed collecting: patient's age, gender, underlying disorder, NRS-2002, BMI, serum albumin, transferrin and TE concentration. We used ferrozine colorimetric method for Fe; Inductively Coupled Plasma-Atomic Emission Spectroscopy for Zn/Cu; Furnace Atomic Absorption Spectroscopy for Se/Cr. The patients were divided into head and neck cancer (HNC) and neurological dysphagia (ND). Results - 146 patients (89 males), 21–95 years: HNC-56; ND-90. Low BMI in 78. Low values mostly for Zn (n = 122) and Fe (n = 69), but less for Se (n = 31), Cu (n = 16), Cr (n = 7); low albumin in 77, low transferrin in 94 and 66 with both proteins low. Significant differences between the groups of underlying disease only for Zn (t140.326 = −2,642, p < 0.01) and a correlation between proteins and TE respectively albumin and Zn (r = 0.197, p = 0.025), and albumin and Fe (r = 0.415, p = 0.000). Conclusions - When gastrostomy was performed, patients display low serum TE namely Zn, but also Fe, less striking regarding others TE. It was related with prolonged fasting, whatever the underlying disease. Low proteins were associated with low TE. Teams taking care of PEG-patients should use Zn supplementation and include other TE evaluation as part of the nutritional assessment of PEG candidates.

Implementation of fractional-order electromagnetic potential through a genetic algorithm

Several phenomena present in electrical systems motivated the development of comprehensive models based on the theory of fractional calculus (FC). Bearing these ideas in mind, in this work are applied the FC concepts to define, and to evaluate, the electrical potential of fractional order, based in a genetic algorithm optimization scheme. The feasibility and the convergence of the proposed method are evaluated.

Calculation of fractional derivatives of noisy data with genetic algorithms

This paper addresses the calculation of derivatives of fractional order for non-smooth data. The noise is avoided by adopting an optimization formulation using genetic algorithms (GA). Given the flexibility of the evolutionary schemes, a hierarchical GA composed by a series of two GAs, each one with a distinct fitness function, is established.

2D PCA-Based localization for mobile robots in unstructured environments

In this paper a new PCA-based positioning sensor and localization system for mobile robots to operate in unstructured environments (e. g. industry, services, domestic ...) is proposed and experimentally validated. The inexpensive positioning system resorts to principal component analysis (PCA) of images acquired by a video camera installed onboard, looking upwards to the ceiling. This solution has the advantage of avoiding the need of selecting and extracting features. The principal components of the acquired images are compared with previously registered images, stored in a reduced onboard image database, and the position measured is fused with odometry data. The optimal estimates of position and slippage are provided by Kalman filters, with global stable error dynamics. The experimental validation reported in this work focuses on the results of a set of experiments carried out in a real environment, where the robot travels along a lawn-mower trajectory. A small position error estimate with bounded co-variance was always observed, for arbitrarily long experiments, and slippage was estimated accurately in real time.

Extending access to remote labs from mobile devices in educational contexts

This paper describes how to extend the access to remote experiments from mobile devices, aiming to better engage digital native students who expect a more interactive and ubiquitous access mode. The extension is based on features of HTML5 and the jQuery Mobile framework, which allow accessing the experiments from different operating systems via the browser or native applications. As a result, users have a richer interaction mode with the experiments, which includes access from simple hand-held devices such as smartphones and PDAs. Extending the access to remote experiments, from simple devices, enables its use in other educational stages, such as high schools, where teachers struggle to engage students in STEM learning. By enabling students to use their everyday "technological companions", e.g. cellular phones, to access remote experiments, we seek to increase the educational value of this technology-enhanced learning resource.