Sebanyak 4 item atau buku ditemukan

Recent Advances in Evolutionary Computation for Combinatorial Optimization

This cutting-edge volume presents recent advances in the area of metaheuristic combinatorial optimisation, with a special focus on evolutionary computation methods. Moreover, it addresses local search methods and hybrid approaches.

9 An Iterative Heuristic Algorithm for Tree Decomposition Nysret Musliu Institute
for Information Systems, Vienna University ... Finding the optimal tree
decompositions is an NP-hard problem and different algorithms have been
proposed in the ...

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

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

Applications of Evolutionary Computation

EvoApplications 2011: EvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC, Torino, Italy, April 27-29, 2011, Proceedings

Constitutes the refereed proceedings of the International Conference on the Applications of Evolutionary Computation, EvoApplications 2011, that was held in Torino, Italy, colocated with the Evo 2011 events.

Constitutes the refereed proceedings of the International Conference on the Applications of Evolutionary Computation, EvoApplications 2011, that was held in Torino, Italy, colocated with the Evo 2011 events.