Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/8419
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFernando, TGI-
dc.contributor.authorKalganova, T-
dc.date.accessioned2014-05-13T10:40:04Z-
dc.date.available2014-05-13T10:40:04Z-
dc.date.issued2012-
dc.identifier.citationInternational Journal of Computer Applications, 59(2), 1 - 14, 2012en_US
dc.identifier.issn0975-8887-
dc.identifier.urihttp://www.ijcaonline.org/archives/volume59/number2/9517-3931en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/8419-
dc.descriptionThis article is available open access through the publisher’s website at the link below. Copyright @ 2012 International Journal of Computer Applications.en_US
dc.description.abstractAnt System (AS) is a general purpose heuristic algorithm inspired by the foraging behaviour of real ant colonies. AS and its improved versions have been successfully applied to difficult combinatorial optimization problems such as travelling salesman problem, quadratic assignment problem and job shop scheduling. In this paper, two versions of multi-colony ant systems that are extensions to the AS are proposed for the multi-hose routing. In both versions, each colony of ants searches for an optimum path between two end points (or commodities). While each colony searches for optimum paths, they try to maximum use of other colonies paths (sharing paths, or bundling) for easy handling of multiple paths. The first version uses a single pheromone matrix for all colonies and the second version uses different pheromone matrices for each colony and a modified random propositional rule to attract ants toward foreign pheromones. The tessellated format of the obstacles was used in the algorithm instead of the original shapes of the obstacles. As a result of using this format, the algorithm can handle freeform obstacles and speed up the algorithm when checking the collision detections. The experimental results show that there is no significant difference in the quality of the solutions produced by two versions and the first version takes less computation time. Further first version needs low computer memory and one parameter lesser than of the second version.en_US
dc.language.isoenen_US
dc.publisherFoundation of Computer Scienceen_US
dc.subjectMulti-colony ant systemen_US
dc.subjectHose routingen_US
dc.subjectShared pathsen_US
dc.subjectBundlingen_US
dc.subjectForeign pheromoneen_US
dc.subjectTessellated formaten_US
dc.subjectFreeform obstaclesen_US
dc.titleMulti-colony ant systems for multi-hose routingen_US
dc.typeArticleen_US
dc.identifier.doihttp://dx.doi.org/10.5120/9517-3931-
pubs.organisational-data/Brunel-
pubs.organisational-data/Brunel/Brunel Active Staff-
pubs.organisational-data/Brunel/Brunel Active Staff/School of Engineering & Design-
pubs.organisational-data/Brunel/Brunel Active Staff/School of Engineering & Design/Electronic and Computer Engineering-
pubs.organisational-data/Brunel/Group Publication Pages-
pubs.organisational-data/Brunel/University Research Centres and Groups-
pubs.organisational-data/Brunel/University Research Centres and Groups/School of Engineering and Design - URCs and Groups-
pubs.organisational-data/Brunel/University Research Centres and Groups/School of Engineering and Design - URCs and Groups/Centre for Electronics Systems Research-
Appears in Collections:Electronic and Computer Engineering
Publications
Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:
File Description SizeFormat 
Notice.pdf39.59 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.