DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/372

Full metadata record

DC FieldValueLanguage
contributor.authorNanda, P K-
contributor.authorKanungo, P-
contributor.authorMuni, D P-
date.accessioned2006-12-01T04:17:46Z-
date.available2006-12-01T04:17:46Z-
date.issued2003-
identifier.citationProceedings of the Sixth International Conference on Information Technology, 22-25 December 2003, Bhubaneswar, P 583-585en
identifier.urihttp://hdl.handle.net/2080/372-
descriptionCopyright for this article belongs to the proceedings publisheren
description.abstractIn 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
format.extent67313 bytes-
format.mimetypeapplication/pdf-
language.isoen-
subjectParallel Genetic Algorithmen
subjectCrowdingen
subjectClusteringen
titleParallel Genetic Algorithm Based Crowding Scheme Using Neighbouring Net Topologyen
typeArticleen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
Nandapk-CIT-2003.pdf65KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.

 

Powered by DSpace Feedback