A computational intelligence approach to systemof-systems. optimization

Similar documents
Evolutionary Approaches for Resilient Surveillance Management. Ruidan Li and Errin W. Fulp. U N I V E R S I T Y Department of Computer Science

BI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR FLEXIBLE JOB-SHOP SCHEDULING PROBLEM. Minimizing Make Span and the Total Workload of Machines

Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems

Evolutionary Algorithm for Embedded System Topology Optimization. Supervisor: Prof. Dr. Martin Radetzki Author: Haowei Wang

MODELLING DOCUMENT CATEGORIES BY EVOLUTIONARY LEARNING OF TEXT CENTROIDS

Multicriterial Optimization Using Genetic Algorithm

Design Space Exploration

The k-means Algorithm and Genetic Algorithm

INTERACTIVE MULTI-OBJECTIVE GENETIC ALGORITHMS FOR THE BUS DRIVER SCHEDULING PROBLEM

Multi-objective Optimization

Comparison of Evolutionary Multiobjective Optimization with Reference Solution-Based Single-Objective Approach

Using Genetic Algorithms to Solve the Box Stacking Problem

Unsupervised Feature Selection Using Multi-Objective Genetic Algorithms for Handwritten Word Recognition

Handling Constraints in Multi-Objective GA for Embedded System Design

An Evolutionary Algorithm Approach to Generate Distinct Sets of Non-Dominated Solutions for Wicked Problems

Incorporation of Scalarizing Fitness Functions into Evolutionary Multiobjective Optimization Algorithms

Dimensionality Reduction in Multiobjective Optimization: The Minimum Objective Subset Problem

CHAPTER 1 INTRODUCTION

The Genetic Algorithm for finding the maxima of single-variable functions

Attribute Selection with a Multiobjective Genetic Algorithm

REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN

Design of an Optimal Nearest Neighbor Classifier Using an Intelligent Genetic Algorithm

System of Systems Architecture Generation and Evaluation using Evolutionary Algorithms

Optimization with Multiple Objectives

Regression Test Case Prioritization using Genetic Algorithm

CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN

Design of Nearest Neighbor Classifiers Using an Intelligent Multi-objective Evolutionary Algorithm

Heuristic Optimisation

Multiobjective Job-Shop Scheduling With Genetic Algorithms Using a New Representation and Standard Uniform Crossover

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM

ND-Tree: a Fast Online Algorithm for Updating the Pareto Archive

Improving interpretability in approximative fuzzy models via multi-objective evolutionary algorithms.

WORKFLOW ENGINE FOR CLOUDS

A genetic algorithms approach to optimization parameter space of Geant-V prototype

Multi-objective construction of an entire adequate test suite for an EFSM

CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS

Multiobjective Optimization for the Stochastic Physical Search Problem

NODE PLACEMENT FOR A WIRELESS SENSOR NETWORK USING A MULTIOBJECTIVE GENETIC ALGORITHM

Fast Efficient Clustering Algorithm for Balanced Data

An Evolutionary Algorithm for the Multi-objective Shortest Path Problem

Time Complexity Analysis of the Genetic Algorithm Clustering Method

Global Optimization of a Magnetic Lattice using Genetic Algorithms

Submit: Your group source code to mooshak

5 Machine Learning Abstractions and Numerical Optimization

A Fitness Function to Find Feasible Sequences of Method Calls for Evolutionary Testing of Object-Oriented Programs

Ajay Sharma Gaurav Kapur VK Kaushik LC Mangal RC Agarwal. Defence Electronics Applications Laboratory, Dehradun DRDO, India

Hierarchical Clustering of Evolutionary Multiobjective Programming Results to Inform Land Use Planning

FPBH.jl: A Feasibility Pump Based Heuristic for Multi-objective Mixed Integer Linear Programming in Julia

Comparison of TSP Algorithms

Multi-objective Optimization

University of Florida CISE department Gator Engineering. Clustering Part 2

GENETIC ALGORITHM METHOD FOR COMPUTER AIDED QUALITY CONTROL

Evolutionary multi-objective algorithm design issues

Genetic-Algorithm-Based Construction of Load-Balanced CDSs in Wireless Sensor Networks

Lecture

Multiobjective Formulations of Fuzzy Rule-Based Classification System Design

