Multi-Objective Optimization with Genetic Algorithms: A Comprehensive Literature Review, Slides of Applications of Computer Sciences

An in-depth literature review on multi-objective optimization problems and the application of genetic algorithms to find optimal solutions. It covers the differences between single-objective and multi-objective optimization, the advantages and working of genetic algorithms, various techniques for multi-objective evolutionary algorithms (moeas), and performance metrics and benchmark test problems.

Typology: Slides

2011/2012

Uploaded on 07/16/2012

samderiya
samderiya 🇮🇳

4.3

(4)

62 documents

1 / 44

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
Presentation Outline
Introduction
Literature Overview
Constraints
Assumptions and Dependencies
Specific Requirements
Project Management
Conclusion
docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c

Partial preview of the text

Download Multi-Objective Optimization with Genetic Algorithms: A Comprehensive Literature Review and more Slides Applications of Computer Sciences in PDF only on Docsity!

Presentation Outline

• Introduction

• Literature Overview

• Constraints

• Assumptions and Dependencies

• Specific Requirements

• Project Management

• Conclusion

docsity.com

Introduction

• Objectives

  • To develop a toolbox for solving multi- objective optimization problems with the help of genetic algorithms

• Deliverables

  • GUI for solving MOP
  • Toolbox for MOP
  • Complete project report

docsity.com

  • Evolutionary Computation
    • Subfield of Artificial Intelligence
    • Involves Evolutionary Algorithms
  • Genetic Algorithms (GA)
    • Fast growing optimization technique
    • Used to find true and approximate solutions.
  • Reason for Success of GA
    • Broad applicability
    • Ease of use docsity.com
  • Advantages of GA
    • Flexibility
    • Solve complex problems
    • Trouble-free to apply

docsity.com

  • Multi-objective Optimization

Problem (MOP)

  • Involves more then one objective functions
  • General form is:

( ) ( )

m j k L U i i i

Minimize Maximize f x m M

subject to g x j J

h x k K

x x x

   i 1, 2,......., ; n

docsity.com

docsity.com

  • Convex Function

docsity.com

  • Difference Between SOP and MOP
    • Two goals instead of one
    • Dealing with two search spaces
    • No artificial fix-ups

docsity.com

  • Example

docsity.com

  • Pareto-optimality

docsity.com

  • Locally and Globally Pareto-optimal

Solutions

docsity.com

  • Applications
    • Optimization Problems in Mobile Communications - The base station location with frequency assignment - The OVSF code assignment problem - The joint base station scheduling problem

docsity.com

  • Elitist MOEAs
    • Rudolph’s Elitist MOEA
    • Elitist Non-dominated Sorting GA
    • Distance-Based Pareto GA
    • Strength Pareto EA
    • Thermodynamical GA
    • Pareto-Archived Evolution Strategy
    • Multi-Objective Messy GA
  • Constrained MOEAs

Jimenez-Verdegy-Gomez-Skarmeta’s Method

  • Constrained tournament Method
  • Ray-Tai-Seow’s Method docsity.com
  • Performance Metrics
    • Metrics Evaluating Closeness to the Pareto-optimal Front
    • Metrics Evaluating diversity Among Non-dominated Solution
    • Metrics Evaluating Closeness and diversity

docsity.com