MULTI-START JAYA ALGORITHM FOR SOFTWARE MODULE CLUSTERING PROBLEM
Journal Title: Azerbaijan Journal of High Performance Computing - Year 2018, Vol 1, Issue 1
Abstract
Jaya algorithm has gained considerable attention lately due to its simplicity and requiring no control parameters (i.e. parameter free). Despite its potential, Jaya algorithm is inherently designed for single objective problems. Additionally, Jaya is limited by the intense conflict between exploration (i.e. roams the random search space at the global scale) and exploitation (i.e. neighborhood search by exploiting the current good solution). Thus, Jaya requires better control for exploitation and exploration in order to prevent premature convergence and avoid being trapped in local optima. Addressing these issues, this paper proposes a new multi-objective Jaya variant with a multi-start adaptive capability and Cuckoo search like elitism scheme, called MS-Jaya, to enhance its exploitation and exploration allowing good convergence while permitting more diverse solutions. To assess its performances, we adopt MS-Jaya for the software module clustering problem. Experimental results reveal that MS-Jaya exhibits competitive performances against the original Jaya and state-of-the-art parameter free meta-heuristic counterparts consisting of Teaching Learning based Optimization (TLBO), Global Neighborhood Algorithm (GNA), Symbiotic Optimization Search (SOS), and Sine Cosine Algorithm (SCA).
Authors and Affiliations
Kamal Z. Zamli, Abdulrahman Alsewari, Bestoun S. Ahmed
Keywords
Related Articles
- EP ID EP525581
- DOI 10.32010/26166127.2018.1.1.87.112
- Views 60
- Downloads 0
CHALLENGES OF RESOURCE DISCOVERY TO SUPPORT DISTRIBUTED EXASCALE COMPUTING ENVIRONMENT
The resource discovery management unit (RD) in distributed Exascale systems needs to be able to manage the occurrence of dynamic and interactive events in the requesting process when running activities related to RD. The...
SCALABLE COMPLEX EVENT PROCESSING USING RULE DISTRIBUTION
Complex event processing (CEP) systems are currently widely used in large-scale enterprises for the processing of high and dynamically changing rates of input events using large number of complex rules. Given the hardwar...
DATA MIGRATION FOR LARGE SCIENTIFIC DATASETS IN CLOUDS
Transferring large data files between various storages including cloud storages is an important task both for academic and commercial users. This should be done in an efficient and secure way. The paper describes Data Av...
A SURVEY OF RESOURCE MANAGEMENT CHALLENGES IN MULTI-CLOUD ENVIRONMENT: TAXONOMY AND EMPIRICAL ANALYSIS
HOME ABOUT SUBMISSION SEARCH CURRENT ARCHIVES A SURVEY OF RESOURCE MANAGEMENT CHALLENGES IN MULTI-CLOUD ENVIRONMENT: TAXONOMY AND EMPIRICAL ANALYSIS Hits: 159 PDF Volume 1 (1), July 2018, Pages 51-65 Bandar Aldawsari1,...
APPLYING MULTIPLE MULTIDIMENSIONAL KNAPSACK PROBLEM TO DYNAMIC LOAD BALANCING IN DISTRIBUTED EXASCALE COMPUTING ENVIRONMENT
Dynamic and Interactive nature of the processes in the Distributed Exascale computing system requires the system to be able to make Load Balancing in runtime. In this paper proposed applying Multiple Multidimensional Kna...