On the Virtues of Parameterized Uniform Crossover,

Spears, William M.; Jong, Kenneth De

doi:10.21236/ada293985

Cited by 223 publications

(169 citation statements)

References 2 publications

Supporting

Mentioning

144

Contrasting

Unclassified

Order By: Relevance

“…Solutions in RKGA implementations are represented as vectors of real numbers that are randomly generated between 0 and 1. Each vector corresponds to a feasible solution and mating is performed using the so-called parameterized uniform crossover (Spears & DeJong, 1991), which is designed to always produce a feasible offspring. The associated decoder is a deterministic algorithm that takes a random-key vector as input and returns a feasible solution of the optimization problem along with the objective function value.…”

Section: Figure 1 Schematic Representation Of the Black-box Optimizamentioning

confidence: 99%

A black-box scatter search for optimization problems with integer variables

et al. 2013

View full text Add to dashboard Cite

The goal of this work is the development of a black-box solver based on the scatter search methodology. In particular, we seek a solver capable of obtaining high quality outcomes to optimization problems for which solutions are represented as a vector of integer values. We refer to these problems as integer optimization problems. We assume that the decision variables are bounded and that there may be constraints that require that the black-box evaluator is called in order to know whether they are satisfied. Problems of this type are common in operational research areas of applications such as telecommunications, project management, engineering design and the like. Our experimental testing includes 171 instances within four classes of problems taken from the literature. The experiments compare the performance of the proposed method with both the best context-specific procedures designed for each class of problem as well as context-independent commercial software. The experiments show that the proposed solution method competes well against commercial software and that can be competitive with specialized procedures in some problem classes.

show abstract

Section: Figure 1 Schematic Representation Of the Black-box Optimizamentioning

confidence: 99%

A black-box scatter search for optimization problems with integer variables

et al. 2013

View full text Add to dashboard Cite

show abstract

“…Parameterized uniform crossovers (Spears and DeJong (1991)) are employed in place of the traditional one-point or two-point crossover. After two parents are chosen randomly from the full, old population (including chromosomes copied to the next generation in the elitist pass), at each gene we toss a biased coin to select which parent will contribute the allele.…”

Section: Evolutionary Strategymentioning

confidence: 99%

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

Gonçalves

Mendes²,

Resende

2008

European Journal of Operational Research

263

126

View full text Add to dashboard Cite

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 a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm.

show abstract

“…The uniform crossover is based on Syswerda (1989) and Spears and De Jong (1991), where, at instant k, two vectors with dimension m, x? I and x@ I , exchange genes i with each other; that is, x?…”

Section: The Genetic Algorithmmentioning

confidence: 99%

Global optimization of energy and production in process industries: a genetic algorithm application

Santos

Dourado

1999

Control Engineering Practice

View full text Add to dashboard Cite

The process industries exhibit an increasing need for efficient management of all the factors that can reduce their operating costs, leading to the necessity for a global multi-objective optimization methodology that will enable the generation of optimum strategies, fulfilling the required restrictions. In this paper, a genetic algorithm is developed and applied for the optimal assignment of all the production sections in a particular mill in the kraft pulp and paper industry, in order to optimize energy the costs and production rate changes. This system is intended to implement all programmed or forced maintenance shutdowns, as well as all the reductions imposed in production rates.1999 Elsevier Science¸td. All rights reserved.

show abstract

On the Virtues of Parameterized Uniform Crossover,

Cited by 223 publications

References 2 publications

A black-box scatter search for optimization problems with integer variables

A black-box scatter search for optimization problems with integer variables

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

Global optimization of energy and production in process industries: a genetic algorithm application

Contact Info

Product

Resources

About