Application of a new multi-agent Hybrid Co-evolution based Particle Swarm Optimisation methodology in ship design

In this paper, a multiple objective 'Hybrid Co-evolution based Particle Swarm Optimisation' methodology (HCPSO) is proposed. This methodology is able to handle multiple objective optimisation problems in the area of ship design, where the simultaneous optimisation of several conflicting objectives is considered. The proposed method is a hybrid technique that merges the features of co-evolution and Nash equilibrium with a ε-disturbance technique to eliminate the stagnation. The method also offers a way to identify an efficient set of Pareto (conflicting) designs and to select a preferred solution amongst these designs. The combination of co-evolution approach and Nash-optima contributes to HCPSO by utilising faster search and evolution characteristics. The design search is performed within a multi-agent design framework to facilitate distributed synchronous cooperation. The most widely used test functions from the formal literature of multiple objectives optimisation are utilised to test the HCPSO. In addition, a real case study, the internal subdivision problem of a ROPAX vessel, is provided to exemplify the applicability of the developed method

Enhancing optimization capabilities using the AGILE collaborative MDO framework with application to wing and nacelle design

This paper presents methodological investigations performed in research activities in the field of Multi-disciplinary Design and Optimization (MDO) for overall aircraft design in the EU funded research project AGILE (2015–2018). In the AGILE project a team of 19 industrial, research and academic partners from Europe, Canada and Russia are working together to develop the next generation of MDO environment that targets significant reductions in aircraft development costs and time to market, leading to cheaper and greener aircraft. The paper introduces the AGILE project structure and describes the achievements of the 1st year that led to a reference distributed MDO system. A focus is then made on different novel optimization techniques studied during the 2nd year, all aiming at easing the optimization of complex workflows that are characterized by a high number of discipline interdependencies and a large number of design variables in the context of multi-level processes and multi-partner collaborative engineering projects. Three optimization strategies are introduced and validated for a conventional aircraft. First, a multi-objective technique based on Nash Games and Genetic Algorithm is used on a wing design problem. Then a zoom is made on the nacelle design where a surrogate-based optimizer is used to solve a mono-objective problem. Finally a robust approach is adopted to study the effects of uncertainty in parameters on the nacelle design process. These new capabilities have been integrated in the AGILE collaborative framework that in the future will be used to study and optimize novel unconventional aircraft configurations

Modeling Profit of Sliced 5G Networks for Advanced Network Resource Management and Slice Implementation

The core innovation in future 5G cellular networksnetwork slicing, aims at providing a flexible and efficient framework of network organization and resource management. The revolutionary network architecture based on slices, makes most of the current network cost models obsolete, as they estimate the expenditures in a static manner. In this paper, a novel methodology is proposed, in which a value chain in sliced networks is presented. Based on the proposed value chain, the profits generated by different slices are analyzed, and the task of network resource management is modeled as a multiobjective optimization problem. Setting strong assumptions, this optimization problem is analyzed starting from a simple ideal scenario. By removing the assumptions step-by-step, realistic but complex use cases are approached. Through this progressive analysis, technical challenges in slice implementation and network optimization are investigated under different scenarios. For each challenge, some potentially available solutions are suggested, and likely applications are also discussed

The Kalai-Smorodinski solution for many-objective Bayesian optimization

An ongoing aim of research in multiobjective Bayesian optimization is to extend its applicability to a large number of objectives. While coping with a limited budget of evaluations, recovering the set of optimal compromise solutions generally requires numerous observations and is less interpretable since this set tends to grow larger with the number of objectives. We thus propose to focus on a specific solution originating from game theory, the Kalai-Smorodinsky solution, which possesses attractive properties. In particular, it ensures equal marginal gains over all objectives. We further make it insensitive to a monotonic transformation of the objectives by considering the objectives in the copula space. A novel tailored algorithm is proposed to search for the solution, in the form of a Bayesian optimization algorithm: sequential sampling decisions are made based on acquisition functions that derive from an instrumental Gaussian process prior. Our approach is tested on four problems with respectively four, six, eight, and nine objectives. The method is available in the Rpackage GPGame available on CRAN at https://cran.r-project.org/package=GPGame

Optimization as a design strategy. Considerations based on building simulation-assisted experiments about problem decomposition

In this article the most fundamental decomposition-based optimization method - block coordinate search, based on the sequential decomposition of problems in subproblems - and building performance simulation programs are used to reason about a building design process at micro-urban scale and strategies are defined to make the search more efficient. Cyclic overlapping block coordinate search is here considered in its double nature of optimization method and surrogate model (and metaphore) of a sequential design process. Heuristic indicators apt to support the design of search structures suited to that method are developed from building-simulation-assisted computational experiments, aimed to choose the form and position of a small building in a plot. Those indicators link the sharing of structure between subspaces ("commonality") to recursive recombination, measured as freshness of the search wake and novelty of the search moves. The aim of these indicators is to measure the relative effectiveness of decomposition-based design moves and create efficient block searches. Implications of a possible use of these indicators in genetic algorithms are also highlighted.Comment: 48 pages. 12 figures, 3 table