<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-21T17:03:56Z</responseDate><request verb="GetRecord" identifier="oai:cora.ucc.ie:10468/14544" metadataPrefix="dim">https://cora.ucc.ie/server/oai/request</request><GetRecord><record><header><identifier>oai:cora.ucc.ie:10468/14544</identifier><datestamp>2023-06-08T02:02:21Z</datestamp><setSpec>com_10468_388</setSpec><setSpec>com_10468_5</setSpec><setSpec>com_10468_227</setSpec><setSpec>com_10468_2481</setSpec><setSpec>com_10468_6</setSpec><setSpec>com_10468_88</setSpec><setSpec>com_10468_1</setSpec><setSpec>col_10468_389</setSpec><setSpec>col_10468_511</setSpec><setSpec>col_10468_5231</setSpec><setSpec>col_10468_859</setSpec><setSpec>col_10468_8983</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="availability" qualifier="bitstream">restricted</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" authority="f0735c43a333bee77d94f04092794c153515e7b9" confidence="600">Prestwich, Steve</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" authority="278ff8b7fc2b5767181ce530a9000ba7043edc3d" confidence="600">Tarim, Armagan</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">O&amp;apos;Luing, Mervyn</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="funder" lang="en" authority="6365904c919db7883d02214dd1987f1bc712f023" confidence="600">European Regional Development Fund</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="funder" lang="en" authority="5536f3b383dadcfd9e7f6cbdcd2ac1df5e1b2abb" confidence="600">Science Foundation Ireland</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2023-06-06T12:43:54Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2023-06-06T12:43:54Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2022-01</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2022-01</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In this thesis, we propose a number of metaheuristics and machine learning&#xd;
techniques to solve the joint stratification and sample allocation problem. Finding&#xd;
the optimal solution to this problem is hard when the sampling frame is large, and&#xd;
the evaluation algorithm is computationally burdensome.&#xd;
To advance the research in this area, we explore and evaluate different&#xd;
algorithmic methods of modelling and solving this problem. Firstly, we propose&#xd;
a new genetic algorithm approach using &amp;quot;grouping&amp;quot; genetic operators instead of&#xd;
traditional operators. Experiments show a significant improvement in solution&#xd;
quality for similar computational effort. Next, we combine the capability of a&#xd;
simulated annealing algorithm to escape from local minima with delta evaluation to&#xd;
exploit the similarity between consecutive solutions and thereby reduce evaluation&#xd;
time. Comparisons with two recent algorithms show the simulated annealing&#xd;
algorithm attaining comparable solution qualities in less computation time.&#xd;
Then, we consider the combination of the k-means and clustering algorithms&#xd;
with a hill climbing algorithm in stages and report the solution costs, evaluation times&#xd;
and training times. The multi-stage combinations generally compare well with recent&#xd;
algorithms, and provide the survey designer with a greater choice of algorithms to&#xd;
choose from.&#xd;
Finally, we combine the explorative properties of an estimation of distribution&#xd;
algorithm (EDA) to model the probabilities of an atomic stratum belonging to&#xd;
different strata with the exploitative search properties of a simulated annealing&#xd;
algorithm to create a hybrid estimation of distribution algorithm (HEDA).&#xd;
Results of comparisons with the best solution qualities from our earlier&#xd;
experiments show that the HEDA finds better solution qualities, but requires a longer&#xd;
total execution time than alternative approaches we considered.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="status" lang="en">Not peer reviewed</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="version" lang="en">Accepted Version</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="citation" lang="en">O&amp;apos;Luing, M. 2022. Metaheuristics and machine learning for joint stratification and sample allocation in survey design. PhD Thesis, University College Cork.</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="endpage" lang="en">214</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/10468/14544</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University College Cork</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="project" lang="en" authority="SFI/SFI Research Centres Programme::Phase 2/12" confidence="600">info:eu-repo/grantAgreement/SFI/SFI Research Centres Programme::Phase 2/12/RC/2289-P2s/IE/INSIGHT Phase 2/</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="project" lang="en" authority="SFI/SFI Research Centres Programme::Phase 1/16" confidence="600">info:eu-repo/grantAgreement/SFI/SFI Research Centres Programme::Phase 1/16/RC/3918/IE/Confirm Centre for Smart Manufacturing/</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">© 2022, Mervyn O&amp;apos;Luing.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en">https://creativecommons.org/licenses/by-nc-nd/4.0/</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Metaheuristics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Machine learning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Stratification and sample allocation</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Survey design</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Metaheuristics and machine learning for joint stratification and sample allocation in survey design</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral thesis</dim:field>
   <dim:field mdschema="dc" element="type" qualifier="qualificationlevel" lang="en">Doctoral</dim:field>
   <dim:field mdschema="dc" element="type" qualifier="qualificationname" lang="en">PhD - Doctor of Philosophy</dim:field>info:eu-repo/semantics/openAccess</dim:dim></metadata></record></GetRecord></OAI-PMH>