Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/372
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Nanda, P K | - |
dc.contributor.author | Kanungo, P | - |
dc.contributor.author | Muni, D P | - |
dc.date.accessioned | 2006-12-01T04:17:46Z | - |
dc.date.available | 2006-12-01T04:17:46Z | - |
dc.date.issued | 2003 | - |
dc.identifier.citation | Proceedings of the Sixth International Conference on Information Technology, 22-25 December 2003, Bhubaneswar, P 583-585 | en |
dc.identifier.uri | http://hdl.handle.net/2080/372 | - |
dc.description | Copyright for this article belongs to the proceedings publisher | en |
dc.description.abstract | In this article, the notion of crowding is employed to maintain stable subpopulations at niches of a multi modal nonlinear function. In this work, we have attempted to parallelize the crowding scheme and hence, propose new concepts of net topology while devising the parallel scheme based on coarse grained parallelization. Besides, we have also proposed a new interconnection model which takes care of the intra deme migration. The use of Generalized Crossover (GC) operator is found to be superior to that of the scheme using two point crossover operators. The effect of different net topology, based on the neighbourhood structure, upon the solution is investigated. It was found that the net topology with second order neighbourhood structure is good enough to yield satisfactory results. | en |
dc.format.extent | 67313 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.subject | Parallel Genetic Algorithm | en |
dc.subject | Crowding | en |
dc.subject | Clustering | en |
dc.title | Parallel Genetic Algorithm Based Crowding Scheme Using Neighbouring Net Topology | en |
dc.type | Article | en |
Appears in Collections: | Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Nandapk-CIT-2003.pdf | 65.74 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.