Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/68822
Title: A generalized version of graph-based ant system and its applicability and convergence
Authors: Dinh, H.T.
Mamun, A.A. 
Huynh, H.T.
Issue Date: 2005
Source: Dinh, 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.
Abstract: A 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.
Source Title: Advances in Soft Computing
URI: http://scholarbank.nus.edu.sg/handle/10635/68822
ISBN: 3540250557
ISSN: 16153871
Appears in Collections:Staff Publications

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

Page view(s)

34
checked on Dec 9, 2017

Google ScholarTM

Check


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