A Modified Indicator-based Evolutionary Algorithm
|
|
- Milton Richards
- 5 years ago
- Views:
Transcription
1 A Modified Indicator-based Evolutionary Algorithm () Wenwen Li, Ender Özcan, Robert John John H. Drake 2, Aneta Neumann 3, Markus Wagner 3 Automated Scheduling, Optimization and Planning (ASAP) University of Nottingham, UK 2 Operational Research Group, Queen Mary University of London, UK 3 School of Computer Science, The University of Adelaide, Australia {wenwen.li, ender.ozcan, robert.john}@nottingham.ac.uk j.drake@qmul.ac.uk {aneta.neumann,markus.wagner}@adelaide.edu.au June 3, 27 Wenwen Li, Ender Özcan, Robert John John H. Drake 2, Aneta Neumann 3, Markus Wagner 3 (ASAP) June 3, 27 /
2 Content Motivation 2 IBEA VS 3 Results Future Work enwen Li, Ender Özcan, Robert John John H. Drake 2, Aneta Neumann 3, Markus Wagner 3 (ASAP) June 3, 27 2 /
3 Motivation DTLZ NSGA-II SMS-EMOA bf:.75 ndi: 979 bf: 5 ndi: 987 bf:.786 ndi: 892 bf: 26 ndi: 97 bf:. ndi: 82 bf:.22 ndi: 73 bf:.2229 ndi: 555 DTLZ2 bf:.9935 ndi: 66 DTLZ3 IBEA bf:.352 ndi: 988 Figure: Non-dominated solutions from NSGA-II, SMS-EMOA and IBEA on DTLZ-3 over runs, except SMS-EMOA runs due to high computation time. 3, Markus Wagner3 (ASAP) Wenwen Li, Ender O zcan, Robert John John H. Drake2, Aneta Neumann June 3, 27 3 /
4 Observations ndi: # of non-dominated individuals. border fraction (bf ): bf = ndi in A border total ndi, A border := {A f θ f 2 θ 2 f 3 θ 3 }. θ = θ 2 = θ 3 =.3 for DTLZ; θ = θ 2 = θ 3 =. for DTLZ2,3 Observations: NSGA-II can cover the whole fronts of all DTLZ-3; 2 SMS-EMOA reaches almost full coverage of the PF for DTLZ, but leaves empty spaces on DTLZ2, 3; 3 IBEA heavily concentrates in corners on DTLZ and DTLZ3, while show clear gaps on DTLZ2; bf IBEA > bf SMS EMOA > bf NSGA II on DTLZ-3; 5 ndi NSGA II ndi IBEA on DTLZ and 3; enwen Li, Ender Özcan, Robert John John H. Drake 2, Aneta Neumann 3, Markus Wagner 3 (ASAP) June 3, 27 /
5 Observations ndi: # of non-dominated individuals. border fraction (bf ): bf = ndi in A border total ndi, A border := {A f θ f 2 θ 2 f 3 θ 3 }. θ = θ 2 = θ 3 =.3 for DTLZ; θ = θ 2 = θ 3 =. for DTLZ2,3 Observations: NSGA-II can cover the whole fronts of all DTLZ-3; 2 SMS-EMOA reaches almost full coverage of the PF for DTLZ, but leaves empty spaces on DTLZ2, 3; 3 IBEA heavily concentrates in corners on DTLZ and DTLZ3, while show clear gaps on DTLZ2; bf IBEA > bf SMS EMOA > bf NSGA II on DTLZ-3; 5 ndi NSGA II ndi IBEA on DTLZ and 3; Question: why does IBEA deteriorate on DTLZ and 3 so severely? Guess: Similar as the hypervolume drops of SMS-EMOA during the search []? [] Judt, L., Mersmann, O., Naujoks, B. (23) Non-monotonicity of Observed Hypervolume in -Greedy S-Metric Selection. Wiley Online Library, enwen Li, Ender Özcan, Robert John John H. Drake 2, Aneta Neumann 3, Markus Wagner 3 (ASAP) June 3, 27 /
6 IBEA VS and IBEA difference: removes dominated solutions before scaling objective values. No new parameters is introduced in. Initialisation; Randomly generate the initial population with population size µ; 2 while (!Stopping Criteria) do 3 Remove dominated solutions using fast non-dominated sorting (NSGA-II); ) rank the solutions in P: Ranking rankedp = new Ranking(P); 2) get the non-dominated solutions: P = rankedp.getsubfront(); Objective values scaling ; ) find the lower (b i = min x Pf i(x)) and upper (b i = max x Pf i(x)) bound of each objective i.; 2) increase the upper bound b i = bi + ρ (b i b i); 3) scale each objective to the interval [ ]; f i = (f i(x) b i)/(b i bi); 5 Fitness assignment (hypervolume difference) using scaled objectives; 6 Environmental Selection (Survival); ) remove the solutions with least hypervolume loss iteratively; 2) update fitness values of all the remaining individuals; 7 Mating Selection; 8 Variation; end Algorithm : Pseudo Code Wenwen Li, Ender Özcan, Robert John John H. Drake 2, Aneta Neumann 3, Markus Wagner 3 (ASAP) June 3, 27 5 /
7 Overall Results With the same default settings as IBEA, DTLZ DTLZ2 DTLZ3 IBEA bf:.9935 ndi: 66 bf:.786 ndi: 892 bf:. ndi: 82 bf: 297 ndi: 989 bf:.78 ndi: 92 bf:.7897 ndi: 5292 Figure: Non-dominated solutions from IBEA and on DTLZ-3. clearly improves the front coverage of IBEA on DTLZ and 3, but not on DTLZ2. (objective values evolving for DTLZ: [, 5] [,], DTLZ2: [2, 5] [,], DTLZ3: [5, 5] [,]) Wenwen Li, Ender Özcan, Robert John John H. Drake 2, Aneta Neumann 3, Markus Wagner 3 (ASAP) June 3, 27 6 /
8 Performance Analysis w.r.t. different scaling factor ρ with population size µ = bf:.9669 ndi: 5 DTLZ3 ρ =.5 IBEA DTLZ ρ =. bf:.987 ndi: 69 DTLZ DTLZ3 bf:.9998 ndi: 5 bf: 297 ndi: 989 bf: 87 ndi: 9597 bf:.7897 ndi: 5292 bf:.972 ndi: 5356 bf:. ndi: 28 bf:.9729 ndi: 9262 bf:. ndi: 82 bf:.876 ndi: 9 bf:.99 ndi: 66 bf:. ndi: 263 ρ = 6. bf:.9935 ndi: 66 bf:. ndi: 25 ρ = 2. bf:.7252 ndi: 5 Figure: Non-dominated solutions of DTLZ and 3 from IBEA and (µ = ). 3, Markus Wagner3 (ASAP) Wenwen Li, Ender O zcan, Robert John John H. Drake2, Aneta Neumann June 3, 27 7 /
9 Performance analysis w.r.t. different scaling factor ρ with population size µ = ρ =.5 bf:.996 ndi: 956 IBEA DTLZ ρ =. bf:.99 ndi: 837 DTLZ3 2 2 bf:.999 ndi: DTLZ bf:.39 ndi: 2 bf: 259 ndi: 976 bf: 367 ndi: 973 bf:.6226 ndi: bf:.685 ndi: 3797 bf:.985 ndi: bf:.872 ndi: 95 6 bf:.9953 ndi: 86 bf:. ndi: bf:.322 ndi: bf:. ndi: 8 8 bf:.999 ndi: ρ = 6. 6 DTLZ3 ρ = 2. bf:.689 ndi: 3956 Figure: Non-dominated solutions of DTLZ and 3 from IBEA and (µ = ). 3, Markus Wagner3 (ASAP) Wenwen Li, Ender O zcan, Robert John John H. Drake2, Aneta Neumann June 3, 27 8 /
10 Performance Statistics and Running Time Comparison Table: Performance Comparison ρ = 2. hypervolume ɛ+ µ = IBEA IBEA DTLZ DTLZ DTLZ DTLZ DTLZ DTLZ DTLZ Table: Running Time Comparison Average Running Time per Run (in minutes) µ = µ = ρ = 2. IBEA IBEA DTLZ DTLZ DTLZ DTLZ DTLZ DTLZ DTLZ Summary: ρ affects significantly, but little impact on IBEA since all the solutions already collapse to the extreme points; µ has little influence on IBEA while solving DTLZ (as all the solutions are located in the border area), but deteriorates on DTLZ3. improves with larger µ. outperforms IBEA on both convergence (hypervolume, ɛ+) and front coverage perspectives. However, doesn t beat NSGA-II on most DTLZ problems. Over 8-fold speed-ups are obtained from comparing with IBEA enwen Li, Ender Özcan, Robert John John H. Drake 2, Aneta Neumann 3, Markus Wagner 3 (ASAP) June 3, 27 9 /
11 Future Work DTLZ DTLZ2 3(.33).36().29(.6).79(.9).3(.7).(.6) DTLZ3.7(.9).(.7).8(.6) Figure: Solution distribution of on DTLZ-3 still have uneven distribution while solving DTLZ and gaps on DTLZ2 and 3 (see above figure). Systematically examine the courses of the gaps of IBEA s solution fronts on DTLZ2 and 3; Combining the investigation of hypervolume drops in SMS-EMOA to see if the gaps are caused by the computation of hypervolume; Improve and SMS-EMOA by redirecting its attention away from extreme points. 3, Markus Wagner3 (ASAP) Wenwen Li, Ender O zcan, Robert John John H. Drake2, Aneta Neumann June 3, 27 /
12 Thank you! Q & A Wenwen Li, Ender Özcan, Robert John John H. Drake 2, Aneta Neumann 3, Markus Wagner 3 (ASAP) June 3, 27 /
Behavior of EMO Algorithms on Many-Objective Optimization Problems with Correlated Objectives
H. Ishibuchi N. Akedo H. Ohyanagi and Y. Nojima Behavior of EMO algorithms on many-objective optimization problems with correlated objectives Proc. of 211 IEEE Congress on Evolutionary Computation pp.
More informationPIBEA: Prospect Indicator Based Evolutionary Algorithm for Multiobjective Optimization Problems
PIBEA: Prospect Indicator Based Evolutionary Algorithm for Multiobjective Optimization Problems Pruet Boonma Department of Computer Engineering Chiang Mai University Chiang Mai, 52, Thailand Email: pruet@eng.cmu.ac.th
More information4 th ECADA Evolutionary Computation for the Automated Design of Algorithms GECCO WORKSHOP 2014
4 th ECADA Evolutionary Computation for the Automated Design of Algorithms GECCO WORKSHOP 2014 John Woodward jrw@cs.stir.ac.uk Jerry Swan jsw@cs.stir.ac.uk Earl Barr E.Barr@ucl.ac.uk Welcome + Outline
More informationEfficient Non-domination Level Update Method for Steady-State Evolutionary Multi-objective. optimization
Efficient Non-domination Level Update Method for Steady-State Evolutionary Multi-objective Optimization Ke Li, Kalyanmoy Deb, Fellow, IEEE, Qingfu Zhang, Senior Member, IEEE, and Qiang Zhang COIN Report
More informationA Non-Parametric Statistical Dominance Operator for Noisy Multiobjective Optimization
A Non-Parametric Statistical Dominance Operator for Noisy Multiobjective Optimization Dung H. Phan and Junichi Suzuki Deptartment of Computer Science University of Massachusetts, Boston, USA {phdung, jxs}@cs.umb.edu
More informationarxiv: v1 [cs.ne] 9 May 2016
Anytime Bi-Objective Optimization with a Hybrid Multi-Objective CMA-ES (HMO-CMA-ES) arxiv:1605.02720v1 [cs.ne] 9 May 2016 ABSTRACT Ilya Loshchilov University of Freiburg Freiburg, Germany ilya.loshchilov@gmail.com
More informationA Reference Vector Guided Evolutionary Algorithm for Many-objective Optimization
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. XX, NO. X, XXXX XXXX A Reference Vector Guided Evolutionary Algorithm for Many-objective Optimization Ran Cheng, Yaochu Jin, Fellow, IEEE, Markus Olhofer
More informationInter-Relationship Based Selection for Decomposition Multiobjective Optimization
Inter-Relationship Based Selection for Decomposition Multiobjective Optimization Ke Li, Sam Kwong, Qingfu Zhang, and Kalyanmoy Deb Department of Electrical and Computer Engineering Michigan State University,
More informationRobust Multi-Objective Optimization in High Dimensional Spaces
Robust Multi-Objective Optimization in High Dimensional Spaces André Sülflow, Nicole Drechsler, and Rolf Drechsler Institute of Computer Science University of Bremen 28359 Bremen, Germany {suelflow,nd,drechsle}@informatik.uni-bremen.de
More informationIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL., NO.,
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI.9/TEVC.6.57, IEEE
More informationMatrix Analysis of Genetic Programming Mutation
See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/255568988 Matrix Analysis of Genetic Programming Mutation Article in Lecture Notes in Computer
More informationAMULTIOBJECTIVE optimization problem (MOP) can
1 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 Letters 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Decomposition-Based Multiobjective Evolutionary Algorithm with an Ensemble of Neighborhood Sizes Shi-Zheng
More informationUniversiteit Leiden Opleiding Informatica
Universiteit Leiden Opleiding Informatica Portfolio Selection from Large Molecular Databases using Genetic Algorithms Name: Studentnr: Alice de Vries 0980013 Date: July 2, 2014 1st supervisor: 2nd supervisor:
More informationIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1. A New Dominance Relation Based Evolutionary Algorithm for Many-Objective Optimization
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 A New Dominance Relation Based Evolutionary Algorithm for Many-Objective Optimization Yuan Yuan, Hua Xu, Bo Wang, and Xin Yao, Fellow, IEEE Abstract Many-objective
More informationMultiobjective Optimisation An Overview
ITNPD8/CSCU9YO Multiobjective Optimisation An Overview Nadarajen Veerapen (nve@cs.stir.ac.uk) University of Stirling Why? Classic optimisation: 1 objective Example: Minimise cost Reality is often more
More informationInnovative Web Tools for User Outreach: ChemWeb.com Alerting Services
Innovative Web Tools for User Outreach: ChemWeb.com Alerting Services Jan Kuras, ChemWeb Inc., 84 Theobalds Road, London WC1X 8RR, UK jan.kuras@chemweb.com Introduction ChemWeb.com aims to maintain a one-stop
More informationForecasting in the presence of recent structural breaks
Forecasting in the presence of recent structural breaks Second International Conference in memory of Carlo Giannini Jana Eklund 1, George Kapetanios 1,2 and Simon Price 1,3 1 Bank of England, 2 Queen Mary
More informationMulti-objective Quadratic Assignment Problem instances generator with a known optimum solution
Multi-objective Quadratic Assignment Problem instances generator with a known optimum solution Mădălina M. Drugan Artificial Intelligence lab, Vrije Universiteit Brussel, Pleinlaan 2, B-1050 Brussels,
More informationDecoding Strategies for the 0/1 Multi-objective Unit Commitment Problem
for the mono-objective UCP Decoding Strategies for the 0/1 Multi-objective Unit Commitment Problem S. Jacquin 1,2 Lucien Mousin 1 I. Machado 3 L. Jourdan 1,2 E.G. Talbi 1,2 1 Inria Lille - Nord Europe,
More informationOn Performance Metrics and Particle Swarm Methods for Dynamic Multiobjective Optimization Problems
On Performance Metrics and Particle Swarm Methods for Dynamic Multiobjective Optimization Problems Xiaodong Li, Jürgen Branke, and Michael Kirley, Member, IEEE Abstract This paper describes two performance
More informationIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. XX, NO.X, XXXX 1
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI.9/TEVC.27.273778,
More informationActivity selection. Goal: Select the largest possible set of nonoverlapping (mutually compatible) activities.
Greedy Algorithm 1 Introduction Similar to dynamic programming. Used for optimization problems. Not always yield an optimal solution. Make choice for the one looks best right now. Make a locally optimal
More informationComputational statistics
Computational statistics Combinatorial optimization Thierry Denœux February 2017 Thierry Denœux Computational statistics February 2017 1 / 37 Combinatorial optimization Assume we seek the maximum of f
More informationFrederick Sander. Variable Grouping Mechanisms and Transfer Strategies in Multi-objective Optimisation
Frederick Sander Variable Grouping Mechanisms and Transfer Strategies in Multi-objective Optimisation Intelligent Cooperative Systems Master Thesis Variable Grouping Mechanisms and Transfer Strategies
More informationOptimization for Machine Learning
Optimization for Machine Learning Elman Mansimov 1 September 24, 2015 1 Modified based on Shenlong Wang s and Jake Snell s tutorials, with additional contents borrowed from Kevin Swersky and Jasper Snoek
More informationCSE101: Design and Analysis of Algorithms. Ragesh Jaiswal, CSE, UCSD
Course Overview Material that will be covered in the course: Basic graph algorithms Algorithm Design Techniques Greedy Algorithms Divide and Conquer Dynamic Programming Network Flows Computational intractability
More informationCovariance Matrix Adaptation in Multiobjective Optimization
Covariance Matrix Adaptation in Multiobjective Optimization Dimo Brockhoff INRIA Lille Nord Europe October 30, 2014 PGMO-COPI 2014, Ecole Polytechnique, France Mastertitelformat Scenario: Multiobjective
More informationEvolutionary Multiobjective. Optimization Methods for the Shape Design of Industrial Electromagnetic Devices. P. Di Barba, University of Pavia, Italy
Evolutionary Multiobjective Optimization Methods for the Shape Design of Industrial Electromagnetic Devices P. Di Barba, University of Pavia, Italy INTRODUCTION Evolutionary Multiobjective Optimization
More informationHypE An algorithm for fast hypervolume-based many-objective optimization
Research Collection Report HypE An algorithm for fast hypervolume-based many-objective optimization Author(s): Bader, Johannes; Zitzler, Eckart Publication Date: 2008 Permanent Link: https://doi.org/0.3929/ethz-a-005703480
More informationIEEE TRANSACTIONS ON CYBERNETICS, VOL. XX, NO. X, XXXX XXXX 1
IEEE TRANSACTIONS ON CYBERNETICS, VOL. XX, NO. X, XXXX XXXX 1 Heterogeneous Ensemble Based Infill Criterion for Evolutionary Multi-objective Optimization of Expensive Problems Dan Guo, Yaochu Jin, Fellow,
More informationDynamic Multiobjectives Optimization With a Changing Number of Objectives. Renzhi Chen, Ke Li, Member, IEEE, and Xin Yao, Fellow, IEEE
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 22, NO. 1, FEBRUARY 2018 157 Dynamic Multiobjectives Optimization With a Changing Number of Objectives Renzhi Chen, Ke Li, Member, IEEE, and Xin Yao,
More informationMultidisciplinary System Design Optimization (MSDO)
Multidisciplinary System Design Optimization (MSDO) Numerical Optimization II Lecture 8 Karen Willcox 1 Massachusetts Institute of Technology - Prof. de Weck and Prof. Willcox Today s Topics Sequential
More informationA Comparison of GAs Penalizing Infeasible Solutions and Repairing Infeasible Solutions on the 0-1 Knapsack Problem
A Comparison of GAs Penalizing Infeasible Solutions and Repairing Infeasible Solutions on the 0-1 Knapsack Problem Jun He 1, Yuren Zhou 2, and Xin Yao 3 1 J. He is with the Department of Computer Science,
More informationCSC 4510 Machine Learning
10: Gene(c Algorithms CSC 4510 Machine Learning Dr. Mary Angela Papalaskari Department of CompuBng Sciences Villanova University Course website: www.csc.villanova.edu/~map/4510/ Slides of this presenta(on
More informationMULTIOBJECTIVE optimization problems (MOPs),
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 18, NO. 6, DECEMBER 2014 909 Stable Matching-Based Selection in Evolutionary Multiobjective Optimization Ke Li, Student Member, IEEE, Qingfu Zhang, Senior
More informationThe OSACA Web Application Ispra, 26/2/2008 1/21
The OSACA Web Application Ispra, 26/2/2008 1/21 Concepts and applications A D(A;) OSACA finalities Ispra, 26/2/2008 2/21 To classify soil observations into soil types (ST) or clusters (soil classification
More informationDivide-Conquer-Glue Algorithms
Divide-Conquer-Glue Algorithms Mergesort and Counting Inversions Tyler Moore CSE 3353, SMU, Dallas, TX Lecture 10 Divide-and-conquer. Divide up problem into several subproblems. Solve each subproblem recursively.
More informationHypervolume Sharpe-Ratio Indicator: Formalization and First Theoretical Results
Hypervolume Sharpe-Ratio Indicator: Formalization and First Theoretical Results Andreia P. Guerreiro and Carlos M. Fonseca CISUC, Department of Informatics Engineering, University of Coimbra Pólo II, Pinhal
More informationNumerical Optimization: Basic Concepts and Algorithms
May 27th 2015 Numerical Optimization: Basic Concepts and Algorithms R. Duvigneau R. Duvigneau - Numerical Optimization: Basic Concepts and Algorithms 1 Outline Some basic concepts in optimization Some
More informationA Novel Multiobjective Formulation of the Robust Software Project Scheduling Problem
A Novel Multiobjective Formulation of the Robust Problem Francisco Chicano, Alejandro Cervantes, Francisco Luna, Gustavo Recio 1 / 30 Software projects usually involve many people and many resources that
More informationReformulating Branch Coverage as a Many-Objective Optimization Problem
Reformulating Branch Coverage as a Many-Objective Optimization Problem Annibale Panichella, Fitsum Meshesha Kifetew, Paolo Tonella Delft University of Technology, The Netherlands Fondazione Bruno Kessler,
More informationInformed Search. Chap. 4. Breadth First. O(Min(N,B L )) BFS. Search. have same cost BIBFS. Bi- Direction. O(Min(N,2B L/2 )) BFS. have same cost UCS
Informed Search Chap. 4 Material in part from http://www.cs.cmu.edu/~awm/tutorials Uninformed Search Complexity N = Total number of states B = Average number of successors (branching factor) L = Length
More informationAnalyses of Guide Update Approaches for Vector Evaluated Particle Swarm Optimisation on Dynamic Multi-Objective Optimisation Problems
WCCI 22 IEEE World Congress on Computational Intelligence June, -5, 22 - Brisbane, Australia IEEE CEC Analyses of Guide Update Approaches for Vector Evaluated Particle Swarm Optimisation on Dynamic Multi-Objective
More informationDon t be greedy when calculating hypervolume contributions
Don t be greedy when calculating hypervolume contributions Karl Bringmann niversität des Saarlandes Postfach 151150 66041 Saarbrücken, Germany Tobias Friedrich International Computer Science Institute
More information13. Nonlinear least squares
L. Vandenberghe ECE133A (Fall 2018) 13. Nonlinear least squares definition and examples derivatives and optimality condition Gauss Newton method Levenberg Marquardt method 13.1 Nonlinear least squares
More informationDivide and Conquer Algorithms
Divide and Conquer Algorithms T. M. Murali February 19, 2013 Divide and Conquer Break up a problem into several parts. Solve each part recursively. Solve base cases by brute force. Efficiently combine
More informationSubmitted by: Ashish Gupta Group 3
Evolutionary Algorithms CS 356N Analysis and Design of Algorithms Third Programming Assignment Submitted by: Ashish Gupta 98131 Group 3 Description This assignment is related to the Darwinian evolutionary
More informationStochastic Analogues to Deterministic Optimizers
Stochastic Analogues to Deterministic Optimizers ISMP 2018 Bordeaux, France Vivak Patel Presented by: Mihai Anitescu July 6, 2018 1 Apology I apologize for not being here to give this talk myself. I injured
More informationThe Pickup and Delivery Problem: a Many-objective Analysis
The Pickup and Delivery Problem: a Many-objective Analysis Abel García-Nájera and Antonio López-Jaimes Universidad Autónoma Metropolitana, Unidad Cuajimalpa, Departamento de Matemáticas Aplicadas y Sistemas,
More informationA SQP type method for constrained multiobjective optimization
A SQP type method for constrained multiobjective optimization Jörg Fliege and A. Ismael F. Vaz May 28, 2015 Abstract We propose an SQP type method for constrained nonlinear multiobjective optimization.
More informationAnytime Planning for Decentralized Multi-Robot Active Information Gathering
Anytime Planning for Decentralized Multi-Robot Active Information Gathering Brent Schlotfeldt 1 Dinesh Thakur 1 Nikolay Atanasov 2 Vijay Kumar 1 George Pappas 1 1 GRASP Laboratory University of Pennsylvania
More informationRuntime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights
Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights Frank Neumann 1 and Andrew M. Sutton 2 1 Optimisation and Logistics, School of Computer Science, The
More informationNSLS-II. Accelerator Physics Group November 11, Lingyun Yang NSLS-II Brookhaven National Laboratory. Multiobjective DA Optimization for
Accelerator Physics Group November 11, 2010 Introduction Brookhaven National Laboratory.1 (21) 1 Introduction Introduction.2 (21) 1 Introduction Introduction 2.2 (21) 1 Introduction Introduction 2 3.2
More informationAn Expansion Method Dealing with Spatial Incompleteness of Measured Mode Shapes of Beam Structures
Appl. Math. Inf. Sci. 8, o. 2, 651-656 (2014) 651 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.12785/amis/080223 An Expansion Method Dealing with Spatial Incompleteness
More informationComputer Method for. Assembly Lines. Lindsay McClintock OPERMGT May 6, 2003
COMSOAL Computer Method for Sequencing Operations for Assembly Lines Lindsay McClintock OPERMGT 345 004 May 6, 2003 Today s Topics Assembly Line Balancing By Hand Overview Example Exercise By Computer
More information4. Fitness landscape analysis for multi-objective optimization problems
4. Fitness landscape analysis for multi-objective optimiation problems Fitness landscape analysis for understanding and designing local search heuristics Sébastien Verel LISIC - Université du Littoral
More informationQuad-trees: A Data Structure for Storing Pareto-sets in Multi-objective Evolutionary Algorithms with Elitism
Quad-trees: A Data Structure for Storing Pareto-sets in Multi-objective Evolutionary Algorithms with Elitism Sanaz Mostaghim 1 and Jürgen Teich 2 1 Electrical Engineering Department University of Paderborn,
More informationAn Analysis on Recombination in Multi-Objective Evolutionary Optimization
An Analysis on Recombination in Multi-Objective Evolutionary Optimization Chao Qian, Yang Yu, Zhi-Hua Zhou National Key Laboratory for Novel Software Technology Nanjing University, Nanjing 20023, China
More informationFuzzy adaptive catfish particle swarm optimization
ORIGINAL RESEARCH Fuzzy adaptive catfish particle swarm optimization Li-Yeh Chuang, Sheng-Wei Tsai, Cheng-Hong Yang. Institute of Biotechnology and Chemical Engineering, I-Shou University, Kaohsiung, Taiwan
More informationAn Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines
1 An Approximate Pareto Set for Minimizing the Maximum Lateness Makespan on Parallel Machines Gais Alhadi 1, Imed Kacem 2, Pierre Laroche 3, Izzeldin M. Osman 4 arxiv:1802.10488v1 [cs.ds] 28 Feb 2018 Abstract
More informationReinforcement Learning
Reinforcement Learning Lecture 6: RL algorithms 2.0 Alexandre Proutiere, Sadegh Talebi, Jungseul Ok KTH, The Royal Institute of Technology Objectives of this lecture Present and analyse two online algorithms
More informationSparse analysis Lecture III: Dictionary geometry and greedy algorithms
Sparse analysis Lecture III: Dictionary geometry and greedy algorithms Anna C. Gilbert Department of Mathematics University of Michigan Intuition from ONB Key step in algorithm: r, ϕ j = x c i ϕ i, ϕ j
More informationBiology as Information Dynamics
Biology as Information Dynamics John Baez Biological Complexity: Can It Be Quantified? Beyond Center February 2, 2017 IT S ALL RELATIVE EVEN INFORMATION! When you learn something, how much information
More informationDétection de sources astrophysiques dans les données du spectrographe intégral de champ MUSE
Détection de sources astrophysiques dans les données du spectrographe intégral de champ MUSE David Mary, André Ferrari and Raja Fazliza R.S. Université de Nice Sophia Antipolis, France Porquerolles, 15
More informationAutomatic Control Systems theory overview (discrete time systems)
Automatic Control Systems theory overview (discrete time systems) Prof. Luca Bascetta (luca.bascetta@polimi.it) Politecnico di Milano Dipartimento di Elettronica, Informazione e Bioingegneria Motivations
More informationWeb Search and Text Mining. Learning from Preference Data
Web Search and Text Mining Learning from Preference Data Outline Two-stage algorithm, learning preference functions, and finding a total order that best agrees with a preference function Learning ranking
More informationPartitioned Methods for Multifield Problems
Partitioned Methods for Multifield Problems Joachim Rang, 10.5.2017 10.5.2017 Joachim Rang Partitioned Methods for Multifield Problems Seite 1 Contents Blockform of linear iteration schemes Examples 10.5.2017
More informationReinforcement Learning: An Introduction
Introduction Betreuer: Freek Stulp Hauptseminar Intelligente Autonome Systeme (WiSe 04/05) Forschungs- und Lehreinheit Informatik IX Technische Universität München November 24, 2004 Introduction What is
More informationRuntime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization Tobias Friedrich 1, Christian Horoba 2, and Frank Neumann 1 1 Max-Planck-Institut für Informatik, Saarbrücken, Germany 2
More informationAnalysis of test-diagnose-fix strategies for complex manufacturing systems
Systems Engineering Group Department of Mechanical Engineering Eindhoven University of Technology PO Box 513 5600 MB Eindhoven The Netherlands http://se.wtb.tue.nl/ SE Report: Nr. 2007-10 Analysis of test-diagnose-fix
More informationDivide and Conquer Algorithms
Divide and Conquer Algorithms T. M. Murali March 17, 2014 Divide and Conquer Break up a problem into several parts. Solve each part recursively. Solve base cases by brute force. Efficiently combine solutions
More informationPerformance Comparison of K-Means and Expectation Maximization with Gaussian Mixture Models for Clustering EE6540 Final Project
Performance Comparison of K-Means and Expectation Maximization with Gaussian Mixture Models for Clustering EE6540 Final Project Devin Cornell & Sushruth Sastry May 2015 1 Abstract In this article, we explore
More informationArticulating User Preferences in Many-Objective Problems by Sampling the Weighted Hypervolume
Articulating User Preferences in Many-Objective Problems by Sampling the Weighted Hypervolume Anne Auger Johannes Bader Dimo Brockhoff Eckart Zitzler TAO Team INRIA Saclay LRI Paris Sud University 91405
More informationDRM Update Joe Liske
DRM Update Joe Liske ETC Update Bug fix in spectroscopic mode: ETC used to calculate S/N per spectral pixel, not per resolution element. Correction and clarification of ETC document. In progress: update
More informationOptimizing Energy Consumption under Flow and Stretch Constraints
Optimizing Energy Consumption under Flow and Stretch Constraints Zhi Zhang, Fei Li Department of Computer Science George Mason University {zzhang8, lifei}@cs.gmu.edu November 17, 2011 Contents 1 Motivation
More informationA Generalized View on Beneficial Task Sortings for Partitioned RMS Task Allocation on Multiprocessors
RTSOPS 2011: 2 nd International Real-Time Scheduling Open Problems Seminar Porto, Portugal, July 5th, 2011 Co-located with ECRTS 2011 A Generalized View on Beneficial Task Sortings for Partitioned Task
More informationEvolutionary Ensemble Strategies for Heuristic Scheduling
0 International Conference on Computational Science and Computational Intelligence Evolutionary Ensemble Strategies for Heuristic Scheduling Thomas Philip Runarsson School of Engineering and Natural Science
More informationPreference-based Reinforcement Learning
Preference-based Reinforcement Learning Róbert Busa-Fekete 1,2, Weiwei Cheng 1, Eyke Hüllermeier 1, Balázs Szörényi 2,3, Paul Weng 3 1 Computational Intelligence Group, Philipps-Universität Marburg 2 Research
More informationLecture: Local Spectral Methods (2 of 4) 19 Computing spectral ranking with the push procedure
Stat260/CS294: Spectral Graph Methods Lecture 19-04/02/2015 Lecture: Local Spectral Methods (2 of 4) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough. They provide
More informationAn Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse
An Adaptive Partition-based Approach for Solving Two-stage Stochastic Programs with Fixed Recourse Yongjia Song, James Luedtke Virginia Commonwealth University, Richmond, VA, ysong3@vcu.edu University
More informationTowards stability and optimality in stochastic gradient descent
Towards stability and optimality in stochastic gradient descent Panos Toulis, Dustin Tran and Edoardo M. Airoldi August 26, 2016 Discussion by Ikenna Odinaka Duke University Outline Introduction 1 Introduction
More informationLocal Search & Optimization
Local Search & Optimization CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2017 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 4 Outline
More informationFixed-Point Iteration
Fixed-Point Iteration MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Motivation Several root-finding algorithms operate by repeatedly evaluating a function until its
More informationCMPUT651: Differential Privacy
CMPUT65: Differential Privacy Homework assignment # 2 Due date: Apr. 3rd, 208 Discussion and the exchange of ideas are essential to doing academic work. For assignments in this course, you are encouraged
More informationEnergy-aware scheduling for GreenIT in large-scale distributed systems
Energy-aware scheduling for GreenIT in large-scale distributed systems 1 PASCAL BOUVRY UNIVERSITY OF LUXEMBOURG GreenIT CORE/FNR project Context and Motivation Outline 2 Problem Description Proposed Solution
More informationMulti-relay selection schemes based on evolutionary algorithm in cooperative relay networks
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS Int. J. Commun. Syst. 214; 27:571 591 Published online 3 December 213 in Wiley Online Library (wileyonlinelibrary.com)..271 Multi-relay selection schemes
More informationMachine Learning. Regularization and Feature Selection. Fabio Vandin November 13, 2017
Machine Learning Regularization and Feature Selection Fabio Vandin November 13, 2017 1 Learning Model A: learning algorithm for a machine learning task S: m i.i.d. pairs z i = (x i, y i ), i = 1,..., m,
More informationA new algorithm for deriving optimal designs
A new algorithm for deriving optimal designs Stefanie Biedermann, University of Southampton, UK Joint work with Min Yang, University of Illinois at Chicago 18 October 2012, DAE, University of Georgia,
More informationSupplementary Technical Details and Results
Supplementary Technical Details and Results April 6, 2016 1 Introduction This document provides additional details to augment the paper Efficient Calibration Techniques for Large-scale Traffic Simulators.
More informationVariable Selection in Data Mining Project
Variable Selection Variable Selection in Data Mining Project Gilles Godbout IFT 6266 - Algorithmes d Apprentissage Session Project Dept. Informatique et Recherche Opérationnelle Université de Montréal
More informationPerformance Assessment of Generalized Differential Evolution 3 with a Given Set of Constrained Multi-Objective Test Problems
Performance Assessment of Generalized Differential Evolution 3 with a Given Set of Constrained Multi-Objective Test Problems Saku Kukkonen, Student Member, IEEE and Jouni Lampinen Abstract This paper presents
More informationCMPS 6630: Introduction to Computational Biology and Bioinformatics. Structure Comparison
CMPS 6630: Introduction to Computational Biology and Bioinformatics Structure Comparison Protein Structure Comparison Motivation Understand sequence and structure variability Understand Domain architecture
More informationAnt Colony Optimization for Multi-objective Optimization Problems
Ant Colony Optimization for Multi-objective Optimization Problems Inès Alaya 1,2, Christine Solnon 1, and Khaled Ghédira 2 1 LIRIS, UMR 5205 CNRS / University of Lyon 2 SOIE ICTAI 2007 Multi-objective
More informationSingle Machine Models
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 8 Single Machine Models 1. Dispatching Rules 2. Single Machine Models Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Dispatching
More informationReduction of Random Variables in Structural Reliability Analysis
Reduction of Random Variables in Structural Reliability Analysis S. Adhikari and R. S. Langley Department of Engineering University of Cambridge Trumpington Street Cambridge CB2 1PZ (U.K.) February 21,
More informationApproximation Algorithms (Load Balancing)
July 6, 204 Problem Definition : We are given a set of n jobs {J, J 2,..., J n }. Each job J i has a processing time t i 0. We are given m identical machines. Problem Definition : We are given a set of
More informationProbabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms
Probabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms François Caron Department of Statistics, Oxford STATLEARN 2014, Paris April 7, 2014 Joint work with Adrien Todeschini,
More informationA Tighter Analysis of Work Stealing
A Tighter Analysis of Work Stealing Marc Tchiboukdjian Nicolas Gast Denis Trystram Jean-Louis Roch Julien Bernard Laboratoire d Informatique de Grenoble INRIA Marc Tchiboukdjian A Tighter Analysis of Work
More informationTUTORIAL: HYPER-HEURISTICS AND COMPUTATIONAL INTELLIGENCE
TUTORIAL: HYPER-HEURISTICS AND COMPUTATIONAL INTELLIGENCE Nelishia Pillay School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal South Africa TUTORIAL WEBSITE URL: http://titancs.ukzn.ac.za/ssci2015tutorial.aspx
More informationOutline. Binomial, Multinomial, Normal, Beta, Dirichlet. Posterior mean, MAP, credible interval, posterior distribution
Outline A short review on Bayesian analysis. Binomial, Multinomial, Normal, Beta, Dirichlet Posterior mean, MAP, credible interval, posterior distribution Gibbs sampling Revisit the Gaussian mixture model
More information