arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.6116cs.SEcs.NE
收藏

软件设计从结构化向面向对象迁移的遗传算法

A Genetic Algorithm for Software Design Migration from Structured to Object Oriented Paradigm

Md. Selim, Saeed Siddik, Alim Ul Gias, M. Abdullah-Al-Wadud, Shah Mostafa Khaled

摘要:

将软件设计从结构化范式迁移到面向对象范式的潜在好处是多方面的,包括模块化、可扩展性和可扩展性。这种设计迁移应该自动化,因为它将减少手动过程所需的时间。我们以前的工作已经解决了这个问题的最优图聚类问题制定的二次规划(IP)。然而,已经认识到,IP的解决方案是计算困难的,因此需要基于启发式的方法来获得接近最优的解决方案。本文提出了一种遗传算法(GA)的最优聚类的目标是最大化的类内边缘,而最小化的类间的。该算法依靠基于适应度的父选择和交叉聚类元素,逐步达到最优解。该方案的实施和测试对一组真实和合成数据。实验结果表明,遗传算法优于我们以前的工作的基础上贪婪和蒙特卡罗方法的40%和49.5%。

英文摘要:

The potential benefit of migrating software design from Structured to Object Oriented Paradigm is manifolded including modularity, manageability and extendability. This design migration should be automated as it will reduce the time required in manual process. Our previous work has addressed this issue in terms of optimal graph clustering problem formulated by a quadratic Integer Program (IP). However, it has been realized that solution to the IP is computationally hard and thus heuristic based methods are required to get a near optimal solution. This paper presents a Genetic Algorithm (GA) for optimal clustering with an objective of maximizing intra-cluster edges whereas minimizing the inter-cluster ones. The proposed algorithm relies on fitness based parent selection and cross-overing cluster elements to reach an optimal solution step by step. The scheme was implemented and tested against a set of real and synthetic data. The experimental results show that GA outperforms our previous works based on Greedy and Monte Carlo approaches by 40% and 49.5%.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