G. Jeyakumar
Amrita Vishwa Vidyapeetham
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by G. Jeyakumar.
nature and biologically inspired computing | 2009
G. Jeyakumar; C. Shunmuga Velayutham
In this paper we present an empirical, comparative performance, analysis of fourteen variants of Differential Evolution (DE) and Dynamic Differential Evolution (DDE) algorithms to solve unconstrained global optimization problems. The aim is to compare DDE, which employs a dynamic evolution mechanism, against DE and to identify the competitive variants which perform reasonably well on problems with different features. The fourteen variants of DE and DDE are benchmarked on 6 test functions grouped by features - unimodal separable, unimodal nonseparable, multimodal separable and multimodal non-separable. The analysis identifies the competitive variants and shows that DDE variants consistently outperform their classical counter parts.
swarm evolutionary and memetic computing | 2010
G. Jeyakumar; C. Shunmuga Velayutham
In this paper we present an empirical performance analysis of fourteen variants of Differential Evolution (DE) on a set of unconstrained global optimization problems. The island based distributed differential evolution counterparts of the above said 14 variants have been implemented with mesh and ring migration topologies and their superior performance over the serial implementation has been demonstrated. The competitive performance of ring topology based distributed differential evolution variants on the chosen problem has also been demonstrated. Six different migration policies are experimented for ring topology, and their performances are reported.
nature and biologically inspired computing | 2009
G. Jeyakumar; C. Shunmuga Velayutham
This paper presents an empirical analysis of the performance of Differential Evolution (DE) variants on different classes of unconstrained global optimization benchmark problems. This analysis has been undertaken to identify competitive DE variants which perform reasonably well on a range of problems with different features. Towards this, fourteen DE variants were implemented and tested on 14 high dimensional benchmark functions grouped by their modality and decomposability viz., unimodal separable, unimodal nonseparable, multimodal separable and multimodal nonseparable. This extensive performance analysis provides some insight about the competitiveness of DE variants in solving test problems with representative landscape features such as modality and decomposability.
Memetic Computing | 2013
G. Jeyakumar; C. Shunmuga Velayutham
This paper proposes a novel distributed differential evolution algorithm called Distributed Mixed Variant Differential Evolution (dmvDE). To alleviate the time consuming trial-and-error selection of appropriate Differential Evolution (DE) variant to solve a given optimization problem, dmvDE proposes to mix effective DE variants with diverse characteristics in a distributed framework. The novelty of dmvDEs lies in mixing different DE variants in an island based distributed framework. The 19 dmvDE algorithms, discussed in this paper, constitute various proportions and combinations of four DE variants (DE/rand/1/bin, DE/rand/2/bin, DE/best/2/bin and DE/rand-to-best/1/bin) as subpopulations with each variant evolving independently but also exchanging information amongst others to co-operatively enhance the efficacy of the distributed DE as a whole. The dmvDE algorithms have been run on a set of test problems and compared to the distributed versions of the constituent DE variants. Simulation results show that dmvDEs display a consistent overall improvement in performance than that of distributed DEs. The best of dmvDE algorithms has also been benchmarked against five distributed differential evolution algorithms. Simulation results reiterate the superior performance of the mixing of the DE variants in a distributed frame work. The best of dmvDE algorithms outperforms, on average, all five algorithms considered.
computational intelligence and data mining | 2015
Shanmuga Sundaram Thangavelu; G. Jeyakumar; Roshni M. Balakrishnan; C. Shunmuga Velayutham
In this paper we derive an analytical expression to describe the evolution of expected population variance for Differential Evolution (DE) variant—DE/current-to-best/1/bin (as a measure of its explorative power). The derived theoretical evolution of population variance has been validated by comparing it against the empirical evolution of population variance by DE/current-to-best/1/bin on four benchmark functions.
soft computing | 2014
G. Jeyakumar; C. Shunmuga Velayutham
This paper proposes a novel distributed differential evolution framework called distributed mixed variants (dynamic) differential evolution (
Studies in computational intelligence | 2016
G. Jeyakumar; C. Shunmuga Velayutham
international conference on computer science and information technology | 2011
G. Jeyakumar; C. Shanmugavelayutham
dmvD^{2}E)
swarm evolutionary and memetic computing | 2010
G. Jeyakumar; C. Shanmugavelayutham
simulated evolution and learning | 2010
G. Jeyakumar; C. Shunmuga Velayutham
dmvD2E). This novel framework is a heterogeneous mix of effective differential evolution (DE) and dynamic differential evolution (DDE) variants with diverse characteristics in a distributed framework to result in