Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

GECCO
2003
Springer

favoriteEmaildiscussreport

116views Optimization» more GECCO 2003»

A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem

13 years 9 months ago

A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem

Download www.cs.york.ac.uk

Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment and the reproducibility of building blocks. For decades, various chromosomal structures and crossover operators were proposed for the purpose. In this paper, we use Voronoi quantized crossover that adopts complete graph representation. It showed remarkable improvement in comparison with state-of-the-art genetic algorithms.

Dong-il Seo, Byung Ro Moon

Real-time Traffic

GECCO 2003 | Genetic Algorithms | Hybrid Genetic Algorithm | Voronoi Quantized Crossover |

claim paper

Related Content

» Comparison of genetic representation schemes for scheduling soft realtime parallel applica...

» Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm

» A Comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem

» Phase Coupled Code Generation for DSPs Using a Genetic Algorithm

» Switch Detection in Genetic Regulatory Networks

» Graphbased evolutionary design of arithmetic circuits

» Bayesian Inference for Layer Representation with Mixed Markov Random Field

» Graphbased Analysis of Textured Images for Hierarchical Segmentation

» Distributed Graphplan

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	GECCO
Authors	Dong-il Seo, Byung Ro Moon

Comments (0)