Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art
CAC Coello - Computer methods in applied mechanics and …, 2002 - Elsevier
This paper provides a comprehensive survey of the most popular constraint-handling
techniques currently used with evolutionary algorithms. We review approaches that go from …
techniques currently used with evolutionary algorithms. We review approaches that go from …
Metaheuristics: A bibliography
Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …
the last two decades. They have had widespread successes in attacking a variety of difficult …
[PDF][PDF] A state-of-the-art review of job-shop scheduling techniques
AS Jain, S Meeran - Workin paper, Department of applied physics …, 1998 - neuro.bstu.by
ABSTRACT A great deal of research has been focused on solving the job-shop problem
(ΠJ), over the last forty years, resulting in a wide variety of approaches. Recently, much effort …
(ΠJ), over the last forty years, resulting in a wide variety of approaches. Recently, much effort …
[BOOK][B] Representations for genetic and evolutionary algorithms
F Rothlauf, F Rothlauf - 2006 - Springer
2 Representations for Genetic and Evolutionary Algorithms Page 1 2 Representations for Genetic
and Evolutionary Algorithms In this second chapter, we present an introduction into the field of …
and Evolutionary Algorithms In this second chapter, we present an introduction into the field of …
Genetic algorithms and traveling salesman problems
S Chatterjee, C Carrera, LA Lynch - European journal of operational …, 1996 - Elsevier
A genetic algorithm (GA) with an asexual reproduction plan through a generalized mutation
for an evolutionary operator is developed that can be directly applied to a permutation of n …
for an evolutionary operator is developed that can be directly applied to a permutation of n …
Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
Priority-dispatching rules have been studied for many decades, and they form the backbone
of much industrial scheduling practice. Develo** new dispatching rules for a given …
of much industrial scheduling practice. Develo** new dispatching rules for a given …
An efficient genetic algorithm for job shop scheduling with tardiness objectives
We consider job shop scheduling problems with release and due-dates, as well as various
tardiness objectives. To date, no efficient general-purpose heuristics have been developed …
tardiness objectives. To date, no efficient general-purpose heuristics have been developed …
[BOOK][B] Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions
R Sarker, M Mohammadian, X Yao, I Wegener - 2002 - Springer
Many experiments have shown that evolutionary algorithms are useful randomized search
heuristics for optimization problems. In order to learn more about the reasons for their …
heuristics for optimization problems. In order to learn more about the reasons for their …
Hybrid evolutionary optimisation with learning for production scheduling: state-of-the-art survey on algorithms and applications
Evolutionary Algorithms (EAs) has attracted significantly attention with respect to complexity
scheduling problems, which is referred to evolutionary scheduling. However, EAs differ in …
scheduling problems, which is referred to evolutionary scheduling. However, EAs differ in …
Evolutionary scheduling: A review
Early and seminal work which applied evolutionary computing methods to scheduling
problems from 1985 onwards laid a strong and exciting foundation for the work which has …
problems from 1985 onwards laid a strong and exciting foundation for the work which has …