A hybrid genetic algorithm for the multi-mode resource-constrained project scheduling

A construction project is a group of discernible tasks or activities that are conduct-ed in a coordinated effort to accomplish one or more objectives. Construction projects re-quire varying levels of cost, time and other resources. To plan and schedule a construction project, activities must be defined sufficiently. The level of detail determines the number of activities contained within the project plan and schedule. So, finding feasible schedules which efficiently use scarce resources is a challenging task within project management. In this context, the well-known Resource Constrained Project Scheduling Problem (RCPSP) has been studied during the last decades. In the RCPSP the activities of a project have to be scheduled such that the makespan of the project is minimized. So, the technological precedence constraints have to be observed as well as limitations of the renewable resources required to accomplish the activities. Once started, an activity may not be interrupted. This problem has been extended to a more realistic model, the multi-mode resource con-strained project scheduling problem (MRCPSP), where each activity can be performed in one out of several modes. Each mode of an activity represents an alternative way of combining different levels of resource requirements with a related duration. Each renewable resource has a limited availability for the entire project such as manpower and machines. This paper presents a hybrid genetic algorithm for the multi-mode resource-constrained pro-ject scheduling problem, in which multiple execution modes are available for each of the ac-tivities 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. It is evaluated the quality of the schedules and presents detailed comparative computational re-sults for the MRCPSP, which reveal that this approach is a competitive algorithm.

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.

Single-objective spreading algorithm

This paper addresses the problem of finding several different solutions with the same optimum performance in single objective real-world engineering problems. In this paper a parallel robot design is proposed. Thereby, this paper presents a genetic algorithm to optimize uni-objective problems with an infinite number of optimal solutions. The algorithm uses the maximin concept and ε-dominance to promote diversity over the admissible space. The performance of the proposed algorithm is analyzed with three well-known test functions and a function obtained from practical real-world engineering optimization problems. A spreading analysis is performed showing that the solutions drawn by the algorithm are well dispersed.

Cervical cancer screening coverage in a high-incidence region

OBJECTIVE To analyze the coverage of a cervical cancer screening program in a city with a high incidence of the disease in addition to the factors associated with non-adherence to the current preventive program.METHODS A cross-sectional study based on household surveys was conducted. The sample was composed of women between 25 and 59 years of age of the city of Boa Vista, RR, Northern Brazil who were covered by the cervical cancer screening program. The cluster sampling method was used. The dependent variable was participation in a women’s health program, defined as undergoing at least one Pap smear in the 36 months prior to the interview; the explanatory variables were extracted from individual data. A generalized linear model was used.RESULTS 603 women were analyzed, with an mean age of 38.2 years (SD = 10.2). Five hundred and seventeen women underwent the screening test, and the prevalence of adherence in the last three years was up to 85.7% (95%CI 82.5;88.5). A high per capita household income and recent medical consultation were associated with the lower rate of not being tested in multivariate analysis. Disease ignorance, causes, and prevention methods were correlated with chances of non-adherence to the screening system; 20.0% of the women were reported to have undergone opportunistic and non-routine screening.CONCLUSIONS The informed level of coverage is high, exceeding the level recommended for the control of cervical cancer. The preventive program appears to be opportunistic in nature, particularly for the most vulnerable women (with low income and little information on the disease). Studies on the diagnostic quality of cervicovaginal cytology and therapeutic schedules for positive cases are necessary for understanding the barriers to the control of cervical cancer.

A genetic algorithm for project scheduling with multi-modes and renewable resources

This paper presents a genetic algorithm-based approach for project scheduling with multi-modes and renewable resources. In this problem activities of the project may be executed in more than one operating mode and renewable resource constraints are imposed. The objective function is the minimization of the project completion time. The idea of this approach is integrating a genetic algorithm with a schedule generation scheme. This study also proposes applying a local search procedure trying to yield a better solution when the genetic algorithm and the schedule generation scheme obtain a solution. The experimental results show that this algorithm is an effective method for solving this problem.

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

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.

Determinants of the use of health care services: multilevel analysis in the Metropolitan Region of Sao Paulo

OBJECTIVE To evaluate the individual and contextual determinants of the use of health care services in the metropolitan region of Sao Paulo.METHODS Data from the Sao Paulo Megacity study – the Brazilian version of the World Mental Health Survey multicenter study – were used. A total of 3,588 adults living in 69 neighborhoods in the metropolitan region of Sao Paulo, SP, Southeastern Brazil, including 38 municipalities and 31 neighboring districts, were selected using multistratified sampling of the non-institutionalized population. Multilevel Bayesian logistic models were adjusted to identify the individual and contextual determinants of the use of health care services in the past 12 months and presence of a regular physician for routine care.RESULTS The contextual characteristics of the place of residence (income inequality, violence, and median income) showed no significant correlation (p > 0.05) with the use of health care services or with the presence of a regular physician for routine care. The only exception was the negative correlation between living in areas with high income inequality and presence of a regular physician (OR: 0.77; 95%CI 0.60;0.99) after controlling for individual characteristics. The study revealed a strong and consistent correlation between individual characteristics (mainly education and possession of health insurance), use of health care services, and presence of a regular physician. Presence of chronic and mental illnesses was strongly correlated with the use of health care services in the past year (regardless of the individual characteristics) but not with the presence of a regular physician.CONCLUSIONS Individual characteristics including higher education and possession of health insurance were important determinants of the use of health care services in the metropolitan area of Sao Paulo. A better understanding of these determinants is essential for the development of public policies that promote equitable use of health care services.

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

Access to childbirth care by adolescents and young people in the Northeastern region of Brazil

ABSTRACT OBJECTIVE To identify the factors that interfere with the access of adolescents and young people to childbirth care for in the Northeast region of Brazil. METHODS Cross-sectional study with 3,014 adolescents and young people admitted to the selected maternity wards to give birth in the Northeast region of Brazil. The sample design was probabilistic, in two stages: the first corresponded to the health establishments and the second to women who had recently given birth and their babies. The data was collected by means of interviews and consulting the hospital records, from pre-tested electronic form. Descriptive statistics were used for the univariate analysis, Pearson’s Chi-square test for the bivariate analysis and multiple logistic regressions for the multivariate analysis. Sociodemographic variables, obstetrical history, and birth care were analyzed. RESULTS Half of the adolescents and young people interviewed had not been given guidance on the location that they should go to when in labor, and among those who had, 23.5% did not give birth in the indicated health service. Furthermore, one third (33.3%) had to travel in search of assisted birth, and the majority (66.7%) of the postpartum women came to maternity by their own means. In the bivariate analysis, the variables marital status, paid work, health insurance, number of previous pregnancies, parity, city location, and type of health establishment showed a significant association (p < 0.20) with inadequate access to childbirth care. The multivariate analysis showed that married adolescents and young people (p < 0.015), with no health insurance (p < 0.002) and from the countryside (p < 0.001) were more likely to have inadequate access to childbirth care. CONCLUSIONS Adolescents and young women, married, without health insurance, and from the countryside are more likely to have inadequate access to birth care. The articulation between outpatient care and birth care can improve this access and, consequently, minimize the maternal and fetal risks that arise from a lack of systematic hospitalization planning.

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.