An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem

dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Suganthan, P.N.
dc.contributor.author	Pan, Q.K.
dc.date.accessioned	2021-01-25T19:36:22Z
dc.date.available	2021-01-25T19:36:22Z
dc.date.issued	2010
dc.identifier	10.1016/j.amc.2009.10.027
dc.identifier.issn	0096-3003
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/8308
dc.description.abstract	In this paper, an ensemble of discrete differential evolution algorithms with parallel populations is presented. In a single populated discrete differential evolution (DDE) algorithm, the destruction and construction (DC) procedure is employed to generate
dc.description.sponsorship	A*Star (Agency for Science, Technology and Research)Agency for Science Technology & Research (ASTAR) [052 101 0020]; National Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [60874075, 70871065]; Open Research Foundation fro
dc.language.iso	English
dc.publisher	ELSEVIER SCIENCE INC
dc.title	An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
dc.type	Article
dc.relation.firstpage	3356
dc.relation.lastpage	3368
dc.relation.volume	215
dc.relation.issue	9
dc.description.woscategory	Mathematics, Applied
dc.description.wosresearcharea	Mathematics
dc.identifier.wosid	WOS:000273230700022

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.