Sciweavers

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

6

IPPS
2007
IEEE

favoriteEmaildiscussreport

124views Distributed And Parallel Com...» more IPPS 2007»

Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem

13 years 10 months ago

Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem

Download www.cecs.uci.edu

— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings by minimising their width and height. Importantly it takes into account the contribution of dummy vertices to the width of the resulting layering.

Radoslav Andreev, Patrick Healy, Nikola S. Nikolov

Real-time Traffic

DAG Layering Problem | Distributed And Parallel Computing | Dummy Vertices | IPPS 2007 | Optimization Based Algorithm |

claim paper

Related Content

» Constrained Ant Colony Optimization for Data Clustering

» Mesh Partitioning A Multilevel AntColonyOptimization Algorithm

» Variable Neighborhood Search and Ant Colony Optimization for the Rooted DelayConstrained M...

» Ant colony optimization techniques for the vehicle routing problem

» Consultantguided search algorithms for the quadratic assignment problem

» Ant colony optimization with partial order reduction for discovering safety property viola...

» Ant colony optimization for power plant maintenance scheduling optimization

» DEACO Hybrid Ant Colony Optimization with Differential Evolution

» Using taxonomies for contentbased routing with ants

Post Info
More Details (n/a)

Added	03 Jun 2010
Updated	03 Jun 2010
Type	Conference
Year	2007
Where	IPPS
Authors	Radoslav Andreev, Patrick Healy, Nikola S. Nikolov

Comments (0)