Difference between revisions of "Optimization Group Meetings"

From IridiaWiki
Jump to navigationJump to search
 
(171 intermediate revisions by 14 users not shown)
Line 1: Line 1:
  +
You can subscribe to an [http://en.wikipedia.org/wiki/ICalendar iCalendar] of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics
−
==Purpose==
  
   
  +
==Breakfast Meetings==
−
The goal of the this community is to facilitate and support the development and conduct of optimization research at IRIDIA. The group will help you in your efforts to develop research ideas, gives feedback and disseminate your research results.
  
   
  +
===Purpose===
−
# '''Community'''. Keep everyone updated as to what other work is going on in the lab
  
−
# '''Research'''. Cross germination. Get feedback. Get help on problems. Get ideas.
  
−
# '''Admin'''. Optimization group and Lab administration.
  
   
  +
Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.
   
   
  +
=== Organization ===
−
<br>
  
   
  +
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.
−
==Format==
  
  +
# Add a new entry to the table below.
  +
# Bring breakfast.
   
−
# Presentation & Discussion (30 - 50 mins)
  
−
#* Area in which you consider yourself as an expert e.g. Statistical analysis, data structures, results visualization etc. (To help others if they want some help in your area)
  
−
#* Work you have been doing
  
−
#* Reading you have been doing in the context of your work
  
−
#* Other reading on something you are passionate about
  
−
# Optimization Group and IRIDIA Administration (0 - 15 mins)
  
   
  +
=== History of Breakfast Meetings ===
   
  +
{| class="sortable" border="1" cellpadding="2" cellspacing="0"
−
Try and make your session as involving as possible for everyone:
  
  +
|- align="left"
−
* Send the article/handout to be read beforehand.
  
  +
!width="100"|Date
−
* Ask people before the meeting what aspects of your work / reading they would like to know about or discuss.
  
  +
!width="200"|Presenter
−
* Think about implications of what you are presenting for the research direction of the lab as a whole - methodologies, technologies etc.
  
  +
!class="unsortable"|Summary
−
<br>
  
  +
|-
  +
|2014-04-10
  +
|G. Sena DAÅž
  +
| Developing a Solution Algorithm for the Multi-objective Gate Assignment Problems
  +
|-
  +
|2013-09-12
  +
|Leslie Perez
  +
| Tuning and irace
  +
|-
  +
|2011-03-10
  +
|Stefanie Kritzinger
  +
| A Unified Framework for Routing Problems with Fixed Fleet Size
  +
|-
  +
|2010-12-21
  +
|Paola Pellegrini
  +
| Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP
  +
|-
  +
|2010-10-19
  +
|Stefano Benedettini
  +
| Experiments on Boolean Network Design by Local Search Algorithms.
  +
|-
  +
|2010-05-20
  +
|Marco Montes de Oca
  +
| The social learning strategies tournament, organized as part of the [http://www.intercult.su.se/cultaptation/ cultaptation project], and its results were described. No ideas about algorithm portfolios were discussed.
  +
|-
  +
|2010-05-??
  +
|Renaud Lenne
  +
| ???
   
  +
|-
−
==Timing & Attendance==
  
  +
|2010-04-29
  +
|Franco Mascia
  +
|The maximum clique problem, state of the art and ACO [http://dx.doi.org/10.1016/j.cor.2009.02.013] [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.2036&rep=rep1&type=pdf] [http://www710.univ-lyon1.fr/~csolnon/publications/rr-mai04.pdf]
   
  +
|-
−
The weekly meetings '''ALWAYS''' (yet to be finalized) take place on
  
  +
|2010-03-18
  +
|Sabrina Oliveira
  +
|Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.
  +
|-
  +
|2010-02-11
  +
|Sara Ceschia
  +
|An overview of Container Loading Problems.
  +
|-
  +
| 2010-01-21
  +
|Yuan, Zhi (Eric)
  +
| Rice cooker vs. the idea of tuning.
  +
|-
  +
|2010-01-07
  +
|Thomas Stüztle
  +
|General discussion about the optimization group.
  +
|}
   
  +
==Literature Sessions==
−
<center> '''Thursdays at 11.00 AM''' </center>
  
   
  +
===Purpose===
−
Unless:
  
−
* A given Thursday is a public holiday, or
  
−
* Something very important (like a Ph.D. defense) is overlapping.
  
   
  +
The goal of the Literature Sessions is to examine and discuss
−
If either should happen the meeting is postponed to the next day.
  
  +
particularly interesting papers from the research literature. For each
  +
session, one paper will be selected, there will be a short
  +
presentation (10-15 minutes) about the contents, and a discussion will
  +
ensue. Sessions will last around 40-45 minutes. Attendants should read
  +
the paper before the session in order to have a productive discussion.
   
−
'''Please indicate on this wiki page if you are not going to be able to attend a meeting''' (no later than the Friday before).
 
   
  +
=== Organization ===
−
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.
  
−
<br><br>
  
   
  +
# Send an email to the [[Lab_responsibilities#Seminars_and_meetings | responsible of Optimization Meetings]]. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.
−
==Friday 28th October - Prasanna BALAPRAKASH==
  
  +
# Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).
   
−
'''''Agenda'''''
  
−
# '''Short Introduction to the optimization group weekly meeting'''
  
−
# '''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
  
−
# '''Optimization Group Admin'''
  
−
#* Structure for the weekly meeting
  
−
#* Time schedule for the Optimization weekly meeting
  
−
#* Wiki page administration
  
−
#* Next week...
  
   
  +
=== History of Literature Sessions ===
−
'''''People who will be absent'''''
  
−
<br>
  
−
-NA-
  
   
  +
{| class="sortable" border="1" cellpadding="2" cellspacing="0"
−
'''''Results'''''
  
  +
|- align="left"
−
* 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.
  
  +
!width="100"|Date
−
* For the moment, the weekly meeting is scheduled on Thursdays at 11.00 AM.
 
  +
!width="180"|Presenter
−
* The person, who is giving the talk, should present the field/area in which he/she considers himself/herself as an expert for 5 to 10 mins.
 
  +
!class="unsortable"|Paper discussed
−
* 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.
  
  +
|-
  +
|2015-01-09
  +
| Alberto Franzin
  +
|Chris Fawcett, Holger H. Hoos. 2015. Analysing differences between algorithm configurations through ablation. In Journal of Heuristics, 2015. http://dx.doi.org/10.1007/s10732-014-9275-9
   
   
  +
Frank Hutter, Holger Hoos, Kevin Leyton-Brown. 2014. An efficient approach for assessing Hyperparameter importance. In Proceedings of the 31st International Conference of Machine Learning (ICML), 2014. http://jmlr.org/proceedings/papers/v32/hutter14.pdf
  +
|-
  +
|2014-10-07
  +
| Leslie Perez
  +
|Martin Zaefferer, Jörg Stork, Martina Friese, Andreas Fischbach, Boris Naujoks, and Thomas Bartz-Beielstein. 2014. Efficient global optimization for combinatorial problems. In Proceedings of the 2014 conference on Genetic and evolutionary computation (GECCO), 2014. http://doi.acm.org/10.1145/2576768.2598282
   
  +
Martin Zaefferer, Jörg Stork, Thomas Bartz-Beielstein: Distance Measures for Permutations in Combinatorial Efficient Global Optimization. PPSN 2014. http://doi.acm.org/10.1145/2576768.2598260
−
[[Media :EmpiricalLocalSearch.pdf|Download Presentation(PDF)]]
  
  +
|-
  +
|2014-02-20
  +
| Thomas Stutzle
  +
|A unified solution framework for multi-attribute vehicle routing problems.
  +
Thibaut Vidal, Teodor Gabriel Crainic, Michel Gendreau, and Christian Prins.
  +
http://dx.doi.org/10.1016/j.ejor.2013.09.045
  +
|-
  +
|2013-10-03
  +
|Leonardo Bezerra
  +
|Robust Benchmark Set Selection for Boolean Constraint Solvers. Holger Hoos, Benjamin Kaufmann, Torsten Schaub and Marius Schneider - Proceedings of the 7th International Conference on Learning and Intelligent Optimization (LION 7), to appear, 2013. http://www.cs.ubc.ca/~hoos/Publ/HooEtAl13-preprint.pdf
   
  +
Quantifying Homogeneity of Instance Sets for Algorithm Configuration. Marius Schneider and Holger H. Hoos - Proceedings of the 6th International Conference on Learning and Intelligent Optimization (LION 6), pp. 190-204, 2012. http://www.cs.ubc.ca/~hoos/Publ/SchHoo12.pdf
  +
|-
  +
|2013-09-12
  +
|Manuel López-Ibáñez
  +
|Automated Parameter Tuning Framework for Heterogeneous and Large Instances: Case study in Quadratic Assignment Problem Lindawati, Zhi Yuan, Hoong Chuin Lau & Feida Zhu. http://lion.disi.unitn.it/intelligent-optimization//LION7/Lindawati-Yuan-Lau-Zhu_Automated%20Parameter%20Tuning.pdf
  +
|-
  +
|2013-04-11
  +
|Leslie Perez
  +
| C. Ansótegui, M. Sellmann, and K. Tierney, “A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms,” in Principles and Practice of Constraint Programming - CP 2009, I. P. Gent, Ed. Springer Berlin Heidelberg, 2009, pp. 142–157. http://itu.dk/people/kevt/papers/gga-cp2009.pdf
  +
|-
  +
|2012-10-18
  +
|Manuel López-Ibáñez
  +
| Yuri Malitsky, Meinolf Sellmann: Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259
  +
http://dx.doi.org/10.1007/978-3-642-29828-8_16
  +
|-
  +
|2012-10-12
  +
| Tianjun Liao
  +
|Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike Preuß. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:[http://doi.acm.org/10.1145/2330163.2330209 10.1145/2330163.2330209]
   
  +
Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and Günter Rudolph. 2011. Exploratory landscape analysis. In
−
<br>
  
  +
Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:[http://doi.acm.org/10.1145/2001576.2001690 10.1145/2001576.2001690]
  +
|-
  +
|2012-04-19
  +
|Franco Mascia
  +
|E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 [http://www.cs.nott.ac.uk/~mvh/papers/mvh-draft-ieeetec2011.pdf PDF]
  +
|-
  +
|2012-04-03
  +
|[http://iridia.ulb.ac.be/~jdubois/ Jérémie Dubois-Lacoste]
  +
|On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming. J A Vázquez-Rodríguez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381–396. doi:[http://dx.doi.org/10.1057/jors.2010.132 10.1057/jors.2010.132]
  +
|-
  +
|2011-12-08
  +
|Zhi Yuan
  +
|Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [http://www.cs.ubc.ca/~hutter/papers/11-LION5-SMAC.pdf]
  +
|-
  +
|2011-11-24
  +
|Manuel López-Ibáñez
  +
|Ender Özcan and Andrew J. Parkes. 2011. Policy matrix evolution for generation of heuristics. In Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: [http://dx.doi.org/10.1145/2001576.2001846 10.1145/2001576.2001846]
  +
|-
  +
|2011-02-04
  +
|Paola Pellegrini
  +
|HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. [http://hal.cs.ubc.ca/pubs/NelEtAl11.pdf PDF]
  +
|-
  +
|2010-12-17
  +
|Marco Montes de Oca
  +
|A. LaTorre, S. Muelas, and J.-M. Peña. A MOS-based dynamic memetic differential evolution algorithm for continuous optimization: a scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale Continuous Optimization Problems. DOI [http://dx.doi.org/10.1007/s00500-010-0646-3 10.1007/s00500-010-0646-3]
  +
|-
  +
|2010-11-10
  +
|[http://iridia.ulb.ac.be/~manuel/ Manuel López-Ibáñez]
  +
|A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a "novel" Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60. DOI: [http://dx.doi.org/10.4018/jamc.2010040104 10.4018/jamc.2010040104]
   
  +
Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.
−
==Thursday 3nd November - Max MANFRIN==
  
   
  +
|-
  +
|2010-09-23
  +
|Gianpiero Francesca
  +
|Wenyin Gong, Álvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: "GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation", ACM Press : p. 409-416. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/68/PDF/AOS-DE.pdf]
   
  +
Álvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: "GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation", ACM Press : p. 767-774. July 2010. [http://hal.archives-ouvertes.fr/docs/00/47/12/64/PDF/banditGECCO10.pdf]
−
'''''Agenda'''''
  
   
  +
|-
−
# '''Introduction / General interest discussion'''
  
  +
|2010-06-03
−
#* Brief introduction on Max background
  
  +
|Tianjun Liao
−
#* IRIDIA Cluster
 
  +
|Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: [http://dx.doi.org/10.1109/TEVC.2010.2040183 10.1109/TEVC.2010.2040183]
−
#** [http://iridia.ulb.ac.be/~alyhne/wiki/index.php/IRIDIA_cluster_architecture The architecture of the IRIDIA cluster]
  
−
#** The Sun Grid Engine queueing system
  
−
#** [http://iridia.ulb.ac.be/~alyhne/wiki/index.php/Using_the_IRIDIA_Cluster Policies for submission and execution of the jobs]
  
−
# '''Presentation / Discussion'''
  
−
#* Survey on Parallelization of Ant Colony Optimization
  
−
#* Proposal of a parallel design for ACO algorithm to solve Rich Vehicle Routing Problems
  
   
  +
|-
  +
|2010-05-07
  +
|Zhi (Eric) Yuan
  +
|Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [http://ws.cs.ubc.ca/~kevinlb/pub.php?u=2010-AAAI-Hydra.pdf]
   
  +
|-
−
'''''Linked Presentations'''''
  
  +
|2010-03-04
  +
|Sara Ceschia
  +
|A. Schaerf and L. Di Gaspero. [[:Image:ElPaCo_presentation.pdf|Slides of the tutorial "An Overview of Local Search Software Tools"]] given at "Learning and Intelligent OptimizatioN (LION 2007)", December 8-12, 2007, Trento, Italy.
   
  +
L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for flexible design of local search algorithms. Software — Practice & Experience, 33(8):733–765, July 2003. [http://www.diegm.uniud.it/satt/papers/DiSc03.pdf]
−
* [http://landau.ulb.ac.be/~mmanfrin/media/pdf/MPI-overview.pdf An overview on Parallel Computing and Message Passing] Seminar at IRDIA - ULB, Brussels, Belgium, January 26, 2005
  
   
  +
S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [http://dx.doi.org/10.1023/B:HEUR.0000026900.92269.ec]
   
  +
|-
−
'''''Reading Material'''''
  
  +
|2010-02-19
  +
|Sabrina M. de Oliveira
  +
|A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [http://sci2s.ugr.es/programacion/workshop/GarciaMolinaLozanoHerrera-JH2008.pdf]
   
  +
|-
−
* There is no reading material for this weeks presentation
  
  +
|2010-02-04
  +
|Thomas Stüztle
  +
|Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Álvaro Fialho, Luis Da Costa, Marc Schoenauer and Michéle Sebag.
   
  +
|-
  +
|2010-01-14
  +
|[http://iridia.ulb.ac.be/~jdubois/ Jérémie Dubois-Lacoste]
  +
|SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [http://www.jair.org/media/2490/live-2490-3923-jair.pdf]
  +
|-
  +
|2009-12-11
  +
|[http://iridia.ulb.ac.be/~manuel/ Manuel López-Ibáñez]
  +
|SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/SATenstein_ijcai.pdf]
  +
|}
  +
<br>
  +
<br>
   
  +
== Other Previous Meetings==
−
'''''People who will be absent'''''
  
−  
−
Christophe Philemotte (ill)
  
−  
−
<br><br>
  
−  
−  
−  
−
==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 Optimization group discussion about the organizational matters.
  
−  
−
'''''Agenda'''''
  
−  
−
# '''Introduction'''
  
−
#* Field of expertise etc.
  
−
# '''Presentation / Discussion'''
  
−
#* The Problem of Railroad Yards Operational Planning
  
−  
−  
−  
−
'''''Linked Presentations'''''
  
−  
−
'''''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>
  
−
-N.A.-
  
   
  +
See [[Previous Optimization meetings | Minutes and agendas from previous meetings]].
−
<br><br>
  

Latest revision as of 17:01, 8 January 2015

You can subscribe to an iCalendar of these meetings at http://iridia.ulb.ac.be/Calendars/publish.php/_NUC_Optimization.ics

Breakfast Meetings

Purpose

Breakfast meetings are informal meetings where there is a general discussion or someone presents their work. And additional goal is to have breakfast together.


Organization

  1. Send an email to the responsible of Optimization Meetings. Mention your name, your affiliation, the date, time and room, and a short summary of what you are going to talk about.
  2. Add a new entry to the table below.
  3. Bring breakfast.


History of Breakfast Meetings

Date Presenter Summary
2014-04-10 G. Sena DAÅž Developing a Solution Algorithm for the Multi-objective Gate Assignment Problems
2013-09-12 Leslie Perez Tuning and irace
2011-03-10 Stefanie Kritzinger A Unified Framework for Routing Problems with Fixed Fleet Size
2010-12-21 Paola Pellegrini Off-line vs. On-line Tuning: A Study on MAX-MIN Ant System for the TSP
2010-10-19 Stefano Benedettini Experiments on Boolean Network Design by Local Search Algorithms.
2010-05-20 Marco Montes de Oca The social learning strategies tournament, organized as part of the cultaptation project, and its results were described. No ideas about algorithm portfolios were discussed.
2010-05-?? Renaud Lenne ???
2010-04-29 Franco Mascia The maximum clique problem, state of the art and ACO [1] [2] [3]
2010-03-18 Sabrina Oliveira Achieved results from the application of the Population Based Ant Colony Optimisation algorithm to TSP.
2010-02-11 Sara Ceschia An overview of Container Loading Problems.
2010-01-21 Yuan, Zhi (Eric) Rice cooker vs. the idea of tuning.
2010-01-07 Thomas Stüztle General discussion about the optimization group.

Literature Sessions

Purpose

The goal of the Literature Sessions is to examine and discuss particularly interesting papers from the research literature. For each session, one paper will be selected, there will be a short presentation (10-15 minutes) about the contents, and a discussion will ensue. Sessions will last around 40-45 minutes. Attendants should read the paper before the session in order to have a productive discussion.


Organization

  1. Send an email to the responsible of Optimization Meetings. Mention your name, your affiliation, the date, time and room, a reference to the paper and the URL where it can be obtained. Also, attach the paper in PDF.
  2. Add a new entry to the table below. Use YYY-MM-DD (year-month-day) format for the date. Please add a complete bibliographic reference (you may find it in the homepages of the authors) and a hyperlink to a PDF (links to http://dx.doi.org are preferred).


History of Literature Sessions

Date Presenter Paper discussed
2015-01-09 Alberto Franzin Chris Fawcett, Holger H. Hoos. 2015. Analysing differences between algorithm configurations through ablation. In Journal of Heuristics, 2015. http://dx.doi.org/10.1007/s10732-014-9275-9


Frank Hutter, Holger Hoos, Kevin Leyton-Brown. 2014. An efficient approach for assessing Hyperparameter importance. In Proceedings of the 31st International Conference of Machine Learning (ICML), 2014. http://jmlr.org/proceedings/papers/v32/hutter14.pdf

2014-10-07 Leslie Perez Martin Zaefferer, Jörg Stork, Martina Friese, Andreas Fischbach, Boris Naujoks, and Thomas Bartz-Beielstein. 2014. Efficient global optimization for combinatorial problems. In Proceedings of the 2014 conference on Genetic and evolutionary computation (GECCO), 2014. http://doi.acm.org/10.1145/2576768.2598282

Martin Zaefferer, Jörg Stork, Thomas Bartz-Beielstein: Distance Measures for Permutations in Combinatorial Efficient Global Optimization. PPSN 2014. http://doi.acm.org/10.1145/2576768.2598260

2014-02-20 Thomas Stutzle A unified solution framework for multi-attribute vehicle routing problems.

Thibaut Vidal, Teodor Gabriel Crainic, Michel Gendreau, and Christian Prins. http://dx.doi.org/10.1016/j.ejor.2013.09.045

2013-10-03 Leonardo Bezerra Robust Benchmark Set Selection for Boolean Constraint Solvers. Holger Hoos, Benjamin Kaufmann, Torsten Schaub and Marius Schneider - Proceedings of the 7th International Conference on Learning and Intelligent Optimization (LION 7), to appear, 2013. http://www.cs.ubc.ca/~hoos/Publ/HooEtAl13-preprint.pdf

Quantifying Homogeneity of Instance Sets for Algorithm Configuration. Marius Schneider and Holger H. Hoos - Proceedings of the 6th International Conference on Learning and Intelligent Optimization (LION 6), pp. 190-204, 2012. http://www.cs.ubc.ca/~hoos/Publ/SchHoo12.pdf

2013-09-12 Manuel López-Ibáñez Automated Parameter Tuning Framework for Heterogeneous and Large Instances: Case study in Quadratic Assignment Problem Lindawati, Zhi Yuan, Hoong Chuin Lau & Feida Zhu. http://lion.disi.unitn.it/intelligent-optimization//LION7/Lindawati-Yuan-Lau-Zhu_Automated%20Parameter%20Tuning.pdf
2013-04-11 Leslie Perez C. Ansótegui, M. Sellmann, and K. Tierney, “A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms,” in Principles and Practice of Constraint Programming - CP 2009, I. P. Gent, Ed. Springer Berlin Heidelberg, 2009, pp. 142–157. http://itu.dk/people/kevt/papers/gga-cp2009.pdf
2012-10-18 Manuel López-Ibáñez Yuri Malitsky, Meinolf Sellmann: Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259

http://dx.doi.org/10.1007/978-3-642-29828-8_16

2012-10-12 Tianjun Liao Bernd Bischl, Olaf Mersmann, Heike Trautmann, and Mike Preuß. 2012. Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference (GECCO 2012), Terence Soule (Ed.). ACM, New York, NY, USA, 313-320. DOI:10.1145/2330163.2330209

Olaf Mersmann, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and Günter Rudolph. 2011. Exploratory landscape analysis. In Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 829-836. DOI:10.1145/2001576.2001690

2012-04-19 Franco Mascia E.K. Burke, M.R. Hyde, and G. Kendall. Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 99, 2011. doi: 10.1109/TEVC.2011.2160401 PDF
2012-04-03 Jérémie Dubois-Lacoste On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming. J A Vázquez-Rodríguez and G Ochoa.Journal of the Operational Research Society (2011) 62, 381–396. doi:10.1057/jors.2010.132
2011-12-08 Zhi Yuan Frank Hutter, Holger Hoos, and Kevin Leyton-Brown. Sequential Model-Based Optimization for General Algorithm Configuration. In Proceedings of Learning and Intelligent Optimization (LION 5), 2011. PDF: [4]
2011-11-24 Manuel López-Ibáñez Ender Özcan and Andrew J. Parkes. 2011. Policy matrix evolution for generation of heuristics. In Proceedings of the 13th annual conference on Genetic and evolutionary computation (GECCO 2011), Natalio Krasnogor (Ed.). ACM, New York, NY, USA, 2011-2018. DOI: 10.1145/2001576.2001846
2011-02-04 Paola Pellegrini HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. By Christopher Nell, Chris Fawcett, Holger H. Hoos, and Kevin Leyton-Brown. PDF
2010-12-17 Marco Montes de Oca A. LaTorre, S. Muelas, and J.-M. Peña. A MOS-based dynamic memetic differential evolution algorithm for continuous optimization: a scalability test. Soft Computing. Special issue on Scalability of Evolutionary Algorithms and other Metaheuristics for Large Scale Continuous Optimization Problems. DOI 10.1007/s00500-010-0646-3
2010-11-10 Manuel López-Ibáñez A Rigorous Analysis of the Harmony Search Algorithm--How the Research Community can be misled by a "novel" Methodology. Dennis Weyland. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60. DOI: 10.4018/jamc.2010040104

Survival of the Fittest Algorithm or the Novelest Algorithm?: The Existence Reason of the Harmony Search Algorithm. Zong Woo Geem.

2010-09-23 Gianpiero Francesca Wenyin Gong, Álvaro Fialho and Zhihua Cai. Adaptive Strategy Selection in Differential Evolution. In J. Branke et al., eds.: "GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation", ACM Press : p. 409-416. July 2010. [5]

Álvaro Fialho, Marc Schoenauer and Michele Sebag. Toward Comparison-based Adaptive Operator Selection. In J. Branke et al., eds.: "GECCO'10: Proc. 12th Annual Conference on Genetic and Evolutionary Computation", ACM Press : p. 767-774. July 2010. [6]

2010-06-03 Tianjun Liao Population-Based Algorithm Portfolios for Numerical Optimization. Peng, F. Tang, K.Chen, G.Yao, X. IEEE Transactions on Evolutionary Computation. DOI: 10.1109/TEVC.2010.2040183
2010-05-07 Zhi (Eric) Yuan Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection. L. Xu, H.H. Hoos, K. Leyton-Brown. To appear at the Conference of the Association for the Advancement of Artificial Intelligence (AAAI-10), 2010. [7]
2010-03-04 Sara Ceschia A. Schaerf and L. Di Gaspero. Slides of the tutorial "An Overview of Local Search Software Tools" given at "Learning and Intelligent OptimizatioN (LION 2007)", December 8-12, 2007, Trento, Italy.

L. Di Gaspero and A. Schaerf. EASY LOCAL++: An object-oriented framework for flexible design of local search algorithms. Software — Practice & Experience, 33(8):733–765, July 2003. [8]

S. Cahon, N. Melab and T. El Ghazali. ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics. Journal of Heuristics, 10(3):357-380, November 2004. [9]

2010-02-19 Sabrina M. de Oliveira A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Session on Real Parameter Optimization. S. Garcia, D. Molina, M. Lozano, F. Herrera - Journal of Heuristics, Volume 15, pp. 617-644, 2009. [10]
2010-02-04 Thomas Stüztle Analyzing Bandit-based Adaptive Operator Selection Mechanisms. Álvaro Fialho, Luis Da Costa, Marc Schoenauer and Michéle Sebag.
2010-01-14 Jérémie Dubois-Lacoste SATzilla: Portfolio-based Algorithm Selection for SAT. L. Xu, F. Hutter, H. H. Hoos, K. Leyton-Brown - Journal of Artificial Intelligence Research, Volume 32, pp. 565-606, 2008. [11]
2009-12-11 Manuel López-Ibáñez SATenstein: Automatically Building Local Search SAT Solvers From Components. Ashiqur R. KhudaBukhsh, Lin Xu, Holger H. Hoos and Kevin Leyton-Brown - Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524, 2009. [12]



Other Previous Meetings

See Minutes and agendas from previous meetings.

Retrieved from "https://iridia.ulb.ac.be/w/index.php?title=Optimization_Group_Meetings&oldid=7034"