1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/68822
DC FieldValue
dc.titleA generalized version of graph-based ant system and its applicability and convergence
dc.contributor.authorDinh, H.T.
dc.contributor.authorMamun, A.A.
dc.contributor.authorHuynh, H.T.
dc.date.accessioned2014-06-19T02:53:37Z
dc.date.available2014-06-19T02:53:37Z
dc.date.issued2005
dc.identifier.citationDinh, H.T.,Mamun, A.A.,Huynh, H.T. (2005). A generalized version of graph-based ant system and its applicability and convergence. Advances in Soft Computing (AISC) : 949-958. ScholarBank@NUS Repository.
dc.identifier.isbn3540250557
dc.identifier.issn16153871
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/68822
dc.description.abstractA generalized version of Gutjahr's Graph-based Ant System (GBAS) framework for solving static combinatorial optimization problems is examined in the present paper. A new transition rule which in-tends to balance between the exploration and the exploitation in the search progress of Ant-based algorithms, is added into Gutjahr's GBAS model. As shown in this paper, our generalized model still holds all convergent properties of the GBAS model and may show a promising improvement in solution quality to Ant-based algorithms in literature.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitleAdvances in Soft Computing
dc.description.issueAISC
dc.description.page949-958
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


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