Multi-objective optimisation is regarded as one of the most promising ways for dealing with constrained optimisation problems in evolutionary optimisation. This paper presents a theoretical investigation of a multi-objective optimisation evolutionary algorithm for solving the 0-1 knapsack problem. Two initialisation methods are considered in the algorithm: local search initialisation and greedy...

In this paper we focus on randomised evolutionary optimisation. We introduce a general framework for the optimisation of data models, based on the concept of evolution. This evolution is guided by a randomised schema mutator. Although our approach is expressed in terms of database optimisation, our ideas are applicable to other elds of randomised evolutionary optimisation of computer models, es...

In this paper, we present the famous temporal partitioning algorithms that temporally partition a data flow graph on reconfigurable systems. We have classified these algorithms into four classes: 1) whole latency optimisation algorithms; 2) whole communication cost optimisation algorithms; 3) whole area optimisation algorithms; 4) whole latency-communication cost optimisation algorithms. These ...

Online set-point optimisation which cooperates with model predictive control (MPC) and its application to a yeast fermentation process are described. A computationally efficient multilayer control system structure with adaptive steady-state target optimisation (ASSTO) and a suboptimal MPC algorithm are presented in which two neural models of the process are used. For set-point optimisation, a s...

In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...

This research was designed to evaluate and compare the applicability of two different types of irrigation including traditionally (surface irrigation) and simple sub-surface drip irrigation (using pricked-pipe covered with plastic cloth). Two plots containing 39 pistachio trees with 720 m2 area were selected in Rafsanjan, Iran. Both plots were irrigated using exactly the same quantity and quali...

This paper examines clustering in datasets where each record is presented as a curve (trend). Our clustering approach is based on nonsmooth and nonconvex optimisation, namely the clustering problems have been formulated as mathematical programming problems and several optimisation methods from GANSO optimisation library have been applied to solve the problems. The least squares and uniform opti...

A novel implementation of a space-mapping (SM) algorithm for optimisation of microwave structures and devices is described. The algorithm uses two techniques to speed up the SM optimisation process: the evaluation of the fine model is distributed through independent processing of the fine model response corresponding to consecutive frequency samples using a number of CPUs, and the parameter ext...

Software testing is a crucial part of software development. It enables quality assurance, such as correctness, completeness and high reliability of the software systems. Current state-of-the-art software testing techniques employ search-based optimisation methods, such as genetic algorithms to handle the difficult and laborious task of test data generation. Despite their general applicability, ...