Hybrid flower pollination algorithm strategies for t-way test suite generation
Jazyk angličtina Země Spojené státy americké Médium electronic-ecollection
Typ dokumentu časopisecké články, práce podpořená grantem
PubMed
29718918
PubMed Central
PMC5931463
DOI
10.1371/journal.pone.0195187
PII: PONE-D-16-51632
Knihovny.cz E-zdroje
- MeSH
- algoritmy * MeSH
- biologické modely * MeSH
- květy fyziologie MeSH
- opylení * MeSH
- Publikační typ
- časopisecké články MeSH
- práce podpořená grantem MeSH
The application of meta-heuristic algorithms for t-way testing has recently become prevalent. Consequently, many useful meta-heuristic algorithms have been developed on the basis of the implementation of t-way strategies (where t indicates the interaction strength). Mixed results have been reported in the literature to highlight the fact that no single strategy appears to be superior compared with other configurations. The hybridization of two or more algorithms can enhance the overall search capabilities, that is, by compensating the limitation of one algorithm with the strength of others. Thus, hybrid variants of the flower pollination algorithm (FPA) are proposed in the current work. Four hybrid variants of FPA are considered by combining FPA with other algorithmic components. The experimental results demonstrate that FPA hybrids overcome the problems of slow convergence in the original FPA and offers statistically superior performance compared with existing t-way strategies in terms of test suite size.
Zobrazit více v PubMed
Glover F, Laguna M (1999) Tabu search: Springer.
Kirkpatrick S (1984) Optimization by simulated annealing: quantitative studies. Journal of Statistical Physics 34: 975–986.
Holland JH (1992) Genetic algorithms. Scientific American 267: 66–72.
Dorigo M, Birattari M, Blum C, Clerc M, Stützle T, et al. Ant colony optimization and swarm intelligence; 2008. Springer-Verlag; Berlin Heidelberg.
Kennedy J (2011) Particle swarm optimization In: Sammut C, Webb GI, editors. Encyclopedia of machine learning: Springer; pp. 760–766.
Feoktistov V (2006) Differential evolution: Springer.
Lee KS, Geem ZW (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Computer Methods in Applied Mechanics and Engineering 194: 3902–3933.
Yang X-S. Flower pollination algorithm for global optimization; 2012. Springer; pp. 240–249.
Mirjalili S (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowledge-Based Systems 96: 120–133.
Pham D, Ghanbarzadeh A, Koc E, Otri S, Rahim S, et al. The bees algorithm: a novel tool for complex optimisation; 2011. sn.
Yang X-S, Deb S. Cuckoo search via lévy flights; 2009. IEEE; pp. 210–214.
Yang X-S (2010) Firefly algorithm, lévy flights and global optimization In: Ellis R, Petridis M, editors. Research and Development in Intelligent Systems XXVI: Springer; pp. 209–218.
Stardom J (2001) Metaheuristics and the search for covering and packing arrays: Simon Fraser University.
Shiba T, Tsuchiya T, Kikuno T. Using artificial life techniques to generate test cases for combinatorial testing; 2004. pp. 72–77.
Ahmed BS, Zamli KZ, Lim CP (2012) Constructing a t-way interaction test suite using the particle swarm optimization approach. International Journal of Innovative Computing, Information and Control 8: 431–452.
Alsewari ARA, Zamli KZ (2012) Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support. Information and Software Technology 54: 553–568.
Ahmed BS, Abdulsamad TS, Potrus MY (2015) Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the cuckoo search algorithm. Information and Software Technology 66: 13–29.
Alsewari ARA, Zamli KZ. An orchestrated survey on t-way test case generation strategies based on optimization algorithms; 2014. Springer; pp. 255–263.
Blum C, Puchinger J, Raidl GR, Roli A (2011) Hybrid metaheuristics in combinatorial optimization: a survey. Applied Soft Computing 11: 4135–4151.
Blum C, Roli A (2008) Hybrid metaheuristics: an introduction Hybrid Metaheuristics: Springer; pp. 1–30.
Yang X-S, Karamanoglu M, He X (2014) Flower pollination algorithm: a novel approach for multiobjective optimization. Engineering Optimization 46: 1222–1237.
Raouf OA, El-henawy I, Abdel-Baset M (2014) A novel hybrid flower pollination algorithm with chaotic harmony search for solving sudoku puzzles. International Journal of Modern Education and Computer Science 3: 38–44.
Wang R, Zhou Y, Qiao S, Huang K (2016) Flower pollination algorithm with bee pollinator for cluster analysis. Information Processing Letters 116: 1–14.
Wang R, Zhou Y, Zhao C, Wu H (2015) A hybrid flower pollination algorithm based modified randomized location for multi-threshold medical image segmentation. Bio-Medical Materials and Engineering 26: S1345–S1351. doi: 10.3233/BME-151432 PubMed DOI
Dubey HM, Pandit M, Panigrahi B (2015) Hybrid flower pollination algorithm with time-varying fuzzy selection mechanism for wind integrated multi-objective dynamic economic dispatch. Renewable Energy 83: 188–202.
Zhou Y, Wang R, Luo Q (2016) Elite opposition-based flower pollination algorithm. Neurocomputing 188: 294–310.
Cohen DM, Dalal SR, Parelius J, Patton GC (1996) The combinatorial design approach to automatic test generation. IEEE software 13: 83–88.
Williams AW, Probert RL (2002) Software components interaction testing: coverage measurement and generation of configurations: University of Ottawa.
Kuhn DR, Kacker RN, Lei Y (2010) Practical combinatorial testing. National Institute of Standards and Technology (NIST) Special Publication 800: 142.
Grindal M, Offutt J, Andler SF (2005) Combination testing strategies: a survey. Software Testing Verification & Reliability 15: 167–199.
Bell KZ (2006) Optimizing effectiveness and efficiency of software testing: a hybrid approach [Doctoral dissertation]. ACM: North Carolina State University.
Bell KZ, Vouk MA. On effectiveness of pairwise methodology for testing network-centric software; 2005. IEEE; pp. 221–235.
Burr K, Young W. Combinatorial test techniques: table-based automation, test generation and code coverage; 1998. San Diego.
Yilmaz C, Cohen MB, Porter AA (2006) Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Transactions on Software Engineering 32: 20–34.
Lei Y, Kacker R, Kuhn DR, Okun V, Lawrence J (2008) IPOG/IPOG-D: efficient test generation for multi-way combinatorial testing. Software Testing, Verification and Reliability 18: 125–148.
Williams AW (2000) Determination of test configurations for pair-wise interaction coverage. In: Ural H, Probert RL, v. Bochmann G, editors. Testing of Communicating Systems: Tools and Techniques IFIP TC6/WG61 13th International Conference on Testing of Communicating Systems (TestCom 2000). Boston, MA: Springer US. pp. 59–74.
Lei Y, Tai K-C. In-parameter-order: a test generation strategy for pairwise testing; 1998. IEEE Computer Society. pp. 254–261.
Lei Y, Kacker R, Kuhn DR, Okun V, Lawrence J. IPOG: a general strategy for t-way software testing; 2007. IEEE; pp. 549–556.
Forbes M, Lawrence J, Lei Y, Kacker RN, Kuhn DR (2008) Refining the in-parameter-order strategy for constructing covering arrays. Journal of Research of the National Institute of Standards and Technology 113: 287 doi: 10.6028/jres.113.022 PubMed DOI PMC
Cohen DM, Dalal SR, Fredman ML, Patton GC (1997) The AETG system: an approach to testing based on combinatorial design. IEEE Transactions on Software Engineering 23: 437–444.
Jenkins B (2003) Jenny tool.
Williams A (1996) TConfig tool. University of Ottawa.
Hartman A, Klinger T, Raskin L (2010) IBM intelligent test case handler. Discrete Mathematics 284: 149–156.
Sthamer H-H (1995) The automatic generation of software test data using genetic algorithms: University of Glamorgan.
Ahmed BS, Zamli KZ (2011) A variable strength interaction test suites generation strategy using particle swarm optimization. Journal of Systems and Software 84: 2171–2185.
Lee KY, Park JB. Application of particle swarm optimization to economic dispatch problem: advantages and disadvantages; 2006. IEEE; pp. 188–192.
Yang X-S (2010) Nature-inspired metaheuristic algorithms: Luniver press.
Geem ZW (2006) Optimal cost design of water distribution networks using harmony search. Engineering Optimization 38: 259–277.
Zamli KZ, Alkazemi BY, Kendall G (2016) A tabu search hyper-heuristic strategy for t-way test suite generation. Applied Soft Computing 44: 57–74.
Leins P, Erbar C (2010) Flower and fruit: morphology, ontogeny, phylogeny, function and ecology: Schweizerbart; Stuttgart.
Grüter C, Ratnieks FL (2011) Flower constancy in insect pollinators. Communicative & Integrative Biology 4. PubMed PMC
Abdel-Raouf O, El-Henawy I, Abdel-Baset M (2014) A novel hybrid flower pollination algorithm with chaotic harmony search for solving sudoku puzzles. International Journal of Modern Education and Computer Science 6: 38.
Abdel-Baset M, Hezam IM (2015) An effective hybrid flower pollination and genetic algorithm for constrained optimization problems. International Journal Advanced Engineering Technology and Application 4: 27–34.
Abdel-Raouf O, Abdel-Baset M (2014) A new hybrid flower pollination algorithm for solving constrained global optimization problems. International Journal of Applied Operational Research-An Open Access Journal 4: 1–13.
Hezam IM, Abdel-Baset M, Hassan BM (2015) A hybrid flower pollination algorithm with tabu search for unconstrained optimization problems. Information Sciences Letters 5: 29–34.
Chakraborty D, Saha S, Dutta O. DE-FPA: a hybrid differential evolution-flower pollination algorithm for function minimization; 2014. IEEE; pp. 1–6.
Nabil E (2016) A modified flower pollination algorithm for global optimization. Expert Systems with Applications 57: 192–203.
Johal NK, Singh S, Kundra H (2010) A hybrid FPAB/BBO algorithm for satellite image classification. International Journal of Computer Applications (0975–8887) 6.
Wang R, Zhou Y (2014) Flower pollination algorithm with dimension by dimension improvement. Mathematical Problems in Engineering 2014.
Zhou Y, Wang R (2016) An improved flower pollination algorithm for optimal unmanned undersea vehicle path planning problem. International Journal of Pattern Recognition and Artificial Intelligence 30: 1659010.
Nasser AB, Alsewari ARA, Zamli KZ. Tuning of cuckoo search based strategy for t-way testing; 2015. Journal of Engineering and Applied Sciences. pp. 8948.
Cohen MB (2004) Designing test suites for software interaction testing [Doctoral dissertation]: University of Auckland.