Bat Algorithm for Multi-objective Optimisation

Engineering optimization is typically multiobjective and multidisciplinary with complex constraints, and the solution of such complex problems requires efficient optimization algorithms. Recently, Xin-She Yang proposed a bat-inspired algorithm for solving nonlinear, global optimisation problems. In this paper, we extend this algorithm to solve multiobjective optimisation problems. The proposed multiobjective bat algorithm (MOBA) is first validated against a subset of test functions, and then applied to solve multiobjective design problems such as welded beam design. Simulation results suggest that the proposed algorithm works efficiently.Comment: 12 pages. arXiv admin note: text overlap with arXiv:1004.417

Multi-objective design optimisation of a 3D-rail stamping process using a robust multi-objective optimisation platform (RMOP)

The paper investigates the multi-objective design optimisation of a stamping process to control the final shape and the final quality using advanced high strength steels. The design problem of the stamping process is formulated to minimise the difference between the desired shape and the final geometry obtained by numerical simulation accounting elastic springback. In addition, the final product quality is maximised by improving safety zones without wrinkling, thinning, or failure. Numerical results show that the proposed methodology improves the final product quality while reduces its springback.Peer ReviewedPostprint (published version

Bounded Decentralised Coordination over Multiple Objectives

We propose the bounded multi-objective max-sum algorithm (B-MOMS), the first decentralised coordination algorithm for multi-objective optimisation problems. B-MOMS extends the max-sum message-passing algorithm for decentralised coordination to compute bounded approximate solutions to multi-objective decentralised constraint optimisation problems (MO-DCOPs). Specifically, we prove the optimality of B-MOMS in acyclic constraint graphs, and derive problem dependent bounds on its approximation ratio when these graphs contain cycles. Furthermore, we empirically evaluate its performance on a multi-objective extension of the canonical graph colouring problem. In so doing, we demonstrate that, for the settings we consider, the approximation ratio never exceeds 2, and is typically less than 1.5 for less-constrained graphs. Moreover, the runtime required by B-MOMS on the problem instances we considered never exceeds 30 minutes, even for maximally constrained graphs with $100$ agents. Thus, B-MOMS brings the problem of multi-objective optimisation well within the boundaries of the limited capabilities of embedded agents

Multi-objective discrete particle swarm optimisation algorithm for integrated assembly sequence planning and assembly line balancing

In assembly optimisation, assembly sequence planning and assembly line balancing have been extensively studied because both activities are directly linked with assembly efficiency that influences the final assembly costs. Both activities are categorised as NP-hard and usually performed separately. Assembly sequence planning and assembly line balancing optimisation presents a good opportunity to be integrated, considering the benefits such as larger search space that leads to better solution quality, reduces error rate in planning and speeds up time-to-market for a product. In order to optimise an integrated assembly sequence planning and assembly line balancing, this work proposes a multi-objective discrete particle swarm optimisation algorithm that used discrete procedures to update its position and velocity in finding Pareto optimal solution. A computational experiment with 51 test problems at different difficulty levels was used to test the multi-objective discrete particle swarm optimisation performance compared with the existing algorithms. A statistical test of the algorithm performance indicates that the proposed multi-objective discrete particle swarm optimisation algorithm presents significant improvement in terms of the quality of the solution set towards the Pareto optimal set

Population extremal optimisation for discrete multi-objective optimisation problems

The power to solve intractable optimisation problems is often found through population based evolutionary methods. These include, but are not limited to, genetic algorithms, particle swarm optimisation, differential evolution and ant colony optimisation. While showing much promise as an effective optimiser, extremal optimisation uses only a single solution in its canonical form – and there are no standard population mechanics. In this paper, two population models for extremal optimisation are proposed and applied to a multi-objective version of the generalised assignment problem. These models use novel intervention/interaction strategies as well as collective memory in order to allow individual population members to work together. Additionally, a general non-dominated local search algorithm is developed and tested. Overall, the results show that improved attainment surfaces can be produced using population based interactions over not using them. The new EO approach is also shown to be highly competitive with an implementation of NSGA-II.No Full Tex

Multi-objective genetic optimisation for self-organising fuzzy logic control

This is the post-print version of the article. The official published version can be accessed from the link below.A multi-objective genetic algorithm is developed for the purpose of optimizing the rule-base of a Self-Organising Fuzzy Logic Control algorithm (SOFLC). The tuning of the SOFLC optimization is based on selection of the best shaped performance index for modifying the rule-base on-line. A comparative study is conducted between various methods of multi-objective genetic optimisation using the SOFLC algorithm on the muscle relaxant anaesthesia system, which includes a severe non-linearity, varying dynamics and time-delay

Fault detection and diagnosis of a plastic film extrusion process

This paper presents a new approach to the design of a model-based fault detection and diagnosis system for application to a plastic film extrusion process. The design constructs a residual generator via parity relations. A multi-objective optimisation problem must be solved in order for the residual to be sensitive to faults but insensitive to disturbances and modelling errors. In this paper, we exploit a genetic algorithm for solving this multi-objective optimisation problem and the resulting fault detection and diagnosis system is applied to a first-principles model of a plastic film extrusion process. Simulation results demonstrate that various types of faults can be detected and diagnosed successfully

The Analytic Hierarchy Process, Max Algebra and Multi-objective Optimisation

The Analytic Hierarchy Process (AHP) is widely used for decision making involving multiple criteria. Elsner and van den Driessche introduced a max-algebraic approach to the single criterion AHP. We extend this to the multi-criteria AHP, by considering multi-objective generalisations of the single objective optimisation problem solved in these earlier papers. We relate the existence of globally optimal solutions to the commutativity properties of the associated matrices; we relate min-max optimal solutions to the generalised spectral radius; and we prove that Pareto optimal solutions are guaranteed to exist.Comment: 1 figur