2007_Andreev (2).pdf (274.17 kB)
Applying ant colony optimization metaheuristic to the DAG layering problem
report
posted on 2012-07-16, 11:26 authored by Radoslav Andreev, Patrick HealyPatrick Healy, Nikola S. NikolovThis paper 1 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.
Funding
PLANT PARASITISM BY NEMATODES AND ITS MANAGEMENT
National Institute of Food and Agriculture
Find out more...History
Publication
Proceedings of the 10th International Workshop On Nature Inspired Distributed Computing; MayPublisher
IEEE Computer SocietyNote
peer-reviewedOther Funding information
SFIRights
© 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Language
EnglishExternal identifier
Usage metrics
Categories
No categories selectedLicence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC