Applying Ant Colony optimization metaheuristic to the DAG Layering problem

Radoslav Andreev, Patrick Healy, Nikola S. Nikolov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM
DOIs
Publication statusPublished - 2007
Event21st International Parallel and Distributed Processing Symposium, IPDPS 2007 - Long Beach, CA, United States
Duration: 26 Mar 200730 Mar 2007

Publication series

NameProceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Conference

Conference21st International Parallel and Distributed Processing Symposium, IPDPS 2007
Country/TerritoryUnited States
CityLong Beach, CA
Period26/03/0730/03/07

Fingerprint

Dive into the research topics of 'Applying Ant Colony optimization metaheuristic to the DAG Layering problem'. Together they form a unique fingerprint.

Cite this