Titlebook: Evolutionary Computation in Combinatorial Optimization; 10th European Confer Peter Cowling,Peter Merz Conference proceedings 2010 Springer-

范圍廣

Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures,a simple neighborhood but is initialized by a greedy procedure which uses a measure of similarity between the vertices of the two graphs. The algorithm is tested on a large collection of graphs of various sizes (from 300 vertices and up to 3000 vertices) and densities. Computing times range from les

sparse

吃掉

ADORE

A Study of Memetic Search with Multi-parent Combination for UBQP,rating tabu search into the framework of genetic algorithm. In this paper, we propose a new multi-parent combination operator for generating offspring solutions. A pool updating strategy based on a quality-and-distance criterion is used to manage the population. Experimental comparisons with leading

有斑點

我們的面粉

Cholesterol

Projection

Guided Ejection Search for the Pickup and Delivery Problem with Time Windows,earch (GES). GES is a recently proposed metaheuristc framework and was first applied to the vehicle routing problem with time windows. The existence of the pickup and delivery constraint makes the feasible solution space tightly constrained and then makes the design of effective metaheuristics more

armistice

An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Princie of the Pareto-optimal front, but also a decision support process to aid the Decision Maker (DM) to progress in the learning of the trade-offs at stake in different regions of the search space. This is accomplished by integrating in the search process the DM’s preferences to guide the search and li

保存