TWGH: A Tripartite Whale–Gray Wolf–Harmony Algorithm to Minimize Combinatorial Test Suite Problem

نویسندگان

چکیده

Today’s academics have a major hurdle in solving combinatorial problems the actual world. It is nevertheless possible to use optimization techniques find, design, and solve genuine optimal solution particular problem, despite limitations of applied approach. A surge interest population-based methodologies has spawned plethora new improved approaches wide range engineering problems. Optimizing test suites testing challenge that been demonstrated be an extremely difficult limitation research. The authors proposed almost infallible method for selecting cases. uses hybrid whale–gray wolf algorithm conjunction with harmony search techniques. Test suite size was significantly reduced using approach, as shown by analysis results. In order assess quality, speed, scalability TWGH, experiments were carried out on set well-known benchmarks. tests strategy good overall strong reputation reduction could used improve performance. Compared optimization-based strategies, TWGH gives competitive results supports high combinations (2 ≤ t 12).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial Test Case Suite Generation Based on Differential Evolution Algorithm

The combinatorial testing, an effective way to improve the efficiency of software testing, is an important means to ensure the quality of software. In the combinatorial testing, the key is the combinatorial test case suite generation. According to the characteristics of the combinatorial test case suite generation problem, this paper proposes a differential evolution algorithm based on the one-...

متن کامل

A Test Suite for Combinatorial Auctions

Many researchers have proposed algorithms for determining the winners of general combinatorial auctions, with encouraging results. (Some of these algorithms are described in Chapter 14 of this book.) This line of research has given rise to another problem, however. In order to evaluate—and thus to improve—such algorithms, it is necessary to use some sort of test data. Unfortunately, there is li...

متن کامل

Generating Small Combinatorial Test Suite via LP

Generating a set of combinatorial test cases for web application and development is very important. Linear programming (LP) is one of approaches to generating small combinatorial test suite. But, for software under test (SUT), the number of combinatorial test cases is often extremely large. If using LP to optimize test suite, the optimizing efficiency is low for the enormous size of LP variable...

متن کامل

A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness

This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...

متن کامل

A mixed multi-unit combinatorial auctions test suite

Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to solve SCF problems, and thus be employed for the automated assembly of supply chains of agents. In this paper we present MMUCATS, a test suite for MMUCAs that al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2022

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics11182885