Schedule

• Workflow Scheduling based on Energy-Aware in a Cloud Computing environment using Non-dominated sorting genetic algorithm (NSGA-II)
  Khaled Sellami (Bejaia )
  Co-authors: Lynda Sellami,Rabah Kassa, Pierre F Tiako
  
• Using genetic algorithms for multi-objective data envelopment analysis
  Mihrac Kupeli (Gazi University)
  Co-authors: Seher Bodur and Ihsan Alp
  
• Optimality conditions for E-differentiable multiobjective programming problems involving E-Type I functions
  Najeeb Abdulaleem (Hadhramout University / University of Lodz)
  
• Multi-Objective optimization for pathology diagnosis through biomarkers
  Sara Tari (University of Lille)
  Co-authors: Laetitia Jourdan, Marie-Eléonore Kessaci, Julie Jacques, Lucien Mousin
  

• Designing master surgery schedules with downstream unit integration via stochastic optimization
  Daniel Santos (Centre for Management Studies, Instituto Superior Técnico, University of Lisbon)
  Co-authors: Inês Marques
  
• Finding the optimal hospital bed assignment policy
  Sarah Damai (UCLouvain)
  Co-authors: Philippe Chevalier
  
• Polyhedral study of a selection problem
  Marie Baratto (HEC - Management school of the University of Liege)
  Co-authors: Yves Crama
  
• Integrated Production Scheduling and Vehicle Routing for Home Chemotherapy Planning
  Véronique François (HEC-Management School of the University of Liège)
  Co-authors: Yasemin Arda, Diego Cattaruzza, Maxime Ogier
  

• The grid based method for local evaluation in bus line planning.
  Evert Vermeir (KU Leuven)
  Co-authors: Pieter Vansteenwegen
  
• The on-demand bus routing problem: towards a more performant public transport system
  Lissa Melis (University of Antwerp)
  Co-authors: Kenneth Sörensen
  
• Benders decomposition for the maximal coverage rapid network design problem
  Victor Bucarey (University Libre de Bruxelles)
  Co-authors: Bernard Fortz, Navitividad Gonzalez Blanco, Martine Labbé, Juan Antonio Mesa
  
• Transit network design and frequency setting problem: A case study on Utrecht
  Javier Duran Micco (KU Leuven)
  Co-authors: Pieter Vansteenwegen
  

• Primal Decomposition Schemes for Mathematical Programming
  Renaud Chicoisne (Université Libre de Bruxelles)
  
• Global optimization in LocalSolver 9.5
  Nikolas Stott (LocalSolver)
  
• Global optimization approaches to design a hybrid railway power station
  Adham Kaloun (Centrale Lille)
  Co-authors: Maxime Ogier and Stéphane Brisset
  
• Resolution of mixed-variables problems in LocalSolver
  Olivier Rigal (LocalSolver)
  

• Partisanship in everyday life: predictive modeling with Facebook like data
  Stiene Praet (University of Antwerp)
  Co-authors: Peter Van Aelst, David Martens
  
• Success Prediction with Dynamic Time Warping-based Feature Engineering for Activity Count Data
  Steven Van Goidsenhoven (KU Leuven)
  Co-authors: Galina Deeva, Seppe vanden Broucke, Jochen De Weerdt
  
• Unravelling Drop-out in Fully Asynchronous Subscription-based MOOCs: When is Drop-out Failure or Success?
  Wai Kit Tsang (Ghent University)
  Co-authors: Annelies Raes, Kristof Coussement, Dries Benoit
  
• Valuing lead time in a periodic-review multi-period order-up-to inventory system
  Jente Van Belle (Vrije Universiteit Brussel)
  Co-authors: Tias Guns; Wouter Verbeke
  

• Airport slot allocation: mitigating the issue of blocking
  Jamie Fairbrother (Lancaster University)
  Co-authors: Konstantinos G. Zografos
  
• Synchromodal transport with disruptions
  Thibault Delbart (University Hasselt)
  Co-authors: Yves Molenbruch, Kris Braekers, An Caris
  
