Show simple item record

dc.contributor.convenorPaul Roe and Jim Hoganen_AU
dc.contributor.authorRandall, Marcusen_US
dc.contributor.authorLewis, Andrewen_US
dc.contributor.editorB. Werneren_US
dc.date.accessioned2017-04-24T09:53:02Z
dc.date.available2017-04-24T09:53:02Z
dc.date.issued2010en_US
dc.date.modified2011-03-16T07:58:27Z
dc.identifier.refurihttp://www.escience2010.org/en_AU
dc.identifier.doi10.1109/eScienceW.2010.27en_AU
dc.identifier.urihttp://hdl.handle.net/10072/37331
dc.description.abstractAnt colony optimisation has traditionally been used to solve problems that have few/light constraints or no constraints at all. Algorithms to maintain and restore feasibility have been successfully applied to such problems. Set partitioning is a very constrained combinatorial optimisation problem, for which even feasible solutions are difficult to construct. In this paper a binary ant colony optimisation framework is applied to this problem. To increase its effectiveness, feasibility restoration, solution improvement algorithms and candidate set strategies are added. These algorithms can be applied to complete solution vectors and as such can be used by any solver. Moreover, the principles of the support algorithms may be applied to other constrained problems. The overall results indicate that the ant colony optimisation algorithm can efficiently solve small to medium sized problems. It is envisaged that in future research parallel computation could be used to simultaneously reduce solver time while increasing solution quality.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.format.extent233331 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherIEEE Computer Societyen_US
dc.publisher.placeLos Alamitos, CA, USAen_US
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofconferencename2010 Sixth IEEE International Conference on e-Scienceen_US
dc.relation.ispartofconferencetitleProceedings 2010 Sixth IEEE International Conference on e-Science Workshopsen_US
dc.relation.ispartofdatefrom2010-12-07en_US
dc.relation.ispartofdateto2010-12-10en_US
dc.relation.ispartoflocationBrisbane, Australiaen_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchComputer Software not elsewhere classifieden_US
dc.subject.fieldofresearchOptimisationen_US
dc.subject.fieldofresearchcode080399en_US
dc.subject.fieldofresearchcode010303en_US
dc.titleModifications and Additions to Ant Colony Optimisation to Solve the Set Partitioning Problemen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
gro.rights.copyrightCopyright 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_AU
gro.date.issued2010
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record