Approximation algorithms for software component selection problem

Nima Haghpanah, Jafar Habibi, Shahrouz Moaven, Mehdi Kargar, Soheil Hassas Yeganeh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Scopus citations

Abstract

Today's software systems are more frequently composed from preexisting commercial or non-commercial components and connectors. These components provide complex and independent functionality and are engaged in complex interactions. Component-Based Software Engineering (CBSE) is concerned with composing, selecting and designing such components. As the popularity of this approach and hence number of commercially available software components grows, selecting a set of components to satisfy a set of requirements while minimizing cost is becoming more difficult. This problem necessitates the design of efficient algorithms to automate component selection for software developing organizations. We address this challenge through analysis of Component Selection, the NP-complete process of selecting a minimal cost set of components to satisfy a set of objectives. Due to the high order of computational complexity of this problem, we examine approximating solutions that make the component selection process practicable. We adapt a greedy approach and a genetic algorithm to approximate this problem. We examined the performance of studied algorithms on a set of selected ActiveX components. Comparing the results of these two algorithms with the choices made by a group of human experts shows that we obtain better results using these approximation algorithms.

Original languageEnglish (US)
Title of host publicationProceedings - 14th Asia-Pacific Software Engineering Conference, APSEC 2007
Pages159-166
Number of pages8
DOIs
StatePublished - 2007
Event14th Asia Pacific Software Engineering Conference, ASPCE 2007 - Nagoya, Japan
Duration: Dec 4 2007Dec 7 2007

Publication series

NameProceedings - Asia-Pacific Software Engineering Conference, APSEC
ISSN (Print)1530-1362

Other

Other14th Asia Pacific Software Engineering Conference, ASPCE 2007
CountryJapan
CityNagoya
Period12/4/0712/7/07

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Approximation algorithms for software component selection problem'. Together they form a unique fingerprint.

  • Cite this

    Haghpanah, N., Habibi, J., Moaven, S., Kargar, M., & Yeganeh, S. H. (2007). Approximation algorithms for software component selection problem. In Proceedings - 14th Asia-Pacific Software Engineering Conference, APSEC 2007 (pp. 159-166). [4425850] (Proceedings - Asia-Pacific Software Engineering Conference, APSEC). https://doi.org/10.1109/APSEC.2007.26