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

CONVERGENCE OF HPC AND AI: TWO DIRECTIONS OF CONNECTION PDF

This paper examines the role of HPC systems in the solution of the most AI problems, on the other hand, assesses the impact of the application of AI methods on the resolution of different tasks in distributed systems. Th...

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...

ENHANCING QOS USING A NOVEL TASK SCHEDULING APPROACH IN CLOUD COMPUTING

Customers’ satisfaction at the ensured organizations has a strong reliance on the specific execution of appropriated registering from the perspectives of benefit bit and undertaking booking. Disregarding the way that thi...

ISE: AN INTELLIGENT AND EFFICIENT STEGANALYSIS ENGINE FOR IMAGE DATABASE IN BIG DATA SYSTEMS

The aim of this work is to design a faster and artificially intelligent steganalysis engine, which is able to secure the image databases from any infected image in big data environment. The proposed Intelligent Steganaly...

CLOUD-BASED FLOWBSTER PORTAL TO DESIGN AND DEPLOY SCIENTIFIC WORKFLOWS

A workflow system called Flowbster has been designed to create efficient data pipelines in clouds. The entire Flowbster workflow is dynamically built by using virtual machines on a target cloud. The paper describes a rec...

Download PDF file
  • EP ID EP525581
  • DOI 10.32010/26166127.2018.1.1.87.112
  • Views 50
  • Downloads 0

How To Cite

Kamal Z. Zamli, Abdulrahman Alsewari, Bestoun S. Ahmed (2018). MULTI-START JAYA ALGORITHM FOR SOFTWARE MODULE CLUSTERING PROBLEM. Azerbaijan Journal of High Performance Computing, 1(1), 87-112. https://europub.co.uk/articles/-A-525581