A hybrid kidney algorithm strategy for combinatorial interaction testing problem / (Record no. 99373)

MARC details
000 -LEADER
fixed length control field 03710ntm a2200373 i 4500
003 - CONTROL NUMBER IDENTIFIER
control field MY-KuUP
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20251125110729.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS
fixed length control field t||||fr|||| 000 0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field ta
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 230411t20222022my a|||fr|||| 000 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number THE0009608 (Local)
Qualifying information Hardback
040 ## - CATALOGING SOURCE
Original cataloging agency UMP
Language of cataloging eng
Transcribing agency UMP
Description conventions rda
090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN)
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) FKOM .A44 2022 r Thesis
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Ameen Ali Mohammed Ba Homaid,
Relator term author.
245 10 - TITLE STATEMENT
Title A hybrid kidney algorithm strategy for combinatorial interaction testing problem /
Statement of responsibility, etc. Ameen Ali Mohammed Ba Homaid
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Kuantan, Pahang :
Name of producer, publisher, distributor, manufacturer UMP,
Date of production, publication, distribution, manufacture, or copyright notice 2022
264 #4 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Date of production, publication, distribution, manufacture, or copyright notice ©2022
300 ## - PHYSICAL DESCRIPTION
Extent xiv,145 pages
Other physical details illustrations (some color) ;
Dimensions 30 cm. +
Accompanying material 1 CD-ROM
336 ## - CONTENT TYPE
Source rdacontent
Content type term text
336 ## - CONTENT TYPE
Source rdacontent
Content type term text
337 ## - MEDIA TYPE
Source rdamedia
Media type term unmediated
337 ## - MEDIA TYPE
Source rdamedia
Media type term computer
338 ## - CARRIER TYPE
Source rdacarrier
Carrier type term volume
338 ## - CARRIER TYPE
Source rdacarrier
Carrier type term computer disc
347 ## - DIGITAL FILE CHARACTERISTICS
Source rda
File type text file
Encoding format PDF
500 ## - GENERAL NOTE
General note Faculty of Computing
502 ## - DISSERTATION NOTE
Dissertation note Thesis (Doctor of Philosophy) -- Universiti Malaysia Pahang – 2022
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references
520 3# - SUMMARY, ETC.
Summary, etc. Combinatorial Interaction Testing (CIT) generates a sampled test case set (Final Test Suite (FTS)) instead of all possible test cases. Generating the FTS with the optimum size is a computational optimization problem (COP) as well as a Non-deterministic Polynomial hard (NP-hard) problem. Recent studies have implemented hybrid metaheuristic algorithms as the basis for CIT strategy. However, the existing hybrid metaheuristic-based CIT strategies generate a competitive FTS size, there is no single CIT strategy can overcome others existing in all cases. In addition, the hybrid metaheuristic-based CIT strategies require more execution time than their own original algorithm-based strategies. Kidney Algorithm (KA) is a recent metaheuristic algorithm and has high efficiency and performance in solving different optimization problems against most of the state-of-the-art of metaheuristic algorithms. However, KA has limitations in the exploitation and exploration processes as well as the balancing control process is needed to be improved. These shortages cause KA to fail easily into the local optimum. This study proposes a low-level hybridization of KA with the mutation operator and improve the filtration process in KA to form a recently Hybrid Kidney Algorithm (HKA). HKA addresses the limitations in KA by improving the algorithm's exploration and exploitation processes by hybridizing KA with mutation operator, and improve the balancing control process by enhancing the filtration process in KA. HKA improves the efficiency in terms of generating an optimum FTS size and enhances the performance in terms of the execution time. HKA has been adopted into the CIT strategy as HKA based CIT Strategy (HKAS) to generate the most optimum FTS size. The results of HKAS shows that HKAS can generate the optimum FTS size in more than 67% of the benchmarking experiments as well as contributes by 34 new optimum size of FTS. HKAS also has better efficiency and performance than KAS. HKAS is the first hybrid metaheuristic-based CIT strategy that generates an optimum FTS size with less execution time than the original algorithm-based CIT strategy. Apart from supporting different CIT features: uniform/VS CIT, IOR CIT as well as the interaction strength up to 6, this study also introduces another recently variant of KA which are Improved KA (IKA) and Mutation KA (MKA) as well as new CIT strategies which are IKA-based (IKAS) and MKA-based (MKAS).
610 20 - SUBJECT ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Faculty of Computing
General subdivision Dissertations
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Universities and colleges
General subdivision Dissertations
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Theses
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Thesis
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
  Not lost Library of Congress Classification     UMPLIB PEKAN UMPLIB PEKAN 11/04/2023   FKOM .A44 2022 r Thesis T000002159 11/04/2023 1 11/04/2023 Thesis
  Not lost Library of Congress Classification     UMPLIB PEKAN UMPLIB PEKAN 11/04/2023   CD13246 T000002160 11/04/2023   11/04/2023 Thesis

Perpustakaan Universiti Malaysia Pahang Al-Sultan Abdullah
26600 Pekan, Pahang Darul Makmur
Phone: +609 431 5063 (Gambang) / +609 431 5035 (Pekan)
Email: umplibrary@umpsa.edu.my

Connect With Us