An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
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
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-71649084635&doi=10.1016%2fj.amc.2009.10.027&partnerID=40&md5=fed64b8079c80a0eb548d7e9854388f8https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10696
Collections

DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..