Multi-objective optimisation of sewer maintenance scheduling

This is the final version. Available on open access from IWA Publishing via the DOI in this recordData availability statement: Data cannot be made publicly available; readers should contact the corresponding author for details.Effective functioning of sewer systems is critical for the everyday life of people in the urban environment. This is achieved, among other things, by the means of regular, planned maintenance of these systems. A large water utility would normally have several maintenance teams (or crews) at their disposal who can perform related jobs at different locations in the company area and with different levels of priority. This paper presents a new methodology for the optimisation of related maintenance schedules resulting in clear prioritisation of the ordering of maintenance tasks for crews. The scheduling problem is formulated as a multi-objective optimisation problem with the following three objectives, namely the minimisation of the total maintenance cost, the minimisation of travel times of maintenance teams and the maximisation of the job's priority score, all over a pre-defined scheduling horizon. The optimisation problem is solved using the Nondominated Sorting Genetic Algorithm-II (NSGA-II) optimisation method. The results obtained from a real-life UK case study demonstrate that the new methodology can determine optimal, low-cost maintenance schedules in a computationally efficient manner when compared to the corresponding existing company schedules. Daily productivity of maintenance teams in terms of number of jobs completed improved by 26% when the methodology was applied to scheduling in the case study. Given this, the method has the potential to be applied within water utilities and the water utility Welsh Water (Dŵr Cymru Welsh Water (DCWW)) is currently implementing it into their systems.Engineering and Physical Sciences Research Council (EPSRC

Ensemble learning using multi-objective optimisation for arabic handwritten words

Arabic handwriting recognition is a dynamic and stimulating field of study within pattern recognition. This system plays quite a significant part in today's global environment. It is a widespread and computationally costly function due to cursive writing, a massive number of words, and writing style. Based on the literature, the existing features lack data supportive techniques and building geometric features. Most ensemble learning approaches are based on the assumption of linear combination, which is not valid due to differences in data types. Also, the existing approaches of classifier generation do not support decision-making for selecting the most suitable classifier, and it requires enabling multi-objective optimisation to handle these differences in data types. In this thesis, new type of feature for handwriting using Segments Interpolation (SI) to find the best fitting line in each of the windows with a model for finding the best operating point window size for SI features. Multi-Objective Ensemble Oriented (MOEO) formulated to control the classifier topology and provide feedback support for changing the classifiers' topology and weights based on the extension of Non-dominated Sorting Genetic Algorithm (NSGA-II). It is designated as the Random Subset based Parents Selection (RSPS-NSGA-II) to handle neurons and accuracy. Evaluation metrics from two perspectives classification and Multiobjective optimization. The experimental design based on two subsets of the IFN/ENIT database. The first one consists of 10 classes (C10) and 22 classes (C22). The features were tested with Support Vector Machine (SVM) and Extreme Learning Machine (ELM). This work improved due to the SI feature. SI shows a significant result with SVM with 88.53% for C22. RSPS for C10 at k=2 achieved 91% accuracy with fewer neurons than NSGA-II, and for C22 at k=10, accuracy has been increased 81% compared to NSGA-II 78%. Future work may consider introducing more features to the system, applying them to other languages, and integrating it with sequence learning for more accuracy

Achievement scalarizing function sorting for strength Pareto evolutionary algorithm in many-objective optimization

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Multi-objective evolutionary algorithms (MOEAs) have proven their effectiveness in solving two or three objective problems. However, recent research shows that Pareto-based MOEAs encounter selection difficulties facing many similar non-dominated solutions in dealing with many-objective problems. In order to reduce the selection pressure and improve the diversity, we propose achievement scalarizing function sorting strategy to make strength Pareto evolutionary algorithm suitable for many-objective optimization. In the proposed algorithm, we adopt density estimation strategy to redefine a new fitness value of a solution, which can select solution with good convergence and distribution. In addition, a clustering method is used to classify the non-dominated solutions, and then, an achievement scalarizing function ranking method is designed to layer different frontiers and eliminate redundant solutions in the environment selection stage, thus ensuring the convergence and diversity of non-dominant solutions. The performance of the proposed algorithm is validated and compared with some state-of-the-art algorithms on a number of test problems with 3, 5, 8, 10 objectives. Experimental studies demonstrate that the proposed algorithm shows very competitive performance

A new decomposition-based NSGA-II for many-objective optimization

Multiobjective evolutionary algorithms (MOEAs) have proven their effectiveness and efficiency in solving problems with two or three objectives. However, recent studies show that MOEAs face many difficulties when tackling problems involving a larger number of objectives as their behavior becomes similar to a random walk in the search space since most individuals are nondominated with respect to each other. Motivated by the interesting results of decomposition-based approaches and preference-based ones, we propose in this paper a new decomposition-based dominance relation to deal with many-objective optimization problems and a new diversity factor based on the penalty-based boundary intersection method. Our reference point-based dominance (RP-dominance), has the ability to create a strict partial order on the set of nondominated solutions using a set of well-distributed reference points. The RP-dominance is subsequently used to substitute the Pareto dominance in nondominated sorting genetic algorithm-II (NSGA-II). The augmented MOEA, labeled as RP-dominance-based NSGA-II, has been statistically demonstrated to provide competitive and oftentimes better results when compared against four recently proposed decomposition-based MOEAs on commonly-used benchmark problems involving up to 20 objectives. In addition, the efficacy of the algorithm on a realistic water management problem is showcased

Performance assessment and optimisation of a novel guideless irregular dew point cooler using artificial intelligence