MULTI-OBJECTIVE GENETIC LOCAL SEARCH ALGORITHM FOR SUPPLY CHAIN SIMULATION OPTIMISATION

Evolutionary Algorithms: Lecture 4. Department of Cybernetics, CTU Prague.

Discovering Knowledge Rules with Multi-Objective Evolutionary Computing

Combinational Circuit Design Using Genetic Algorithms

Application of a Genetic Algorithm to a Scheduling Assignement Problem

GECCO 2007 Tutorial / Evolutionary Multiobjective Optimization. Eckart Zitzler ETH Zürich. weight = 750g profit = 5.

Multiobjectivization with NSGA-II on the Noiseless BBOB Testbed

CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES

Development of Evolutionary Multi-Objective Optimization

Finding Sets of Non-Dominated Solutions with High Spread and Well-Balanced Distribution using Generalized Strength Pareto Evolutionary Algorithm

A New Efficient and Useful Robust Optimization Approach Design for Multi-Objective Six Sigma

Modified K-Means Algorithm for Genetic Clustering

Introduction to Optimization

Lamarckian Repair and Darwinian Repair in EMO Algorithms for Multiobjective 0/1 Knapsack Problems

NCGA : Neighborhood Cultivation Genetic Algorithm for Multi-Objective Optimization Problems

A Distance Metric for Evolutionary Many-Objective Optimization Algorithms Using User-Preferences

Introduction to Optimization

ELEC-270 Solutions to Assignment 5

A Search Method with User s Preference Direction using Reference Lines

Desicion Making in Multi-Objective Optimization for Industrial Applications - Data Mining and Visualization of Pareto Data

A Domain-Specific Crossover and a Helper Objective for Generating Minimum Weight Compliant Mechanisms

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science

Multi-objective Evolutionary Design of Fuzzy Autopilot Controller

Hybrid Flowshop Scheduling Using Discrete Harmony Search And Genetic Algorithm

Coalition formation in multi-agent systems an evolutionary approach

Program Testing and Analysis: Manual Testing Prof. Dr. Michael Pradel Software Lab, TU Darmstadt

Fall 09, Homework 5

Genetic Algorithm Applied to Multi-Agent War Gaming Simulation

Exploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search

Genetic Programming. Charles Chilaka. Department of Computational Science Memorial University of Newfoundland

International Journal of Current Research and Modern Education (IJCRME) ISSN (Online): & Impact Factor: Special Issue, NCFTCCPS -

Accommodating Bursts in Distributed Stream Processing Systems

Fuzzy multi objective transportation problem evolutionary algorithm approach

Computational Financial Modeling

Bio-inspired Optimization and Design

CS Introduction to Data Mining Instructor: Abdullah Mueen

Initial Population Construction for Convergence Improvement of MOEAs

ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS

CHAPTER 5 STRUCTURAL OPTIMIZATION OF SWITCHED RELUCTANCE MACHINE

Evolutionary algorithms in communications

AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING

Semantics via Syntax. f (4) = if define f (x) =2 x + 55.

Software Architecture

Evolutionary Multi-objective Optimization of Business Process Designs with Pre-processing

Transcription:

SoS Optimization A computational intelligence approach to systemof-systems architecting incorporating multiobjective optimization

MOTIVATION > To better understand the role of multi-objective optimization in system-of-systems architecting: How can large solution sets produced by multi-objective optimization be understood by decision makers? What are the trade-offs in employing dimensionality-reduction?

ARCHITECTING > Architecting seeks not only to meet a customer need, but to meet it as best possible by maximizing a set of key performance measures that assess the goodness of the architecture.

OPTIMIZATION > Since the architect seeks to maximize a set of KPMs, optimization is obviously desirable. However, there are two immediate problems to address: Is it possible to model architectures such that the KPMs can be usefully estimated? Because of the multi-objective nature of architecting, can large optimal solution sets be understood by an architect? If not, is reducing dimensionality useful?

SoS MODEL > The SoS may be modeled as a set of systems and interfaces: Systems can either participate in the SoS or not. Interfaces can be specified between systems or nor. Systems are modeled by: > Characteristics Real-valued attributes such as cost and development time, > Capabilities Boolean values indicating whether a particular capability is provided by the system, and > Interface feasibility Boolean-values indicating whether an interface is possible between two systems.

