BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Namur Institute For Complex Systems - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Namur Institute For Complex Systems
X-ORIGINAL-URL:https://www.naxys.be
X-WR-CALDESC:Events for Namur Institute For Complex Systems
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20170326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20171029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20191027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20181025T130000
DTEND;TZID=Europe/Paris:20181025T140000
DTSTAMP:20260419T210854
CREATED:20181010T063010Z
LAST-MODIFIED:20181010T084458Z
UID:484-1540472400-1540476000@www.naxys.be
SUMMARY:Alexandre Mayer (UNamur)
DESCRIPTION:Title: An evolutionary computing approach to optical engineering \nAbstract: We present a genetic algorithm that we developed in order to address computationally expensive optimization problems in optical engineering. The idea consists in working with a population of individuals that represent possible solutions to the problem. The best individuals are selected. They generate new individuals for the next generation. Random mutations in the coding of parameters are introduced. This strategy is repeated from generation to generation until the algorithm converges to the global optimum of the problem considered. For computationally expensive problems\, it makes sense to analyze the data collected by the algorithm in order to infer more rapidly the final solution. The objective is ideally to determine the global optimum by a single run of the genetic algorithm and with a reduced number of fitness evaluations. The use of a mutation operator that acts on randomly-shifted Gray codes contributes to this objective by helping the genetic algorithm to escape local optima and by enabling a wider diversity of displacements. These techniques reduce the computational cost of optical engineering problems\, where the design parameters have a finite resolution and are limited to a realistic range.
URL:https://www.naxys.be/event/alexandre-mayer-unamur/
LOCATION:E25
CATEGORIES:NAXYS Seminar
END:VEVENT
END:VCALENDAR