Air Conditioners (ACs) are a vital need in modern buildings to provide comfortable indoor air for the occupants. Several alternatives for the traditional coolers are introduced to improve the cooling efficiency but among them, Evaporative Coolers (ECs) absorbed more attention owing to their intelligible structure and high efficiency. ECs are categorized into two types, i.e., Direct Evaporative Coolers (DECs) and Indirect Evaporative Coolers (IECs). Continuous endeavours in the improvement of the ECs resulted in development of Dew Point Coolers (DPCs) which enable the supply air to reach the dew point temperature. The main innovation of DPCs relies on invention of a M-cycle Heat and Mass Exchanger (HMX) which contributes towards improvement of the ECs’ efficiency by up to 30%. A state-of-the-art counter flow DPC in which the flat plates in traditional HMXs are replaced by the corrugated plates is called Guideless Irregular DPC (GIDPC). This technology has 30-60% more cooling efficiency compared to the flat plate HMX in traditional DPCs.Owing to the empirical success of the Artificial Intelligence (AI) in different fields and enhanced importance of Machine Learning (ML) models, this study pioneers in developing two ML models using Multiple Polynomial Regression (MPR), and Deep Neural Network (DNN) methods, and three Multi Objective Evolutionary Optimisation (MOEO) models using Genetic Algorithms (GA), Particle Swarm Optimisation (PSO), and a novel bio-inspired algorithm, i.e., Slime Mould Algorithm (SMA), for the performance prediction and optimisation of the GIDPC in all possible operating climates. Furthermore, this study pioneers in developing an explainable and interpretable DNN model for the GIDPC. To this end, a game theory-based SHapley Additive exPlanations (SHAP) method is used to interpret contribution of the operating conditions on performance parameters.The ML models, take the intake air characteristic as well as main operating and design parameters of the HMX as inputs of the ML models to predict the GIDPC’s performance parameters, e.g., cooling capacity, coefficient of performance (COP), thermal efficiencies. The results revealed that both models have high prediction accuracies where MPR performs with a maximum average error of 1.22%. In addition, the Mean Square Error (MSE) of the selected DNN model is only 0.04. The objectives of the MOEO models are to simultaneously maximise the cooling efficiency and minimise the construction cost of the GIDPC by determining the optimum values of the selected decision variables.The performance of the optimised GIDPCs is compared in a deterministic way in which the comparisons are carried out in diverse climates in 2020 and 2050 in which the hourly future weather data are projected using a high-emission scenario defined by Intergovernmental Panel for Climate Change (IPCC). The results revealed that the hourly COP of the optimised systems outperforms the base design. Moreover, although power consumption of all systems increases from 2020 to 2050, owing to more operating hours as a result of global warming, but power savings of up to 72%, 69.49%, 63.24%, and 69.21% in hot summer continental, arid, tropical rainforest and Mediterranean hot summer climates respectively, can be achieved compared to the base system when the systems run optimally

Multimodal series elastic actuator for human-machine interaction with applications in robot-aided rehabilitation

Series elastic actuators (SEAs) are becoming an elemental building block in collaborative robotic systems. They introduce an elastic element between the mechanical drive and the end-effector, making otherwise rigid structures compliant when in contact with humans. Topologically, SEAs are more amenable to accurate force control than classical actuation techniques, as the elastic element may be used to provide a direct force estimate. The compliant nature of SEAs provides the potential to be applied in robot-aided rehabilitation. This thesis proposes the design of a novel SEA to be used in robot-aided musculoskeletal rehabilitation. An active disturbance rejection controller is derived and experimentally validated and multiobjective optimization is executed to tune the controller for best performance in human-machine interaction. This thesis also evaluates the constrained workspaces for individuals experiencing upper-limb musculoskeletal disorders. This evaluation can be used as a tool to determine the kinematic structure of devices centred around the novel SEA

Effective and Efficient Evolutionary Many-Objective Optimization

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonMany-objective optimization is core to both artificial intelligence and data analytics as real-world problems commonly involve multiple objectives which are required to be optimized simultaneously. A large number of evolutionary algorithms have been developed to search for a set of Pareto optimal solutions for many-objective optimization problems. It is very rare that a many-objective evolutionary algorithm performs well in terms of both effectiveness and efficiency, two key evaluation criteria. Some algorithms may struggle to guide the solutions towards the Pareto front, e.g., Pareto-based algorithms, while other algorithms may have difficulty in diversifying the solutions evenly over the front on certain problems, e.g., decomposition-based algorithms. Furthermore, some effective algorithms may become very computationally expensive as the number of objectives increases, e.g., indicator-based algorithms. The aim of this thesis is to investigate how to make evolutionary algorithms perform well in terms of effectiveness and efficiency in many-objective optimization. After conducting a review of key concepts and the state of the art in the evolutionary many-objective optimization, this thesis shows how to improve the effectiveness of conventional Pareto-based algorithms on a challenging real-world problem in software engineering. This thesis then explores how to further enhance the effectiveness of leading many-objective evolutionary algorithms in general by extending the capability of a very popular and widely cited bi-goal evolution method. Last but not least, this thesis investigates how to strike a balance between effectiveness and efficiency of evolutionary algorithms when solving many-objective optimization problems. The work reported is based on either real-world or recognized synthetic datasets, and the proposed algorithms are compared and evaluated against leading algorithms in the field. The work does not only demonstrate ways of improving the effectiveness and efficiency of many-objective optimization algorithms but also led to promising areas for future research