MULTI-OBJECTIVE OPTIMIZATION > Multi-objective optimization usually depends upon Pareto dominance to compare solutions. When the number of objectives is larger than three (the typical case for architecting), Pareto dominance breaks down and the optimal solution set (the Pareto set) contains a significant portion of the total solution space. This creates a comprehensibility problem for the architect. While there is a class of optimizers specifically designed to address algorithmic issues regarding Pareto break-down, the large solution set remains.

COMPREHENSIBILITY > Two basic approaches for addressing the size of the Pareto set: Reduce the Pareto set Retain solutions of interest. Eliminate the Pareto set Reduce the problem to a single objective that is a function of the original objectives.

REDUCED PARETO SET > Two possible approaches to reducing the Pareto set are clustering (stochastic) and corners (deterministic). > The approach taken here involves corners.

CORNERS > Given m objectives, if k < m objectives are considered at a time within the Pareto set, then the dominate solutions are called corners. All corners in the results used k = 1.

CORNER APPROACH > The corners can be combined with an interior point for each combination of corners in two-dimensional space to show the operation of the trade-space within the Pareto set. Corner Non-dominated set Best approximation of true Pareto set f 2 Ideal Corner Nearest ideal f 1

SINGLE OBJECTIVE > Given a set of objectives O 1, O 2,, O m, define a function f(o 1, O 2,, O m ): R m R, to be the overall objective. In the example problem, the function chosen was a fuzzy inference system.

EXAMPLE PROBLEM > The example is a notional Intelligence, Surveillance, and Reconnaissance (ISR) problem. The decision maker must choose a total of twenty systems selected from five different platforms to maximize the performance in terms of coverage and resilience and to minimize the cost. Therefore, there are three objectives: cost, coverage, and resilience. > The five available platforms are: satellite type 1, satellite type 2, UAV type 1, UAV type 2, and UAV type 3.

OPERATIONAL VIEW OV-1

SYSTEM CHARACTERISTICS > Overall cost and coverage are the sums of the individual systems values. Resilience is calculated using Functional Dependency Network Analysis (FDNA). System Cost Coverage Satellite type 1 90 80 Satellite type 2 100 90 Satellite type 3 100 100 UAV type 1 5 10 UAV type 2 10 20

OPTIMIZATION APPROACH > The corner approach used a plain multi-objective evolutionary algorithm with single-point crossover and bitflip mutation. > The single-objective approach similiarly used a plain singleobjective evolutionary algorithm with single-point crossover and bit-flip mutation.

CHROMOSOME Gene 1 Gene 2 Gene n b 1 b 2 b x1 b 1 b 2 b x2 b 1 b 2 b xn Chromosome Each gene uses three bits to represent the system type: System 1 System 2 System 20 b 1 b 2 b 3 b 1 b 2 b 3 b 1 b 2 b 3 Chromosome / Meta-Architecture

Resilience RESULTS PARETO SET Corners Nearest Ideal Ideal

Resilience RESULTS CORNERS Coverage Corner Nearest Ideal Resilience Corner Cost Corner

ANALYSIS CORNERS > The different colors on the preceding lollipop graph represent different runs. From this, it can be seen that: The cost of the SoS is not sensitive within the Pareto set, resilience is moderately so, and coverage is highly sensitive. There is much more leeway regarding coverage, less with resilience, and very little with cost.

Resilience RESULTS SOP SOP w/fuzzy Assessor

ANALYSIS SOP > Comparing the single-objective solutions over numerous runs with the black lollipops showing the results from the corner approach, it can be seen that: The single-objective solutions are very consistent and near the middle of the Pareto set. By itself, it yields reasonable solutions, but they do not make anything known of the trade-space within the Pareto set.

Conclusion > Despite the comprehensibility problem imposed by the multi-objective approach, it has the benefit of defining the trade-space within the optimal solution. However, to understand the trade-space an additional approach must by applied to make it comprehensible to the architect. > While the single-objective approach provides no insight into the optimal trade-space, it can be very effective at providing an optimal solution without any extra work imposed upon the architect.

FUTURE WORK > A major deficiency of the given approaches is that neither allows the architect to explore the trade-space in terms of the actual architecture. To address this, an interactive tool called SoS Explorer is in development that would create optimal solutions that the architect can interact with and perform what-if analysis.

SoS EXPLORER