We study the solution of non-convex, pessimistic bi-level problems. After providing several motivating examples, we relate the problem to existing research in optimisation. We analyse key properties of the optimisation problem, such as closedness of the feasible region and computational complexity. We then present and investigate a semiinfinite solution approach that solves ǫ-approximations of ...

Tug fleet optimisation algorithms can be designed to solve the problem of dynamically positioning a fleet of tugs in order to mitigate the risk of oil tanker drifting accidents. In this paper, we define the tug fleet optimisation problem and present the details of a receding horizon genetic algorithm for solving it. The algorithm can be configured with a set of cost functions such that each con...

The visual impact of wind farm layouts has seen little consideration in the literature on the wind farm layout optimisation problem to date. Most existing algorithms focus on optimising layouts for power or the cost of energy alone. In this paper, we consider the geometry of wind farm layouts and whether it is possible to bi-optimise a layout for both energy efficiency and the degree of visual ...

This paper discusses one solution technique for an optimisation problem involving nonuniform linear array (NLA) geometry. This NLA design problem seeks an optimal geometry from the class of fully-augmentable arrays (ie. those with a complete set of intersensor differences) created to support the generalised spatial smoothing (GSS) algorithm, whose aim is to resolve the directions-of-arrival (DO...

In many areas of design search and optimisation one needs to utilize Computational Fluid Dynamics (CFD) methods in order to obtain numerical solution of the flow field in and/or around a proposed design. From this solution measures of quality for the design may be calculated, which are required by optimisation methods. In large models the processing time for the CFD computations can very well b...

Ultrasonic arrays are now used routinely for the inspection of engineering structures in order to maintain their integrity and assess their performance. Such inspections are usually optimised manually using empirical measurements and parametric studies which are laborious, time-consuming, and may not result in an optimal approach. In this paper, a general framework for the optimisation of ultra...

The bin packing problem is a classic combinatorial optimisation that widely used in various applications such as assembly line balancing, scheduling, and time-tabling. Metaheuristic algorithms can provide solutions to these problems faster than exact methods. Bees Algorithm, metaheuristic algorithm inspired by the foraging activity of bees, known for its performance solving problems. To our bes...

Network planning in wireless communication systems, which has strong impacts on the system performance, is a complex and challenging issue. This paper investigates the network planning problem under high-speed railway communication scenarios. A system model is characterised in terms of distributed antenna technology. An optimisation problem is formulated to optimise the total system cost with t...

Most real world engineering design optimisation approaches reported in the literature aim to find the best set of solutions using computationally expensive quantitative (Q) models without considering the related qualitative (Q) effect of the design problem simultaneously. Although the Q models provide various detailed information about the design problem, unfortunately, these approaches can res...