We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Extended ACO Algorithm for Path Prioritization

by Saurabh Srivastava, Himanshi Raperia, Jastej Badwal
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 67 - Number 1
Year of Publication: 2013
Authors: Saurabh Srivastava, Himanshi Raperia, Jastej Badwal
10.5120/11359-6582

Saurabh Srivastava, Himanshi Raperia, Jastej Badwal . Extended ACO Algorithm for Path Prioritization. International Journal of Computer Applications. 67, 1 ( April 2013), 17-21. DOI=10.5120/11359-6582

@article{ 10.5120/11359-6582,
author = { Saurabh Srivastava, Himanshi Raperia, Jastej Badwal },
title = { Extended ACO Algorithm for Path Prioritization },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 67 },
number = { 1 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 17-21 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume67/number1/11359-6582/ },
doi = { 10.5120/11359-6582 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:23:31.227058+05:30
%A Saurabh Srivastava
%A Himanshi Raperia
%A Jastej Badwal
%T Extended ACO Algorithm for Path Prioritization
%J International Journal of Computer Applications
%@ 0975-8887
%V 67
%N 1
%P 17-21
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Software testing is one major part of software development life cycle (SDLC) and thus tester need to have good testing algorithms in order to test the software correctly and efficiently. Ant colony optimization technique is a meta-heuristic technique which was first proposed by Dr. Marco Dorigo in his PhD thesis in 1992. He proposed a technique which was completely based on the behaviour of ants while taking their food to their colony. In this paper we put forward an extended approach of ant colony method which can be helpful in providing a better path sequence from shortest to longest path, based on the probability calculated using the extended formula. With the help of results we prove that the proposed formula fulfil the requirements.

References
  1. C. Peng LAM and Huaizhong LI, "An Ant Colony Optimization Approach to Test Sequence Generation for State based Software Testing", Proceedings of the Fifth International Conference on Quality Software (QSIC'05), pp 255 – 264,2005.
  2. Mohan V and Jeya Mala, "intelligent tester–Test Sequence Optimization framework using Multi-Agents", journal of computers, VOL. 3, NO. 6, Academy Publishers, 2008.
  3. A new data flow testing technique via ACO by Ahmed S. Ghiduk, Universal Journal of Computer Science and Engineering Technology 1 (1), 64-72, Oct. 2010. © 2010 UniCSE.
  4. wiki/ant_colony_optimization
  5. T. Stützle et H. H. Hoos, MAX MIN Ant System, Future Generation Computer Systems, volume 16, pages 889-914, 2000
  6. ACO based on ASRank and MMAS for VRPSPD, T zhang 2007.
  7. Arthur H. Watson and Thomas J. McCabe, "Structured testing: a testing methodology using the cyclomatic complexity metric," NIST Special Publication, September 1996.
  8. "An Improved Algorithm for Basis Path Testing" Du Qingfeng Dong Xiao ©2011 IEEE
  9. P. R. Srivastava "An Approach of Optimal Path Generation using Ant Colony Optimization" IEEE TENCON 2009, india 2009.
  10. Thomas J. McCabe "A Complexity Measure" IEEE Transactions on Software Engineering, Volume SE-2, No. 4, 1976.
  11. S. Sriavstava "basis path testing using ant colony optimization algorithm" ICRITO'2013 ISBN: 978-93-81583-85-2
  12. Aditya P. Mathur "Foundation of Software Testing" First Edition Pearson Education 2007.
  13. An Improved Method of Acquiring Basis Path for Software Testing Zhang Zhonglin, Mei Lingxia IEEE-ICCSE 2010
  14. Marco Dorigo "The Ant Colony Optimization Meta-heuristic: algorithms, Applications, and Advances, International Series in Operations Research & Management Science", vol. 57, Springer NY, 2003.
  15. Marnie L. Hutcheson, "Software Testing Fundamentals Methods and Metrics" Posts & Telecom Press, 2007-09
Index Terms

Computer Science
Information Sciences

Keywords

Software software testing ant colony optimization algorithm path sequence Cyclomatic complexity probability

Powered by PhDFocusTM