ORBEL 34

About the conference
What is OR
Organisation
Deadlines
Call for abstracts
Registration
   Registration
   Participants
Conference program
   Key speakers
   Speakers
   Detailed program
Location
Conference dinner
Partners
Contact

 

Schedule


Thursday, 30 January
08:30-09:10Welcome-registration-coffeeB14-B15-B16
09:10-09:30Opening sessionAmphi Cuccaroni
09:30-10:30Plenary session - Adam Letchford (Chair: Martine Labbé)Amphi Cuccaroni
10:30-11:20Coffee breakB14-B15-B16
11:20-12:40Parallel sessions
  Multi-objective Optimization
Chair: Sara Tari
Room: E501
Health-care
Chair: Véronique François
Room: E502
Public Transportation
Chair: Javier Duran Micco
Room: E503
Global Optimization
Chair: Olivier Rigal
Room: E601
Analytics 1
Chair: Rafael Van Belle
Room: E602
12:40-14:10Lunch/ORBEL Board meetingB14-B15-B16/E501
14:10-15:10Parallel sessions
  Air, Rail and Multimodal Transportation
Chair: Paola Paregrini
Room: E501
Game Theory
Chair: Lotte Verdnock
Room: E502
Transportation of People
Chair: Yves Molenbruch
Room: E503
Multi-level Optimization
Chair: Concepcion Dominguez
Room: E601
Analytics 2
Chair: Vedavyas Etikala
Room: E602
15:10-15:50Coffee breakB14-B15-B16
15:50-16:40Parallel sessions
  Sport Timetabling
Chair: Dries Goossens
Room: E501
Project Management and Scheduling
Chair: Fan Yang
Room: E502
Rich Routing and Graphs
Chair: Alexandre Bontems
Room: E503
Logistics
Chair: Yuan Yuan
Room: E601
Analytics 3
Chair: Jari Peeperkorn
Room: E602
16:50-17:30ORBEL general assemblyAmphi Cuccaroni
19:00-20:00CocktailBar Zango
20:30-23:00DinnerLa Terrasse des Ramparts

Friday, 31 January
09:30-10:30Plenary session - Miguel F. Anjos (Chair: Luce Brotcorne)Amphi Cuccaroni
10:30-11:20Coffee breakB14-B15-B16
11:20-12:40Parallel sessions
  Automatic Configuration and Metaheuristics Analysis
Chair: Kenneth Sorensen
Room: E501
Real Life and Integrated Problems
Chair: Jeroen Belien
Room: E502
Warehouse Management
Chair: Harol Mauricio Gamez
Room: E601
Analytics 4
Chair: Noureddine Kouaissah
Room: E602
12:40-14:10LunchB14-B15-B16
14:10-15:10Parallel sessions
  Orbel Award
Chair: Jeroen Belien
Room: E501
Optimization
Chair: Julien Dewez
Room: E502
Trucking Optimization
Chair: Hatice Çalik
Room: E601
Analytics 5
Chair: Diego Olaya
Room: E602
15:10-15:50Coffee breakB14-B15-B16
15:50-16:50Parallel sessions
  Learning and Optimization
Chair: Johan Van Kerckhoven
Room: E501
Lot-sizing and Inventory
Chair: Philippe Chevalier
Room: E502
Rich Routing
Chair: Cristian Aguayo
Room: E601
17:00-17:15ORBEL award and closing sessionAmphi Cuccaroni
17:15-18:30Closing cocktailB14-B15-B16


Thursday 11:20 - 12:40 Multi-objective Optimization
Room E501 - Chair: Sara Tari

Thursday 11:20 - 12:40 Health-care
Room E502 - Chair: Véronique François

Thursday 11:20 - 12:40 Public Transportation
Room E503 - Chair: Javier Duran Micco

Thursday 11:20 - 12:40 Global Optimization
Room E601 - Chair: Olivier Rigal

Thursday 11:20 - 12:40 Analytics 1
Room E602 - Chair: Rafael Van Belle

Thursday 14:10 - 15:10 Air, Rail and Multimodal Transportation
Room E501 - Chair: Paola Pellegrini

