Show simple item record

dc.contributor.authorLattarulo, Valerio
dc.date.accessioned2017-12-08T10:00:52Z
dc.date.available2017-12-08T10:00:52Z
dc.date.issued2017-12-01
dc.identifier.urihttps://www.repository.cam.ac.uk/handle/1810/270076
dc.description.abstractOptimization methodologies are particularly relevant nowadays due to the ever-increasing power of computers and the enhancement of mathematical models to better capture reality. These computational methods are used in many different fields and some of them, such as metaheuristics, have often been found helpful and efficient for the resolution of practical applications where finding optimal solutions is not straightforward. Many practical applications are multi-objective optimization problems: there is more than one objective to optimize and the solutions found represent trade-offs between the competing objectives. In the last couple of decades, several metaheuristics approaches have been developed and applied to practical problems and multi-objective versions of the main single-objective approaches were created. The Alliance Algorithm (AA) is a recently developed single-objective optimization algorithm based on the metaphorical idea that several tribes, with certain skills and resource needs, try to conquer an environment for their survival and try to ally together to improve the likelihood of conquest. The AA method has yielded reasonable results in several fields to which it has been applied, thus the development in this thesis of a multi-objective variant to handle a wider range of problems is a natural extension. The first challenge in the development of the Multi-objective Alliance Algorithm (MOAA) was acquiring an understanding of the modifications needed for this generalization. The initial version was followed by other versions with the aim of improving MOAA performance to enable its use in solving real-world problems: the most relevant variations, which led to the final version of the approach, have been presented. The second major contribution in this research was the development and combination of features or the appropriate modification of methodologies from the literature to fit within the MOAA and enhance its potential and performance. An analysis of the features in the final version of the algorithm was performed to better understand and verify their behavior and relevance within the algorithm. The third contribution was the testing of the algorithm on a test-bed of problems. The results were compared with those obtained using well-known baseline algorithms. Moreover, the last version of the MOAA was also applied to a number of real-world problems and the results, compared against those given by baseline approaches, are discussed. Overall, the results have shown that the MOAA is a competitive approach which can be used `out-of-the-box' on problems with different mathematical characteristics and in a wide range of applications. Finally, a summary of the objectives achieved, the current status of the research and the work that can be done in future to further improve the performance of the algorithm is provided.
dc.description.sponsorshipEPSRC
dc.language.isoen
dc.rightsNo Creative Commons licence (All rights reserved)
dc.rightsAll Rights Reserveden
dc.rights.urihttps://www.rioxx.net/licenses/all-rights-reserved/en
dc.subjectoptimization
dc.subjectmulti-objective
dc.subjectalgorithm
dc.titleDevelopment of a Multi-objective Variant of the Alliance Algorithm
dc.typeThesisen
dc.type.qualificationlevelDoctoral
dc.type.qualificationnameDoctor of Philosophy (PhD)
dc.publisher.institutionUniversity of Cambridge
dc.publisher.departmentEngineering Department
dc.date.updated2017-12-03T16:27:57Z
dc.identifier.doi10.17863/CAM.16771
dc.publisher.collegePeterhouse
dc.type.qualificationtitlePhD in Engineering
cam.supervisorParks, Geoffrey Thomas
rioxxterms.freetoread.startdate2100-01-01


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record