الصفحة 1
الصفحة 1
Evolutionary Scheduling
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.
Evolutionary computation in combinatorial optimization ; Vol. 3448 ; 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings
This volume contains the proceedings of EvoCOP 2005, the 5th European Conference on Evolutionary Computation in Combinatorial Optimization. It was held in Lausanne, Switzerland, on 30 March-1 April 2005
Evolutionary computation in combinatorial optimization ; 8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008. Proceedings
Metaheuristics have been shown to be e?ective for di?cult combinatorial - timization problems appearing in various industrial, economical, and scientifc domains. Prominent examples of metaheuristics are evolutionary algorithms, tabu search, simulated annealing, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, ant colony optimization and estimation of distribution algorithms. Problems solved successfully include scheduling, timetabling, network design, transportation and distribution, vehicle routing, the travelling salesman pr- lem, packing and cutting, satisfability and general mixed integer programming.
Evolutionary computation in combinatorial optimization ; 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings
This book cover evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, memetic algorithms, variable neighborhood search, greedy randomized adaptive search procedures, ant colony optimization, and particle swarm optimization algorithms. The papers are specifically dedicat.