• Optimization and simulation in closed-loop for rail freight yards
  Paola Pellegrini (IFSTTAR)
  Co-authors: Pierre Hosteins, Joaquin Rodriguez, Samuel Deleplanque, Norbert Adamko, Milos Zat'ko
  

• Accounting for individual partners preferences in horizontal cooperation
  Thomas Hacardiaux (Université catholique de Louvain)
  Co-authors: Defryn Christof, Tancrez Jean-Sébastien, Verdonck Lotte
  
• Formation of a common research lab with any number of firms: study of stability conditions
  Razika Sait (Bejaia university)
  
• Public - Private Collaborations in Emergency Logistics
  Lotte Verdonck (Hasselt University)
  Co-authors: Florian Diehlmann, Markus Lüttenberg, Marcus Wiens, Alexander Zienau, Frank Schultmann
  

• A demand responsive feeder-system service with mandatory and clustered, optional bus stops
  Bryan David Galarza Montenegro (University of Antwerp)
  Co-authors: Kenneth Sörensen, Pieter Vansteenwegen
  
• Travel time variations in dial-a-ride systems
  Célia Paquay (Maastricht University )
  Co-authors: Yves Crama; Thierry Pironet
  
• Demand-responsive shared mobility using electric vehicles on a fixed circuit
  Yves Molenbruch (Hasselt University)
  Co-authors: Kris Braekers, Mor Kaspi, Ohad Eisenhändler
  

• A tri-level network protection problem
  Pierre Hosteins (IFSTTAR)
  Co-authors: Margarida Carvalho, Rosario Scatamacchia
  
• Models and Algorithms of the Minimum Spaning Tree Interdiction Problem
  Luis Salazar Zendeja (Ecole Centrale de Lille / Inria)
  Co-authors: Diego Cattaruzza, Martine Labbé, Frédéric Semet
  
• The Rank Pricing Problem with Ties
  Concepción Domínguez (Université Libre de Bruxelles / Universidad de Murcia)
  Co-authors: Martine Labbé, Alfredo Marín
  

• Machine learning methods for short-term Probability of Default
  Lize Coenen (Vrije Universiteit Brussel)
  Co-authors: Wouter Verbeke, Tias Guns
  
• Applying Deep Learning for an intelligent Data Quality Platform
  Jeroen Frans (KU Leuven)
  
• Extracting Explainable Business Decision Models
  Vedavyas Etikala (KU Leuven)
  Co-authors: Jan Vanthienen
  

• Dealing with uncertainty in time-relaxed round robin sports timetabling
  Xiajie Yi (Ghent University)
  Co-authors: Dries Goossens
  
• What algorithm to select in time-relaxed sports timetabling?
  David Van Bulck (UGent)
  Co-authors: Dries Goossens
  
• Flexibility in sports timetabling
  Dries Goossens (Ghent University)
  Co-authors: Roel Lambers; Frits C.R. Spieksma
  

• Fault tree optimization for budget allocation in project risk response
  Xin Guan (Ghent University)
  Co-authors: Mario Vanhoucke
  
• Managing secrecy during the new product development process
  Ben Hermans (KULeuven)
  Co-authors: Roel Leus and Bart Van Looy
  
• Scheduling a single batch processing machine with non-identical job sizes and incompatible job families
  Fan Yang (KU Leuven)
  Co-authors: Morteza Davari, Wenchao Wei, Roel Leus
  

• Reasoning about distance in evolving graphs in a Constraint Based Local Search engine
  Renaud De Landtsheer (CETIC)
  Co-authors: Thomas Fayolle
  
• Coverage Constraints in the Time-Constrained Maximum Covering Salesman Problem
  Nicola Morandi (KU Leuven)
  Co-authors: R. Leus and H. Yaman
  
• Lower bound computations for routing problems in LocalSolver
  Alexandre Bontems (LocalSolver)
  

• City Logistics: Modelling & Efficiently Solving SHOP & HOP
  Delphine Lucq (Ghent University)
  Co-authors: Sidharta Gautama, El-Houssaine Aghezzaf
  
