Beautiful Mind: a meta-heuristic algorithm for generating minimal covering array

Beautiful Mind: a meta-heuristic algorithm for generating minimal covering array | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Beautiful Mind: a meta-heuristic algorithm for generating minimal covering array Sajad Esfandyari, Vahid Rafe, Einollah Pira, liela Yousofvand This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-3195308/v2 This work is licensed under a CC BY 4.0 License Status: Posted Version 2 posted You are reading this latest preprint version Show more versions Abstract Today, the application of meta-heuristic algorithms in solving problems is very important. This importance has led to the development of hundreds of types of meta-heuristic algorithms by researchers. The reason for the high number of such algorithms is that an algorithm may be superior to its competitors in a particular problem. Generating a test set in Combinatorial Testing (CT) is one of the thousands of problems that can be solved by meta-heuristic algorithms and hundreds of algorithms have been proposed in this regard. The main challenge in producing a test set in CT is becoming trapped in local optima that several solutions have been offered to overcome this problem. Since the proposed solutions are very slow in terms of time, it is still possible to produce better results by applying other solutions. Continuing our research in the field of CT, we have tried to present a new meta-heuristic solution called Beautiful Mind (BM), which simulates the human way to reach the answer. In fact, the proposed algorithm considers the human intelligence and emotional coefficient to find the answer. The evaluation results show that the proposed approach is much stronger than the existing solutions. Beautiful Mind (BM) Combinatorial Testing (CT) Coverage Array (CA) Full Text Additional Declarations The authors declare no competing interests. Cite Share Download PDF Status: Posted Version 2 posted You are reading this latest preprint version Show more versions Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-3195308","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":222123258,"identity":"93bbfa0e-53b1-41c9-a088-389069008cb1","order_by":0,"name":"Sajad Esfandyari","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA/ElEQVRIiWNgGAWjYHCCBAYeBgYeefb+jw+APB4+YrXIGPYcMDYAaWEjyh6gFhuGGw5mEiAOQS3y7QcefnjDYMfDOIMhrfJrjp0MGwPzw0c38GgxOJOQLDmHIZmHXbrh2G3ZbclAh7EZG+fg08KQkCDNw8DMwzjnYNttyW3MQC08bNL4tMj3P0j+zcNQz8NwI5mtWHJbPWEtDDcS0oC2HAZqSWNj/LjtMGEtBjcepFnOMTjOY9hzhlmacdtxHjZmAn6R789JvvGmotpenr2H8ePPbdX2/OzNDx/jdRgDTwIoEMCAmQdM4lUOAuwH4EzGHwRVj4JRMApGwUgEAPh1QkB1VKEaAAAAAElFTkSuQmCC","orcid":"","institution":"ACECR institute of higher education","correspondingAuthor":true,"prefix":"","firstName":"Sajad","middleName":"","lastName":"Esfandyari","suffix":""},{"id":222123259,"identity":"0aff15d4-6fde-428f-ba96-dc6543ce6c22","order_by":1,"name":"Vahid Rafe","email":"","orcid":"","institution":"Arak University","correspondingAuthor":false,"prefix":"","firstName":"Vahid","middleName":"","lastName":"Rafe","suffix":""},{"id":222123260,"identity":"23542c22-3bce-4942-9b0e-34d453039b50","order_by":2,"name":"Einollah Pira","email":"","orcid":"","institution":"Azarbaijan Shahid Madani University","correspondingAuthor":false,"prefix":"","firstName":"Einollah","middleName":"","lastName":"Pira","suffix":""},{"id":222123261,"identity":"58e341f2-8f78-42bf-8355-ff1f224cf082","order_by":3,"name":"liela Yousofvand","email":"","orcid":"","institution":"Arak University","correspondingAuthor":false,"prefix":"","firstName":"liela","middleName":"","lastName":"Yousofvand","suffix":""}],"badges":[],"createdAt":"2023-07-22 20:59:03","currentVersionCode":2,"declarations":{"humanSubjects":false,"vertebrateSubjects":false,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":false},"doi":"10.21203/rs.3.rs-3195308/v2","doiUrl":"https://doi.org/10.21203/rs.3.rs-3195308/v2","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":51143497,"identity":"f14cc799-f098-4c9b-9555-c85671eee2b2","added_by":"auto","created_at":"2024-02-14 21:43:36","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":586553,"visible":true,"origin":"","legend":"","description":"","filename":"English140108073.pdf","url":"https://assets-eu.researchsquare.com/files/rs-3195308/v2_covered_c7527cdf-5e7d-472a-b303-4eb8545c2b58.pdf"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"Beautiful Mind: a meta-heuristic algorithm for generating minimal covering array","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Beautiful Mind (BM), Combinatorial Testing (CT), Coverage Array (CA)","lastPublishedDoi":"10.21203/rs.3.rs-3195308/v2","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-3195308/v2","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eToday, the application of meta-heuristic algorithms in solving problems is very important. This importance has led to the development of hundreds of types of meta-heuristic algorithms by researchers. The reason for the high number of such algorithms is that an algorithm may be superior to its competitors in a particular problem. Generating a test set in Combinatorial Testing (CT) is one of the thousands of problems that can be solved by meta-heuristic algorithms and hundreds of algorithms have been proposed in this regard. The main challenge in producing a test set in CT is becoming trapped in local optima that several solutions have been offered to overcome this problem. Since the proposed solutions are very slow in terms of time, it is still possible to produce better results by applying other solutions. Continuing our research in the field of CT, we have tried to present a new meta-heuristic solution called Beautiful Mind (BM), which simulates the human way to reach the answer. In fact, the proposed algorithm considers the human intelligence and emotional coefficient to find the answer. The evaluation results show that the proposed approach is much stronger than the existing solutions.\u003c/p\u003e","manuscriptTitle":"Beautiful Mind: a meta-heuristic algorithm for generating minimal covering array","msid":"","msnumber":"","nonDraftVersions":[{"code":2,"date":"2024-02-14 21:27:26","doi":"10.21203/rs.3.rs-3195308/v2","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}},{"code":1,"date":"2023-07-27 18:15:58","doi":"10.21203/rs.3.rs-3195308/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"d4bf00ed-0b58-4a95-8835-02b3ad4b22db","owner":[],"postedDate":"February 14th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2023-08-18T21:14:16+00:00","versionOfRecord":[],"versionCreatedAt":"2024-02-14 21:27:26","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v2","identity":"rs-3195308","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-3195308","identity":"rs-3195308","version":["v2"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}