Sebanyak 2866 item atau buku ditemukan

Towards a New Evolutionary Computation

Advances on Estimation of Distribution Algorithms

Estimation of Distribution Algorithms (EDAs) are a set of algorithms in the Evolutionary Computation (EC) field characterized by the use of explicit probability distributions in optimization. Contrarily to other EC techniques such as the broadly known Genetic Algorithms (GAs) in EDAs, the crossover and mutation operators are substituted by the sampling of a distribution previously learnt from the selected individuals. EDAs have experienced a high development that has transformed them into an established discipline within the EC field. This book attracts the interest of new researchers in the EC field as well as in other optimization disciplines, and that it becomes a reference for all of us working on this topic. The twelve chapters of this book can be divided into those that endeavor to set a sound theoretical basis for EDAs, those that broaden the methodology of EDAs and finally those that have an applied objective.

Advances on Estimation of Distribution Algorithms Jose A. Lozano. 1 Department
of Information and Communications Gwangju Institute of Science and
Technology (GIST) Oryong-dong, Buk-gu, Gwangju 500-712, Korea ...

Evolutionary Computation 2

Advanced Algorithms and Operators

Evolutionary Computation 2: Advanced Algorithms and Operators expands upon the basic ideas underlying evolutionary algorithms. The focus is on fitness evaluation, constraint-handling techniques, population structures, advanced techniques in evolutionary computation, and the implementation of evolutionary algorithms. It is intended to be used by individual researchers and students in the expanding field of evolutionary computation.

Evolutionary Computation 2: Advanced Algorithms and Operators expands upon the basic ideas underlying evolutionary algorithms.

Evolutionary Computation in Combinatorial Optimization

15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings

This book constitutes the refereed proceedings of the 15th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2015, held in Copenhagen, Denmark, in April 2015, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications. The 19 revised full papers presented were carefully reviewed and selected from 46 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic (hybrid) algorithms, iterated local search, variable neighbourhood search, ant colony optimization, artificial immune systems, hyper-heuristics and other adaptive approaches. The applications include both traditional domains, such as graph coloring, knapsack, vehicle routing, job-shop scheduling, the p-median and the orienteering problems; and new(er) domains such as designing deep recurrent neural networks, detecting network community structure, lock scheduling of ships, cloud resource management, the fire-fighter problem and AI planning. The theoretical studies involved approximation ratio, runtime and black-box complexity analyses.

A Biased Random-Key Genetic Algorithm for the Cloud Resource Management
Problem Leonard Heilig1(B), Eduardo ... Flexible use options and associated
cost savings of cloud computing are increasingly attracting the interest from both
 ...

Evolutionary Computation in Combinatorial Optimization

14th European Conference, EvoCOP 2014, Granada, Spain, April 23-25, 2014, Revised Selected Papers

This book constitutes the refereed proceedings of the 14th European Conference on Evolutionary Computation in Combinatorial Optimization, Evo COP 2014, held in Granada, Spain, in April 2014, co-located with the Evo*2014 events Euro GP, Evo BIO, Evo MUSART and Evo Applications. The 20 revised full papers presented were carefully reviewed and selected from 42 submissions. The papers cover the following topics: swarm intelligence algorithms, fitness landscapes and adaptive algorithms, real world and routing problems and cooperative and metaheuristic search.

During past decades, metaheuristic algorithms have been shown to be provenly
effective for a wide range of hard combinatorial optimization problems arising in a
variety of industrial, economic, and scientific settings. Well-known exam- ples of ...

Applications of Evolutionary Computation

18th European Conference, EvoApplications 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings

This book constitutes the refereed conference proceedings of the 18th International Conference on the Applications of Evolutionary Computation, EvoApplications 2015, held in Copenhagen, Spain, in April 2015, colocated with the Evo 2015 events EuroGP, EvoCOP, and EvoMUSART. The 72 revised full papers presented were carefully reviewed and selected from 125 submissions. EvoApplications 2015 consisted of the following 13 tracks: EvoBIO (evolutionary computation, machine learning and data mining in computational biology), EvoCOMNET (nature-inspired techniques for telecommunication networks and other parallel and distributed systems), EvoCOMPLEX (evolutionary algorithms and complex systems), EvoENERGY (evolutionary computation in energy applications), EvoFIN (evolutionary and natural computation in finance and economics), EvoGAMES (bio-inspired algorithms in games), EvoIASP (evolutionary computation in image analysis, signal processing, and pattern recognition), EvoINDUSTRY (nature-inspired techniques in industrial settings), EvoNUM (bio-inspired algorithms for continuous parameter optimization), EvoPAR (parallel implementation of evolutionary algorithms), EvoRISK (computational intelligence for risk management, security and defence applications), EvoROBOT (evolutionary computation in robotics), and EvoSTOC (evolutionary algorithms in stochastic and dynamic environments).

