Difference between revisions of "Optimization Group Meetings"

From IridiaWiki
Jump to navigationJump to search
Line 122: Line 122:
   
 
'''''Abstract and Reading Material'''''
 
'''''Abstract and Reading Material'''''
  +
  +
* [http://iridia.ulb.ac.be/seminars/index.php?x=00070 The Problem of Railroad Yards Operational Planning]
  +
  +
'''''People who will be absent'''''
  +
<br>
  +
Christophe Philemotte
  +
  +
<br><br>
  +
  +
==Thursday 17th November - Jodelson A. SABINO==
  +
  +
'''''Agenda'''''
  +
  +
# '''Introduction'''
  +
#* Field of expertise etc.
  +
# '''Presentation / Discussion'''
  +
#* The Problem of Railroad Yards Operational Planning
  +
# '''MEETOPT Admin (10-15 mins)'''
  +
  +
  +
'''''Linked Presentations'''''
  +
  +
'''''Abstract and Reading Material'''''
  +
  +
This seminar gives an overview of the algorithm presented in Jodelson's Master
  +
Degree dissertation to solve the Switch Engine Assignment Problem. This presentation
  +
start with a quick review of the problem statement (as it was presented in a previous
  +
IRIDIA seminar), definition of the concept of PDP path and the solution by the RR-COMPETants
  +
algorithm.
   
 
* [http://iridia.ulb.ac.be/seminars/index.php?x=00070 The Problem of Railroad Yards Operational Planning]
 
* [http://iridia.ulb.ac.be/seminars/index.php?x=00070 The Problem of Railroad Yards Operational Planning]

Revision as of 16:56, 13 November 2005

Purpose

The goal of the optimization weekly meeting is to facilitate and support the development and conduct of research in optimization at IRIDIA. The meeting will help you in your efforts to develop research ideas, gives feedback on your work and serves as a means for disseminating your research results.

  1. Community. Keep everyone updated as to what other work in optimization is going on in the lab.
  2. Research. Share research results. Discussions of general interest. Literature study on specific topics. Inspiration for new research. Reports on conference visits.
  3. Admin. Optimization group administration. Discussion of practical problems. Guidelines for software etc.


Format

  1. Presentation & Discussion (30 - 50 mins)
    • Work you have been doing
    • Reading you have been doing in the context of your work
    • Other reading on something you are passionate about
  2. Optimization group administration (0 - 30 mins)


Try and make your session as involving as possible for everyone:

  • Send the article/handout to be read beforehand.
  • Ask people before the meeting what aspects of your work / reading they would like to know about or discuss.
  • Think about implications of what you are presenting for the research direction of the lab as a whole - methodologies, technologies etc.


Timing & Attendance

The weekly meetings ALWAYS (yet to be finalized) take place on

Thursdays at 11.00 AM

Unless:

  • A given Thursday is a public holiday, or
  • Something very important (like a Ph.D. defense) is overlapping.

If either should happen the meeting is postponed to the next day.

Please indicate on this wiki page if you are not going to be able to attend a meeting (no later than the Friday before).

If you forget to note your absence in advance you will be severely punished and will be forced to buy a nice, big cake (yet to be finalized) for the following meeting.

Friday 28th October - Prasanna BALAPRAKASH

Agenda

  1. Short Introduction to the optimization group weekly meeting
  2. Presentation / Discussion
    • Local Search under Uncertainty
    • Probabilistic Traveling Salesman Problem as a case study
    • Overview of the state-of-the-art local search techniques to tackle uncertainty
    • Empirical estimation based local search to tackle uncertainty
  3. Optimization Group Admin
    • Structure for the weekly meeting
    • Time schedule for the Optimization weekly meeting
    • Wiki page administration
    • Next week...

People who will be absent
-NA-

Results

  • Sharing Code: Writing code in a way such that others can understand (with comments where ever possible). This helps to share the code with others.
  • For the moment, the weekly meeting is scheduled on Thursdays at 11.00 AM.
  • The person, who is giving the talk, should present the field/area in which he/she considers himself/herself as an expert for about 5 mins.
  • We should agree on the coding language and compilers(if possible). At the moment we are using Mauro's R "code" for statistical analysis and parameter tuning. This code will be made available in this wiki.
  • Skripts for doing useful things will be collected and also be made available in this wiki.


Download Presentation(PDF)



Thursday 3nd November - Max MANFRIN

Agenda

  1. Introduction / General interest discussion
  2. Presentation / Discussion
    • Survey on Parallelization of Ant Colony Optimization
    • Proposal of a parallel design for ACO algorithm to solve Rich Vehicle Routing Problems


Linked Presentations


Reading Material

  • There is no reading material for this weeks presentation


People who will be absent

Christophe Philemotte



Wednesday 9th November - Jodelson A. SABINO

This talk is going to be given as a IRIDIA seminar. Therefore it will not take place on Thursday but on Wednesday. After the talk, there will be a MEETOPT discussion about the organizational matters.

Agenda

  1. Introduction
    • Field of expertise etc.
  2. Presentation / Discussion
    • The Problem of Railroad Yards Operational Planning
  3. MEETOPT Admin (10-15 mins)


Linked Presentations

Abstract and Reading Material

People who will be absent
Christophe Philemotte



Thursday 17th November - Jodelson A. SABINO

Agenda

  1. Introduction
    • Field of expertise etc.
  2. Presentation / Discussion
    • The Problem of Railroad Yards Operational Planning
  3. MEETOPT Admin (10-15 mins)


Linked Presentations

Abstract and Reading Material

This seminar gives an overview of the algorithm presented in Jodelson's Master Degree dissertation to solve the Switch Engine Assignment Problem. This presentation start with a quick review of the problem statement (as it was presented in a previous IRIDIA seminar), definition of the concept of PDP path and the solution by the RR-COMPETants algorithm.

People who will be absent
Christophe Philemotte