Evolutionary Scheduling
PAYBACK Punkte
57 °P sammeln!
Evolutionary scheduling is a vital research domain at the interface of two important sciences - artificial intelligence and operational research. Scheduling problems are generally complex, large scale, constrained, and multi-objective in nature, and classical operational research techniques are often inadequate at solving them effectively. With the advent of computation intelligence, there is renewed interest in solving scheduling problems using evolutionary computational techniques. These techniques, which include genetic algorithms, genetic programming, evolutionary strategies, memetic algor...
Evolutionary scheduling is a vital research domain at the interface of two important sciences - artificial intelligence and operational research. Scheduling problems are generally complex, large scale, constrained, and multi-objective in nature, and classical operational research techniques are often inadequate at solving them effectively. With the advent of computation intelligence, there is renewed interest in solving scheduling problems using evolutionary computational techniques. These techniques, which include genetic algorithms, genetic programming, evolutionary strategies, memetic algorithms, particle swarm optimization, ant colony systems, etc, are derived from biologically inspired concepts and are well-suited to solve scheduling problems since they are highly scalable and flexible in terms of handling constraints and multiple objectives. This edited book gives an overview of many of the current developments in the large and growing field of evolutionary scheduling, and demonstrates the applicability of evolutionary computational techniques to solve scheduling problems, not only to small-scale test problems, but also fully-fledged real-world problems. The intended readers of this book are engineers, researchers, practitioners, senior undergraduates, and graduate students who are interested in the field of evolutionary scheduling.
Andere Kunden interessierten sich für
