A Biased Random-Key Genetic Algorithm with Forward-Backward Improvement for the Resource Constrained Project Scheduling Problem

This paper presents a biased random-keys 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 … Read more

A multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem

This paper addresses a constrained two-dimensional (2D), non-guillotine restricted, packing problem, where a fixed set of small rectangles has to be packed into a larger stock rectangle so as to maximize the value of the rectangles packed. The algorithm we propose hybridizes a novel placement procedure with a genetic algorithm based on random keys. We … Read more

Project Scheduling

Nowadays, construction projects grow in complexity and size. So, finding feasible schedules which efficiently use scarce resources is a challenging task within project management. Project scheduling consists of determining the starting and finishing times of the activities in a project. These activities are linked by precedence relations and their processing requires one or more resources. … Read more

A genetic algorithm for a global optimization problem arising in the detection of gravitational waves

The detection of gravitational waves is a long-awaited event in modern physics and, to achieve this challenging goal, detectors with high sensitivity are being used or are under development. In order to extract gravitational signals, emitted by coalescing binary systems of compact objects (neutron stars and/or black holes), from noisy data obtained by interferometric detectors, … Read more

A genetic algorithm with random keys for routing and wavelength assignment

The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength to each of them, such that lightpaths whose routes share a common fiber are assigned different wavelengths. This problem was shown to be NP-hard when the objective is to … Read more

Optimization of forming load and variables in deep drawing process for automotive cup using Genetic Algorithm

Sheet metal forming is a significant manufacturing process for producing a large variety of automotive parts and aerospace parts as well as consumer products. Deep drawing is a compression-tension forming process involving wide spectrum of operations and flow conditions. The result of the process depends on the large number of parameters and their interdependence. With … Read more

A hybrid heuristic for the constrained two-dimensional non-guillotine orthogonal cutting problem

This paper addresses a constrained two-dimensional (2D) non-guillotine cutting problem, where a fixed set of small rectangles has to be cut from a larger stock rectangle so as to maximize the value of the rectangles cut. The algorithm we propose hybridizes a novel placement procedure with a genetic algorithm based on random keys. We propose … Read more

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 … Read more

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 (RCMPSP). 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 … Read more

A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking

A phylogenetic tree relates taxonomic units, based on their similarity over a set of characters. We propose a new genetic algorithm for the problem of building a phylogenetic tree under the parsimony criterion. This genetic algorithm makes use of an innovative optimized crossover strategy which is an extension of the path-relinking intensification technique originaly proposed … Read more