• A metaheuristic approach for the two-echelon location routing problem
  Vinicius Gandra Martins Santos (KU Leuven)
  Co-authors: Hatice Çalik, Greet V. Berghe, Marco Antonio M Carvalho, Túlio A. Toffolo
  
• Vehicle routing with stochastic demands: a case study
  Silia Mertens (Hasselt University)
  Co-authors: Y. Molenbruch, K. Braekers, A. Caris
  

• Data-Driven Failure Age Estimation in a Consumer Electronics Closed-Loop Supply Chain
  Stef Lemmens (INSEAD)
  Co-authors: Andre P. Calmon; Stephen C. Graves
  
• Predictive Maintenance of Technical Faults in Aircrafts
  Florian Peters (HEC Liège Management School - University of Liège)
  Co-authors: Stéphanie AERTS, Michaël SCHYNS
  
• Conformance checking using activity and trace embeddings
  Jari Peeperkorn (KU Leuven)
  Co-authors: Jochen De Weerdt, Seppe vanden Broucke
  

• Automatic algorithm configuration: Instance-specific or not?
  Pieter Leyman (KU Leuven KULAK)
  Co-authors: Holger H. Hoos
  
• Configuration of Time-Dependent Local Search for the Traveling Salesman Problem
  Weerapan Sae-dan (Université de Lille)
  Co-authors: Nadarajen Veerapen, Marie-Eléonore Kessaci, Laetitia Jourdan
  
• Template-based Visualization of Metaheuristics
  Michiel Van Lancker (KU Leuven)
  Co-authors: Greet Vanden Berghe, Tony Wauters
  
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
  Kenneth Sörensen (Universiteit Antwerpen)
  Co-authors: Renata Turkeš, Lars Magnus Hvattum
  

• Operate a Local Energy Market based on market clearing algorithms - Use case presentation
  Keno Merckx (N-SIDE)
  Co-authors: Damien Denayer
  
• Simultaneously optimizing assembly line feeding and assembly line balancing
  Nico André Schmid (Ghent University)
  Co-authors: Veronique Limère, Benoit Montreuil
  
• Modeling transportation mode selection in the assembly line feeding problem
  Ebenezer Olatunde Adenipekun (Ghent University)
  Co-authors: Veronique Limère, Nico André Schmid
  
• The use of integer programming for solving the daily operator assignment problem at a sheltered workshop for packaging Belgian chocolates
  Jeroen Belien (KU Leuven)
  Co-authors: Lukas Hanssens
  

• An Exact Model for the order picking problem
  Farzaneh Rajabighamchi (Maastricht)
  Co-authors: Christof Defryn, Stan Van Hoesel
  
• Integrating Classification, Labelling and Packaging Regulations in Manual Order Picking
  Sarah Vanheusden (Hasselt University, research group logistics)
  Co-authors: Teun van Gils, Katrien Ramaekers and An Caris
  
• Integration of multiple order picking planning problems and vehicle routing: state of the art
  Ruben D'haen (UHasselt)
  Co-authors: Kris Braekers, Katrien Ramaekers
  
• The Scattered Storage Assignment Problem
  Harol Mauricio Gamez Alban (University of Antwerpen)
  Co-authors: Trijntje Cornelissens and Kenneth Sörensen
  

• Classification for Imbalanced Data Using Feature Selection and Undersampling Methods
  You-jin Park (National Taipei University of Technology)
  
• Multi-task Neural Networks for Uplift Modeling
  Sam Verboven (Vrije Universiteit Brussel)
  Co-authors: Jeroen Berrevoets, Wouter Verbeke
  
• Portfolio selection using semiparametric estimators and a copula PCA based approach
  Noureddine Kouaissah (International University of Rabat, Rabat Business School )
  

• 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
  
• Computing lower bounds on the nonngative rank using a nested polytopes formulation
  Julien Dewez (Université catholique de Louvain)
  Co-authors: François Glineur
  

• Truck Driver Scheduling with Interdependent Routes
  Carlo Sartori (KU Leuven)
  Co-authors: Pieter Smet, Greet Vanden Berghe
  
