Titlebook: Evolutionary Computation in Combinatorial Optimization; 5th European Confere Günther R. Raidl,Jens Gottlieb Conference proceedings 2005 Spr

Fracture

ORBIT

逃避責(zé)任

Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem,mental results have shown that SSPF performance is significantly better than classical DTSP approaches, where new solutions of derived problems are obtained without taking advantage of previous solutions corresponding to similar problems. Our proposal reduces execution time appreciably without affecting the quality of the estimated solution.

圍巾

小官

A Novel Application of Evolutionary Computing in Process Systems Engineering, Analysis (OA), this study being a crucial stage in the design and revamp of process-plant instrumentation. The MOGAI is a binary-coded genetic algorithm with a three-objective fitness function based on cost, reliability and observability metrics. MOGAI’s special features are: dynamic adaptive bit-f

功多汁水

Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework,s. The sequence of low level heuristics, applied in an order which is intelligently determined by the hyperheuristic, form a solution method for the problem. In this paper, we consider a hyperheuristic-based methodology where a large set of low level heuristics is constructed by combining simple sel

chalice

周興旺

漸強(qiáng)

On the Application of Evolutionary Algorithms to the Consensus Tree Problem,roblem, featuring characteristics of genetic programming (GP), evolution strategies (ES) and evolutionary programming (EP) respectively. These algorithms are evaluated on a benchmark composed of phylogenetic trees computed from genomic data. The GP-like algorithm is shown to provide better results t

關(guān)節(jié)炎