Thursday 14:10 - 15:10 Game Theory
Room E502 - Chair: Lotte Verdnock

Thursday 14:10 - 15:10 Transportation of People
Room E503 - Chair: Yves Molenbruch

Thursday 14:10 - 15:10 Multi-level Optimization
Room E601 - Chair: Concepcion Dominguez

Thursday 14:10 - 15:10 Analytics 2
Room E602 - Chair: Vedavyas Etikala

Thursday 15:50 - 16:50 Sport Timetabling
Room E501 - Chair: Dries Goossens

Thursday 15:50 - 16:50 Project Management and Scheduling
Room E502 - Chair: Fan Yang

Thursday 15:50 - 16:50 Rich Routing and Graphs
Room E503 - Chair: Alexandre Bontems

Thursday 15:50 - 16:50 Logistics
Room E601 - Chair: Silia Mertens

Thursday 15:50 - 16:50 Analytics 3
Room E602 - Chair: Jari Peeperkorn

Friday 11:20 - 12:40 Automatic Configuration and Metaheuristics Analysis
Room E501 - Chair: Kenneth Sorensen

Friday 11:20 - 12:40 Real Life and Integrated Problems
Room E502 - Chair: Jeroen Belien

Friday 11:20 - 12:40 Warehouse Management
Room E601 - Chair: Harol Mauricio Gamez

Friday 11:20 - 12:40 Analytics 4
Room E602 - Chair: Noureddine Kouaissah

Friday 14:10 - 15:10 Orbel Award
Room E501 - Chair: Jeroen Belien

    Friday 14:10 - 15:10 Optimization
    Room E502 - Chair: Julien Dewez
    • New Multi-Step Conjugate Gradient Method for Optimization
      Issam Moghrabi (Gulf University for Science and Technology)
      Co-authors: Issam A.R. Moghrabi
    • Constrained Binary Quadratic PRoblems? No.... There is EXPEDIS
      Nicolo Gusmeroli (TU Dortmund)
      Co-authors: Angelika Wiegele
      Abstract:
      Binary quadratic problems arise in many situations, since they have several applications in different fields. Although optimizing a BQP is an NP-hard problem, various exact or approximate algorithms have been proposed. Given an equality constrained binary quadratic problem (BQP), we present an exact penalty method over discrete sets, called EXPEDIS. This algorithm transforms (BQP) into an equivalent max-cut instance, that we solve with BiqMac. EXPEDIS either provides the optimal solution or certifies the infeasibility of the original problem. The running time of BiqMac depends on the magnitude of a penalty parameter ?, hence we want to find a small parameter for which we either output the optimal value or an infeasibility certificate. First we introduce the necessary conditions for the penalizer. Then, we present the formulation of the optimal penalty parameter. The problem is that computing this optimal penalty parameter is as hard as solving (BQP). Thus we explain a different relaxation for calculating a “small” penalty parameter in few time. Lasserre proposed a similar approach in 2016, so we compare the different penalizers. From the numerical results our formulation is in favor when computing the max-cut. We present some small improvements for EXPEDIS, that decrease the overall computational time of the algorithm, and we set all the parameters for the algorithm. We continue by comparing EXPEDIS and CPLEX for different sets of instances showing that the EXPEDIS is, on average, faster. We conclude by explaining the next steps and present ideas to further improve EXPEDIS.
    • Computing lower bounds on the nonngative rank using a nested polytopes formulation
      Julien Dewez (Université catholique de Louvain)
      Co-authors: François Glineur

    Friday 14:10 - 15:10 Trucking Optimization
    Room E601 - Chair: Hatiz Çalik

    Friday 14:10 - 15:10 Analytics 5
    Room E602 - Chair: Diego Olaya

    Friday 15:50 - 16:50 Learning and Optimization
    Room E501 - Chair: Jorik Jooken

    Friday 15:50 - 16:50 Lot-sizing and Inventory
    Room E502 - Chair: Philippe Chevalier

    Friday 15:50 - 16:50 Rich Routing
    Room E601 - Chair: Cristian Aguayo

     
     
      ORBEL - Conference chairs: Diego Cattaruzza and Maxime Ogier