Show simple item record

dc.contributor.advisorMcCall, John
dc.contributor.advisorLonie, David P.
dc.contributor.authorChristie, Lee A.
dc.date.accessioned2016-08-16T07:39:33Z
dc.date.available2016-08-16T07:39:33Z
dc.date.issued2016-02
dc.identifier.citationCHRISTIE, L.A. 2016. The role of Walsh structure and ordinal linkage in the optimisation of pseudo-Boolean functions under monotonicity invariance. Robert Gordon University, PhD thesis.en
dc.identifier.urihttp://hdl.handle.net/10059/1567
dc.description.abstractOptimisation heuristics rely on implicit or explicit assumptions about the structure of the black-box fitness function they optimise. A review of the literature shows that understanding of structure and linkage is helpful to the design and analysis of heuristics. The aim of this thesis is to investigate the role that problem structure plays in heuristic optimisation. Many heuristics use ordinal operators; which are those that are invariant under monotonic transformations of the fitness function. In this thesis we develop a classification of pseudo-Boolean functions based on rank-invariance. This approach classifies functions which are monotonic transformations of one another as equivalent, and so partitions an infinite set of functions into a finite set of classes. Reasoning about heuristics composed of ordinal operators is, by construction, invariant over these classes. We perform a complete analysis of 2-bit and 3-bit pseudo-Boolean functions. We use Walsh analysis to define concepts of necessary, unnecessary, and conditionally necessary interactions, and of Walsh families. This helps to make precise some existing ideas in the literature such as benign interactions. Many algorithms are invariant under the classes we define, which allows us to examine the difficulty of pseudo-Boolean functions in terms of function classes. We analyse a range of ordinal selection operators for an EDA. Using a concept of directed ordinal linkage, we define precedence networks and precedence profiles to represent key algorithmic steps and their interdependency in terms of problem structure. The precedence profiles provide a measure of problem difficulty. This corresponds to problem difficulty and algorithmic steps for optimisation. This work develops insight into the relationship between function structure and problem difficulty for optimisation, which may be used to direct the development of novel algorithms. Concepts of structure are also used to construct easy and hard problems for a hill-climber.en
dc.language.isoenen
dc.publisherRobert Gordon Universityen
dc.relation.urihttp://hdl.handle.net/10059/1585
dc.relation.urihttp://hdl.handle.net/10059/1407
dc.rightshttps://creativecommons.org/licenses/by-nc-nd/4.0 ; Copyright: Lee A. Christieen
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectHeuristicsen
dc.subjectPseudo-Boolean functionsen
dc.subjectWalsh analysisen
dc.subjectProblem structuresen
dc.titleThe role of Walsh structure and ordinal linkage in the optimisation of pseudo-Boolean functions under monotonicity invariance.en
dc.typeTheses and dissertationsen
dc.publisher.departmentFaculty of Design and Technology. School of Computing Science and Digital Media.en
dc.type.qualificationlevelDoctoralen
dc.type.qualificationnamePhDen


Files in this item

This item appears in the following Collection(s)

Show simple item record

https://creativecommons.org/licenses/by-nc-nd/4.0 ; Copyright: Lee A. Christie
Except where otherwise noted, this item's license is described as https://creativecommons.org/licenses/by-nc-nd/4.0 ; Copyright: Lee A. Christie