Sebanyak 9 item atau buku ditemukan

Evolutionary Computation in Combinatorial Optimization

8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008, Proceedings

This book constitutes the refereed proceedings of the 8th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2008, held in Naples, Italy, in March 2008. The 24 revised full papers presented were carefully reviewed and selected from 69 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.

In our algorithm, those solutions generated by path relinking operations are
improved by a local search whose neighborhood consists of slight modifications
of the representative neighborhoods called 2-opt∗, cross exchange and Or-opt.

Evolutionary Computation in Combinatorial Optimization

6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings

Constructive greedy heuristics are algorithms that try to iteratively construct
feasible solutions for combinatorial optimization problems from the scratch. For
this they make use of a greedy scoring function, which evaluates the myopic
impact of ...

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

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

Evolutionary Computation in Combinatorial Optimization

10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010, Proceedings

Constitutes the refereed proceedings of the 10th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2010, held in Instanbul, Turkey, in April 2010. This book discusses developments and applications in metaheuristics.

An Evolutionary Algorithm Guided by Preferences Elicited According to the
ELECTRE TRI Method Principles Eunice Oliveira1 and Carlos Henggeler
Antunes2 1 School of Technology and Management, Polytechnic Institute of
Leiria, Morro do ...