Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Angle modulated population based algorithms to solve binary problems

Dissertation (MSc)--University of Pretoria, 2012.

Saved in:
Bibliographic Details
Other Authors: Engelbrecht, Andries P.
Format: Thesis
Published: University of Pretoria 2013
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867613629187096576
access_status_str Open Access
author2 Engelbrecht, Andries P.
author_browse Engelbrecht, Andries P.
author_facet Engelbrecht, Andries P.
collection Thesis
dc_rights_str_mv © 2012, University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria.
description Dissertation (MSc)--University of Pretoria, 2012.
format Thesis
id oai:repository.up.ac.za:2263/22801
institution University of Pretoria (South Africa)
last_indexed 2026-06-10T12:39:11.002Z
license_str Other — see source repository
provenance_str_mv Harvested via OAI-PMH from UPSpace — University of Pretoria Institutional Repository
publishDate 2013
publishDateRange 2013
publishDateSort 2013
publisher University of Pretoria
publisherStr University of Pretoria
record_format dspace
source_str UPSpace — University of Pretoria Institutional Repository
spelling oai:repository.up.ac.za:2263/22801 Angle modulated population based algorithms to solve binary problems Engelbrecht, Andries P. gpampara@gmail.com Pampara, Gary Angle modulation Eolutionary programming Genetic algorithm Differential evolution Particle swarm optimization (PSO) Atificial bee colony Homomorphous mapping Binary problem optimization UCTD Dissertation (MSc)--University of Pretoria, 2012. Recently, continuous-valued optimization problems have received a great amount of focus, resulting in optimization algorithms which are very efficient within the continuous-valued space. Many optimization problems are, however, defined within the binary-valued problem space. These continuous-valued optimization algorithms can not operate directly on a binary-valued problem representation, without algorithm adaptations because the mathematics used within these algorithms generally fails within a binary problem space. Unfortunately, such adaptations may alter the behavior of the algorithm, potentially degrading the performance of the original continuous-valued optimization algorithm. Additionally, binary representations present complications with respect to increasing problem dimensionality, interdependencies between dimensions, and a loss of precision. This research investigates the possibility of applying continuous-valued optimization algorithms to solve binary-valued problems, without requiring algorithm adaptation. This is achieved through the application of a mapping technique, known as angle modulation. Angle modulation effectively addresses most of the problems associated with the use of a binary representation by abstracting a binary problem into a four-dimensional continuous-valued space, from which a binary solution is then obtained. The abstraction is obtained as a bit-generating function produced by a continuous-valued algorithm. A binary solution is then obtained by sampling the bit-generating function. This thesis proposes a number of population-based angle-modulated continuous-valued algorithms to solve binary-valued problems. These algorithms are then compared to binary algorithm counterparts, using a suite of benchmark functions. Empirical analysis will show that the angle-modulated continuous-valued algorithms are viable alternatives to binary optimization algorithms. Copyright 2012, University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. Please cite as follows: Pamparà, G 2012, Angle modulated population based algorithms to solve binary problems, MSc dissertation, University of Pretoria, Pretoria, viewed yymmdd < http://upetd.up.ac.za/thesis/available/etd-02242012-090312 / > C12/4/188/gm Computer Science unrestricted 2013-09-06T13:47:25Z 2012-05-02 2013-09-06T13:47:25Z 2012-04-19 2012-05-02 2012-02-24 Dissertation Pampara, G 2012, Angle modulated population based algorithms to solve binary problems, MSc dissertation, University of Pretoria, Pretoria, viewed yymmdd < http://hdl.handle.net/2263/22801 > http://hdl.handle.net/2263/22801 http://upetd.up.ac.za/thesis/available/etd-02242012-090312/ © 2012, University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. application/pdf application/pdf University of Pretoria
spellingShingle Angle modulation
Eolutionary programming
Genetic algorithm
Differential evolution
Particle swarm optimization (PSO)
Atificial bee colony
Homomorphous mapping
Binary problem optimization
UCTD
Angle modulated population based algorithms to solve binary problems
title Angle modulated population based algorithms to solve binary problems
title_full Angle modulated population based algorithms to solve binary problems
title_fullStr Angle modulated population based algorithms to solve binary problems
title_full_unstemmed Angle modulated population based algorithms to solve binary problems
title_short Angle modulated population based algorithms to solve binary problems
title_sort angle modulated population based algorithms to solve binary problems
topic Angle modulation
Eolutionary programming
Genetic algorithm
Differential evolution
Particle swarm optimization (PSO)
Atificial bee colony
Homomorphous mapping
Binary problem optimization
UCTD
url http://hdl.handle.net/2263/22801
http://upetd.up.ac.za/thesis/available/etd-02242012-090312/