• Multi-period distribution network planning with capacity reservation contracts
  Christian Clavijo López (HEC-Liège -Université de Liège)
  Co-authors: Yves Crama, Thierry Pironet, Frederic Semet
  
• Truck Scheduling in Tank Terminals
  Hatice Çalik (KU Leuven)
  Co-authors: Thomas Van den Bossche, Evert-Jan Jacobs, Tulio A. M. Toffolo, Greet Vanden Berghe
  

• Customer life event prediction using deep learning
  Arno De Caigny (IESEG School of Management)
  Co-authors: Arno De Caigny
  
• The Effect of Consumer Reviews on Assortment Planning
  Felipe Carrasco (KU Leuven)
  Co-authors: Felipe Carrasco
  
• Profit-driven churn prediction in mutual funds: a Multisegment approach
  Diego Olaya (Vrije Universiteit Brussel)
  Co-authors: Sebastian Maldonado, Gonzalo Dominguez, Wouter Verbeke
  

• A Deep Reinforcement Learning approach to the Stochastic Inventory Problem
  Henri Dehaybe (UCLouvain)
  Co-authors: Philippe Chevalier and Daniele Catanzaro
  
• Learning to optimize: a case study on a crane scheduling problem
  Jorik Jooken (KU Leuven)
  Co-authors: Pieter Leyman, Patrick De Causmaecker, Tony Wauters
  Abstract:
  In many combinatorial optimization problems, the decision variables are all discrete. Hence, the set of all feasible solutions for a given problem instance can be represented by the leaf nodes of a tree in which a value is assigned to a decision variable at every level. In many cases, this tree is too large to be completely explored to find the best solution. However, one can still obtain very good solutions by not completely exploring the tree, but rather focusing on exploring the most promising parts of the tree. An example of an algorithm that uses this idea is Monte Carlo tree search. This algorithm has already been very successful in the context of game theory, where the most notable example is AlphaGo: a computer program that was able to defeat the world champion at the board game Go. In this presentation we demonstrate that the core principles of Monte Carlo tree search for game theory can also successfully be applied in the context of a combinatorial optimization problem. The problem on which the developed methodology was tested, is a crane scheduling problem with a non-crossing constraint. The specific variant that we have concentrated on in this presentation is the variant 1D||C_Max according to the classification scheme proposed by Boysen et al. In this problem, the goal is to assign cranes to containers, stored along a straight line, in order to minimize the makespan (the latest completion time of a crane). The tree search algorithm that is discussed in this presentation can be seen as a sampling method that samples the set of all possible solutions in a biased way (it is more likely to explore promising parts of the tree). To determine how exactly a sample will be generated, the algorithm uses two different policies: a rollout policy and a solution completion policy. The rollout policy is a stochastic policy that has to be learned by the algorithm. The solution completion policy on the other hand is a deterministic heuristic. To learn the rollout policy, the algorithm makes use of policy learning and this work hereby also contributes to recent attempts that focus on integrating machine learning into a combinatorial optimization context.
  

• A dynamic programming-based guess-and-check algorithm to minimize makespan on a single machine with release date and inventory constraint
  Morteza Davari (KU Leuven)
  
• A Performance Evaluation Framework for Inventory Management Systems
  Rabin Sahu (University of Lille)
  Co-authors: Clarisse Dhaenens, Nadarajen Veerapen
  
• Lot-Sizing and Promotion Optimization
  Philippe Chevalier (UCLouvain)
  Co-authors: Alejandro Lamas
  

• A low memory alternative for time-dependent Dijkstra
  Simon Van Den Eynde (Ghent University)
  Co-authors: Jeroen Verbrugghe, Pieter Audenaert, Ben Derudder, Didier Colle, Mario Pickavet
  
• Last mile delivery with multiple shipping options
  Yuan Yuan (Centrale Lille)
  Co-authors: Diego Cattaruzza, Maxime Ogier, Frédéric Semet
  
• Multi-echelon multi-product distribution network considering heterogeneous capacitated vehicles
  Cristian Aguayo (HEC-ULiege)
  Co-authors: J. Amaya, S. Limbourg