2015

1. COMEX Annual Workshop 2015

Location : Campus Plaine, Building NO, Solvay room, 5th floor

November 17, 2015

9.30       Welcome – coffee

10.00     Federico PAGNOZZI (ULB-IRIDIA)Generating automatically hybrid stochastic local search algorithms for flow-shop scheduling problems

10.30     Hanne POLLARIS (UHasselt)

The capacitated vehicle routing problem with sequence-based pallet loading and axle weight restrictions

11.00     Mehdi MADANI (UCL)

Revisiting minimum profit conditions in uniform price day-ahead electricity auctions

11.30     Thi Thanh Dang NGUYEN (KUL – Kulak)

Analysis of a multi-neighborhood local search for the swap-body vehicle routing problem

12.00     Administrative meeting + lunch

14.00     Daniel PALHAZI CUERVO (UAntwerp)

Determining collaborative profits in coalitions formed by two partners with varying characteristics

14.30     Véronique FRANCOIS (ULg)

Large neighborhood search for multi-trip vehicle routing

15.00     Coffee break

15.30     Ward PASSCHYN

Locks, Graphs, and Intervals

16.00     Hatice CALIK (ULB-GOM)

Location, Allocation, and Routing Decisions in an Electric Car Sharing System


2. The 21st COMEX Belgian Mathematical Optimization Workshop

Location : La Roche-en-Ardenne

Date: 23rd and 24th of April 2015

Program

Thursday 23 April 2015
======================

–   09:30 – 10:30 Welcome / Coffee

–   10:30 – 11:00 Martim MONIZ (ULB/GOM)

*Optimal design of switched Ethernet networks implementing the
multiple spanning tree protocol*

–   11:00 – 11:30 Annette FICKER (KULeuven)

*A Cycle Breaking approach for the Axial 3-Dimensional Assignment
Problem with perimeter costs*

–   11:30 – 12:00 Alejandro MARCOS (ULg)

*Machine Learning to Balance the Load in Parallel Branch-and-Bound*

–   12:00 – 12:30 Gérard DAMIEN (ULg)

*Feasibility oriented branching strategies for global optimization*

–   12:30 – 14:00 Lunch

–   14:00 Room keys are available at the reception desk

–   14:00 – 16:00 Jeff LINDEROTH (University of Wisconsin)

*Mixed-Integer Nonlinear Optimization: Applications, Algorithms, and
Computation*

Mixed-integer nonlinear programming problems (MINLPs) combine the
combinatorial complexity of discrete decisions with the numerical
challenges of nonlinear functions. In this these talks, we will
describe applications of MINLP in science and engineering,
demonstrate the importance of building “good” MINLP models, discuss
numerical techniques for solving MINLP, and survey the forefront of
ongoing research topics in this important and emerging area.

–   16:00 – 16:30 Coffee Break

–   16:30 – 17:00 Anne-Sophie CRELOT (UNamur)

*Surrogate Management for Mixed-Integer Derivative-Free Optimization
for industrial applications*

–   17:00 – 17:30 Alessia VIOLIN (ULB/GOM)

*A Branch-and-Price framework for the Highway Problem: benefits of
automatic tuning*

–   17:30 – 18:00 COMEX administrative meeting

–   19:00 Dinner

Friday 24 April 2015
====================

–   08:00 – 09:00 Breakfast

–   09:00 – 09:30 Ignacio Andrés ARAVENA SOLÍS (UCL)

*A column-and-constraint generation heuristic for
strict-linear-pricing in an electricity pool*

–   09:30 – 10:00 Leonardo BEZERRA (ULB/IRIDIA)

*Automatic component-wise design of multi-objective evolutionary
algorithms*

–   10:00 – 10:30 Coffee Break

–   10:30 – 12:30 Holger HOOS (University of British Columbia)

From Programs to Program Spaces: Leveraging Machine Learning and
Optimisation for Automated Algorithm Design

In recent years, there has been a significant increase in the use of automated
algorithm design methods, such as portfolio-based algorithm selection and
automated algorithm configuration, across many areas within artificial
intelligence, operations research and beyond. These methods are based on
cutting-edge machine learning and optimisation techniques and, in many
cases, have prompted advances in those areas. In this presentation, I
will give an overview of these automated algorithm design methods and
introduce Programming by Optimisation (PbO), a principled approach
for developing high-performance software based on them. I will explain
how PbO can fundamentally change the nature of software development
and give examples for its successful application from a range of prominent
problems, including propositional satisfiability, mixed integer programming
and machine learning classification.

–   12:30 – 14:00 Lunch

–   14:00 – 14:30 Hans DEGROOTE (KULeuven)

*Towards a knowledge base for performance data: a formal model for
performance comparison*

–   14:30 – 15:00 Mehdi MADANI (UCL)

*A MIP framework for non-convex uniform price day-ahead electricity
auctions*

–   15:00 – 15:30 Sébastien MATHIEU (ULg)

*Nonatomic congestion games in electricity markets with flexible
consumption*

–   15:30 Coffee Break / End of the meeting