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

InOx thin films deposited by plasma assisted evaporation: application in light shutters

An integration of undoped InOx and commercial ITO thin films into laboratory assembled light shutter devices is made. Accordingly, undoped transparent conductive InOx thin films, about 100 nm thick, are deposited by radiofrequency plasma enhanced reactive thermal evaporation (rf-PERTE) of indium teardrops with no intentional heating of the glass substrates. The process of deposition occurs at very low deposition rates (0.1-0.3 nm/s) to establish an optimized reaction between the oxygen plasma and the metal vapor. These films show the following main characteristics: transparency of 87% (wavelength, lambda = 632.8 nm) and sheet resistance of 52 Omega/sq; while on commercial ITO films the transparency was of 92% and sheet resistance of 83 Omega/sq. The InOx thin film surface characterized by AFM shows a uniform grain texture with a root mean square surface roughness of Rq similar to 2.276 nm. In contrast, commercial ITO topography is characterized by two regions: one smoother with Rq similar to 0.973 nm and one with big grains (Rq similar to 3.617 nm). For the shutters assembled using commercial ITO, the light transmission coefficient (Tr) reaches the highest value (Tr-max) of 89% and the lowest (Tr-min) of 1.3% [13], while for the InOx shutters these values are 80.1% and 3.2%, respectively. Regarding the electric field required to achieve 90% of the maximum transmission in the ON state (E-on), the one presented by the devices assembled with commercial ITO coated glasses is 2.41 V/mu m while the one presented by the devices assembled with InOx coated glasses is smaller, 1.77 V/mu m. These results corroborate the device quality that depends on the base materials and fabrication process used. (C) 2014 Elsevier Ltd. All rights reserved.

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.

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.

Forest cover monitoring in the Bara district (Nepal) with remote sensing and geographic information systems

Dissertation submitted in partial fulfilment of the requirements for the Degree of Master of Science in Geospatial Technologies

Automated design of microwave discrete tuning differential capacitance circuits in Si-integrated technologies

A genetic algorithm used to design radio-frequency binary-weighted differential switched capacitor arrays (RFDSCAs) is presented in this article. The algorithm provides a set of circuits all having the same maximum performance. This article also describes the design, implementation, and measurements results of a 0.25 lm BiCMOS 3-bit RFDSCA. The experimental results show that the circuit presents the expected performance up to 40 GHz. The similarity between the evolutionary solutions, circuit simulations, and measured results indicates that the genetic synthesis method is a very useful tool for designing optimum performance RFDSCAs.

Approximating fractional derivatives through the generalized mean

This paper addresses the calculation of fractional order expressions through rational fractions. The article starts by analyzing the techniques adopted in the continuous to discrete time conversion. The problem is re-evaluated in an optimization perspective by tacking advantage of the degree of freedom provided by the generalized mean formula. The results demonstrate the superior performance of the new algorithm.

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.

Maximum-revenue tariff with different roles in a price-setting competition

Published also at Lecture Notes in Engineering and Computer Science

Calix[4]arene-carbazole-containing polymers: synthesis and properties

New highly fluorescent calix[4]arene-containing phenylene-alt-ethynylene-3,6- and 2,7-carbazolylene polymers (CALIX-PPE-CBZs) have been synthesized for the first time and their photophysical properties evaluated. Both polymers were obtained in good isolated yields (70-84%), having M-w ranging from 7660-26,700 g mol(-1). It was found that the diethynyl substitution (3,6- or 2,7-) pattern on the carbazole monomers markedly influences the degree of polymerization. The amorphous yellow polymers are freely soluble in several nonprotic organic solvents and have excellent film forming abilities. TG/DSC analysis evidences similar thermal behaviors for both polymers despite their quite different molecular weight distributions and main-chain connectivities (T-g, in the range 83-95 degrees C and decomposition onsets around 270 degrees C). The different conjugation lengths attained by the two polymers dictates much of their photophysical properties. Thus, whereas the fully conjugated CALIX-PPE-2,7-CBZ has its emission maximum at 430 nm (E-g = 2.84 eV; Phi(F) = 0.62, CHCl3), the 3,6-linked counterpart (CALIX-PPE-3,6-CBZ) fluoresces at 403 nm with a significant lower quantum yield (E-g = 3.06 eV; Phi(F) = 0.31, CHCl3). The optical properties of both polymers are predominantly governed by the intrachain electronic properties of the conjugated backbones owing to the presence of calix[4]arenes along the polymer chain which disfavor significant interchain interactions, either in fluid- or solid-state.

Automated synthesis procedure of RF discrete tuning differential capacitance circuits

The paper presents a RFDSCA automated synthesis procedure. This algorithm determines several RFDSCA circuits from the top-level system specifications all with the same maximum performance. The genetic synthesis tool optimizes a fitness function proportional to the RFDSCA quality factor and uses the epsiv-concept and maximin sorting scheme to achieve a set of solutions well distributed along a non-dominated front. To confirm the results of the algorithm, three RFDSCAs were simulated in SpectreRF and one of them was implemented and tested. The design used a 0.25 mum BiCMOS process. All the results (synthesized, simulated and measured) are very close, which indicate that the genetic synthesis method is a very useful tool to design optimum performance RFDSCAs.

Urban land use change analysis and modelling: a case study of Setubal-Sesimbra, Portugal

Dissertation submitted in partial fulfilment of the requirements for the Degree of Master of Science in Geospatial Technologies

Production, purification and characterisation of polysaccharides from pleurotus ostreatus with antitumor activity

Background: Mushroom polysaccharides play an important role in functional foods because they exhibit biological modulator properties such as antitumour, antiviral and antibacterial activities. The present study involved the production, purification and characterisation of intracellular and extracellular free and protein-bound polysaccharides from Pleurotus ostreatus and the investigation of their growth-inhibitory effect on human carcinoma cell lines. Results: Several fermentation parameters were obtained: batch polysaccharide productivities of 0.013 +/- 8.12 x 10-5 and 0.037 +/- 0.0005 g L-1 day-1 for intracellular and extracellular polysaccharides respectively, a maximum biomass concentration of 9.35 +/- 0.18 g L-1, Pmax = 0.935 +/- 0.018 g L-1 day-1, µmax = 0.218 +/- 0.02 day-1, YEP/X = 0.040 +/- 0.0015 g g-1 and YIP/X = 0.014 +/- 0.0003 g g-1. Some polysaccharides exhibited superoxide dismutase (SOD)-like activity of 50-200 units. Fourier transform infrared analysis of the polysaccharides revealed absorption bands characteristic of such biological macromolecules. Cytotoxicity assays showed that both intracellular and extracellular polysaccharides exhibited antitumour activity towards several tested human carcinoma cell lines in a dose-dependent manner. Conclusion - The polysaccharides of P. ostreatus exhibited high SOD-like activity, which strongly supports their biological effect on tumour cell lines. The extracellular polysaccharides presented the highest antitumour activity towards the RL95 carcinoma cell line and should be further investigated as an antitumour agent.

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.