Training Financial Decision Support Systems with Thousands of Decision Rules
Using Differential Evolution with Embedded Dimensionality Reduction Piotr
Lipinski(B) Institute of Computer Science, Computational Intelligence Research ...

Evolutionary Computation in Combinatorial Optimization

13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013, Proceedings

This book constitutes the refereed proceedings of the 13th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2013, held in Vienna, Austria, in April 2013, colocated with the Evo* 2013 events EuroGP, EvoBIO, EvoMUSART, and EvoApplications. The 23 revised full papers presented were carefully reviewed and selected from 50 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economic, and scientific domains. Prominent examples of metaheuristics are ant colony optimization, evolutionary algorithms, greedy randomized adaptive search procedures, iterated local search, simulated annealing, tabu search, and variable neighborhood search. Applications include scheduling, timetabling, network design, transportation and distribution, vehicle routing, the travelling salesman problem, packing and cutting, satisfiability, and general mixed integer programming.

Dynamic Evolutionary Membrane Algorithm in Dynamic Environments Chuang
Liu and Min Han⋆ Faculty of Electronic ... For solving these problems, a novel
dynamic evolutionary algorithm based on membrane computing is proposed.

Evolutionary Computation in Combinatorial Optimization

11th European Conference, EvoCOP 2011, Torino, Italy, April 27-29, 2011, Proceedings

This book constitutes the refereed proceedings of the 11th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2011, held in Torino, Italy, in April 2011. The 22 revised full papers presented were carefully reviewed and selected from 42 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economical, and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, and ant colony optimization.

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, ...

Evolutionary Computation in Combinatorial Optimization

12th European Conference, EvoCOP 2012, Málaga, Spain, April 11-13, 2012, Proceedings

This book constitutes the refereed proceedings of the 12th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2012, held in Málaga, Spain, in April 2012, colocated with the Evo* 2012 events EuroGP, EvoBIO, EvoMUSART, and EvoApplications. . The 22 revised full papers presented were carefully reviewed and selected from 48 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economic, and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, and ant colony optimization.

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, ...

Evolutionary Computation in Combinatorial Optimization

7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings

This book constitutes the refereed proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2007, held in Valencia, Spain in April 2007. The 21 revised full papers presented were carefully reviewed and selected from 81 submissions. The papers 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 dedicated to the application of evolutionary computation and related methods to combinatorial optimization problems and cover any issue of metaheuristic for combinatorial optimization. The papers deal with representations, heuristics, analysis of problem structures, and comparisons of algorithms. The list of studied combinatorial optimization problems includes prominent examples like graph coloring, knapsack problems, the traveling salesperson problem, scheduling, graph matching, as well as specific real-world problems.

Prominent examples of metaheuristics are evolutionary algorithms, simulated
annealing, tabu search, scatter search, memetic algorithms, variable
neighborhood search, iterated local search, greedy randomized adaptive search
procedures, ...

Genetic and Evolutionary Computation--GECCO 2003

Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003 : Proceedings

The set LNCS 2723 and LNCS 2724 constitutes the refereed proceedings of the Genetic and Evolutionaty Computation Conference, GECCO 2003, held in Chicago, IL, USA in July 2003. The 193 revised full papers and 93 poster papers presented were carefully reviewed and selected from a total of 417 submissions. The papers are organized in topical sections on a-life adaptive behavior, agents, and ant colony optimization; artificial immune systems; coevolution; DNA, molecular, and quantum computing; evolvable hardware; evolutionary robotics; evolution strategies and evolutionary programming; evolutionary sheduling routing; genetic algorithms; genetic programming; learning classifier systems; real-world applications; and search based softare engineering.

Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16
, 2003 : Proceedings Erick Cantú-Paz ... We explore the advantages of DNA-like
genomes for evolutionary computation in silico. Coupled with simulations of ...