Skip to main content

Research Repository

Advanced Search

All Outputs (26)

Exploring Problem State Transformations to Enhance Hyper-heuristics for the Job-Shop Scheduling Problem (2020)
Conference Proceeding

This study presents an offline learning Simulated Annealing approach to generate a constructive hyper-heuristic evaluated through training and testing on a set of instances for solving the Job-Shop Scheduling problem. The generated hyperheuristic use... Read More about Exploring Problem State Transformations to Enhance Hyper-heuristics for the Job-Shop Scheduling Problem.

Towards a streamlined stacking sequence optimisation methodology for blended composite aircraft structures (2019)
Conference Proceeding

In order to fully exploit the benefits provided by using composite materials in large scale aerospace structures, more efficient detailed design optimisation techniques need to be developed. In the present work, the optimisation procedure is split up... Read More about Towards a streamlined stacking sequence optimisation methodology for blended composite aircraft structures.

Proposal of a design pattern for embedding the concept of social forces in human centric simulation models (2018)
Conference Proceeding

There exist many papers that explain the social force model and its application for modelling pedestrian dynamics. None of these papers, however, explains how to implement the social force model in order to use it for systems simulation studies. In t... Read More about Proposal of a design pattern for embedding the concept of social forces in human centric simulation models.

An analysis of the Taguchi method for tuning a memetic algorithm with reduced computational time budget (2016)
Conference Proceeding

Determining the best initial parameter values for an algorithm, called parameter tuning, is crucial to obtaining better algorithm performance; however, it is often a time-consuming task and needs to be performed under a restricted computational budge... Read More about An analysis of the Taguchi method for tuning a memetic algorithm with reduced computational time budget.

Automatically designing more general mutation operators of Evolutionary Programming for groups of function classes using a hyper-heuristic (2016)
Conference Proceeding

In this study we use Genetic Programming (GP) as an offline hyper-heuristic to evolve a mutation operator for Evolutionary Programming. This is done using the Gaussian and uniform distributions as the terminal set, and arithmetic operators as the fun... Read More about Automatically designing more general mutation operators of Evolutionary Programming for groups of function classes using a hyper-heuristic.

Toward better build volume packing in additive manufacturing: classification of existing problems and benchmarks (2015)
Conference Proceeding

In many cases, the efficient operation of Additive Manufacturing (AM) technology relies on build volumes being packed effectively. Packing algorithms have been developed in response to this requirement. The configuration of AM build volumes is partic... Read More about Toward better build volume packing in additive manufacturing: classification of existing problems and benchmarks.

A comparison of crossover control mechanisms within single-point selection hyper-heuristics using HyFlex (2015)
Conference Proceeding

Hyper-heuristics are search methodologies which operate at a higher level of abstraction than traditional search and optimisation techniques. Rather than operating on a search space of solutions directly, a hyper-heuristic searches a space of low-lev... Read More about A comparison of crossover control mechanisms within single-point selection hyper-heuristics using HyFlex.