An Evaluation of Requirement Prioritization Techniques with ANP

This article elaborates an evaluation of seven software requirements prioritization methods (ANP, binary search tree, AHP, hierarchy AHP, spanning tree matrix, priority group and bubble sort). Based on the case study of local project (automation of Mobilink franchise system), the experiment is conducted by students in the Requirement Engineering course in the department of Software Engineering at the University of Science and Technology Bannu, Khyber Pakhtunkhawa, Pakistan. Parameters/ measures used for the experiment are consistency indication, scale of measurement, interdependence, required number of decisions, total time consumption, time consumption per decision, ease of use, reliability of results and fault tolerance; on which requirements prioritization techniques are evaluated. The results of experiment show that ANP is the most successful prioritization methodology among all the available prioritization methodologies.

@article{Khan2016,
  title     = {An Evaluation of Requirement Prioritization Techniques with ANP},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {7},
  number    = {7},
  year      = {2016},
  publisher = {The Science and Information Organization},
  author    = {Javed ali Khan and Izaz-ur-Rehman and Iqbal Qasim and Shah Poor Khan and Yawar Hayat Khan},
  doi       = {10.14569/IJACSA.2016.070758},
  url       = {https://doi.org/10.14569/IJACSA.2016.070758}
}