| Name | Co-authors | Talk | Session |
Romain Absil
UMons | | Price on symmetrisation and average distance | Thursday 16:10-17:25 | |
Behrouz Babaki
KU Leuven
| Tias Guns, Siegfried Nijssen | Constrained Clustering using Column Generation | Friday 14:00-15:40 | |
Raymond Bisdorff
University of Luxembourg
Luxembourg | | On weak ordering by choosing from valued outranking relations | Friday 9:00-10:15 | |
Kris Braekers
Universiteit Hasselt | An Caris, Gerrit K. Janssens | Exact and meta-heuristic algorithm for the multi-depot heterogeneous dial-a-ride problem | Thursday 11:15-12:30 | |
Willem K. M. Brauers
Vilnius Gediminas Technical University and University of Antwerp | | Investment in Shares by MULTIMOORA Multiple Objectives Optimization | Thursday 14:00-15:40 | |
Valerie Brison
UMONS
| Marc Pirlot | A Choquet integral for the comparison of decisional maps | Thursday 14:00-15:40 | |
Quoc Trung Bui
Université catholique de Louvain
| Yves Deville, Pham Quang Dung | Solving the Elementary Longest Path as a Mixed Integer Program | Thursday 16:10-17:25 | |
Carlos Casorrán-amilburu
ULB
Belgique. | Bernard Fortz, Martine Labbé, Fernando Ordóñez | Novel Formulations for Stackelberg Security Games | Friday 9:00-10:15 | |
Nacira Chikhi
USTHB /AMCD&RO UVHC/LAMIH
| M. Abbas, A. Bekrar, R. Benmansour and S.Hanafi | A dynamic programming algorithm for a robotic cell problem with batch transfer | Thursday 16:10-17:25 | |
Jan Christiaens
KU Leuven | J. Verstichel, G. Vanden Berghe | A Heuristic Approach to Minimize the Number of Shifts in Container Ship Stowage Plans | Thursday 14:00-15:40 | |
Yves Crama
HEC - University of Liege | M. Anthony, E. Boros, A. Gruber | Quadratic reformulations of nonlinear binary optimization problems | Thursday 16:10-17:25 | |
Nguyen Thi Thanh Dang
KU Leuven KULAK | Patrick De Causmaecker | Motivations for the development of a multi-objective algorithm configurator | Thursday 14:00-15:40 | |
Annelies De Corte
University of Antwerp
| Kenneth Sörensen | ILS for water distribution network optimisation | Thursday 11:15-12:30 | |
Geoffrey De Smet
Red Hat | | Cloud optimization with OptaPlanner | Thursday 11:15-12:30 | |
Yves De Smet
Université Libre de Bruxelles | | Multicriteria clustering: a summary of recent investigations | Friday 9:00-10:15 | |
Daniel De Wolf
Université du Littoral Côte d'Opale
France | Jean ANDRE, Stephane AURAY,Mohamed-Mahmoud MEMMAH | Time Development of new Hydrogen Transmission Pipeline Networks for Franc | Thursday 14:00-15:40 | |
Christof Defryn
University of Antwerp
| Kenneth Sörensen | Gain sharing in a collaborative selective vehicle routing problem | Thursday 14:00-15:40 | |
Julien Dewez
Université catholique de Louvain
| Nicolas Gillis, François Glineur | Geometrical lower bound for the nonnegative rank of slack matrices | Friday 14:00-15:40 | |
Reginald Dewil
KU Leuven | P. Vansteenwegen, D. Cattrysse, D. Van Oudheusden | Improved Model for the Maximum Covering and Patrol Routing Problem | Thursday 16:10-17:25 | |
Thijs Dewilde
KU Leuven
| S. Burggraeve, T. Ameye, P. Sels, D. Cattrysse, P. Vansteenwegen | The impact of preprocessing for solving the train routing problem | Thursday 16:10-17:25 | |
Darpana Dilip
Unversity of Antwerp
Belgium | Prof. dr. Kenneth Sörensen | The City Bike Repositioning Problem | Thursday 11:15-12:30 | |
Nguyen Anh Vu Doan
Université libre de Bruxelles | Dragomir Milojevic, Frederic Robert, Yves De Smet | Multi-Objective Optimization for the Design of 3D-Stacked Integrated Circuits | Thursday 14:00-15:40 | |
Stefan Eppe
Université libre de Bruxelles | Yves De Smet | An empirical distribution-based approximation of PROMETHEE II's net flow scores | Thursday 16:10-17:25 | |
Dries Goossens
Ghent University | Frits Spieksma | The carry-over effect does exist in tennis | Friday 14:00-15:40 | |
Massimo Gurrieri
UMONS
| Philippe Fortemps, Xavier Siebert | Alternative Pairwise Decomposition Techniques for Label Ranking | Friday 14:00-15:40 | |
Dorien Herremans
Universiteit Antwerpen | Kenneth Sörensen, Darrell Conklin | First species counterpoint music generation with VNS and vertical viewpoints | Thursday 14:00-15:40 | |
Alessandro Hill
University of Antwerp | Stefan Voss | Optimal capacitated ring trees | Thursday 14:00-15:40 | |
Anne-sophie Hoffait
HEC - University of Liege
| M;Schyns | Early detection of university students in potential difficulty | Thursday 14:00-15:40 | |
| | Abstract:
Access to the Belgian higher education system is easier and cheaper than in most foreign countries. Moreover, the quality of our Universities is acknowledged and the degrees they deliver could be considered as a must.
As a consequence, lots of candidates apply.
However, while access is relatively open, it is not a free lunch and a large proportion of candidates do not satisfy the requirements at the end of the first year. This has a cost for the students (fees, one year lost, frustration...) but also for the collectivity (the Universities are funded by the Government) and for the Universities (lots of ressources are needed).
It is therefore important to try to identify as early as possible the students that could potentially be in difficulty during the first year. The Universities might then take appropriate measures to alleviate the problem.
There are indeed various reasons that could explain a failure and some that could be dealt with: a wrong orientation (e.g. due to a lack of correct information), a misinterpretation of the requirements and expectations of a university degree, a huge difficulty in making the transition from the high education system to the higher education system, an insufficient mastery of some prerequisite concepts... The University of Li\`ege, as other Universities, has already taken different initiatives. But, if we were able to early identify with a high probability those students, the Universities might develop adapted methods to attack the problem with more emphasis where it is more needed and when it is still possible.
Our contribution is multiple. First, the aim is to develop a decision tool able to identify the students who have a high probability to face difficulties if nothing is done to help them. For that, we consider three standard datamining methods: logistic regression, artificial neural networks and decision trees and focus on early detection, i.e. before starting at the University.
Secondly, we suggest to adapt these three methods as well as the classification framework in order to increase the probability of correct identification of the students. In our approach,we do not restrict the classification to two extreme classes, e.g. failure or succes, but we create subcategories for different levels of confidence: high risk of failure, risk of failure, expected success or high probability of success. The algorithms are modified accordingly and to give more weight to the class that really matters.
Note that this approach remains valid for any other classification problems for which the focus is on some extreme classes; e.g. fraud detection, credit default...
Finally, simulations are conducted to measure the performances of the three methods, with and without the suggested adaptation. We check if the factors of success/failure we can identify are similar to those reported in the literature.
We also make a ``what-if sensitivity analysis''. The goal is to measure in more depth the impact of some factors and the impact of some solutions, e.g., a complementary training or a reorientation.
|
Vinasetan Houndji
Université Catholique de Louvain | Pierre Schaus, Laurence Wolsey | CP Approach for the Multi-Item Discrete Lot-Sizing Problem with Sequence-Dependent Changeover Costs | Friday 9:00-10:15 | |
Tanguy Kegelart
Université catholique de Louvain, Louvain School of Management | Mathieu Van Vyve | A Conic Optimization Approach to SKU Rationalization | Thursday 16:10-17:25 | |
Pierre L. Kunsch
ULB | Jean Friesewinkel | A system-dynamics analysis of the energy transition in Belgium after Fukushima | Thursday 11:15-12:30 | |
Hande Küçükaydin
University of Liège | Yasemin Arda, Yves Crama | An Exact Bi-directional Dynamic Programming Algorithm for an Elementary Shortest Path Problem with Variable Service Start Time | Friday 14:00-15:40 | |
Ben Lauwens
Koninklijke Militaire School | | Diffusion approximation of the virtual delay in two queueing systems coupled by their service process | Friday 9:00-10:15 | |
Manuel LÓpez-ibaÑez
Université Libre de Bruxelles | Leonardo C. T. Bezerra and Thomas Stützle | Deconstructing Multi-Objective Evolutionary Algorithms | Thursday 14:00-15:40 | |
Corrinne Luteyn
KU Leuven
België | Pieter Vansteenwegen | Maximizing User Benefits by Changes in Incomplete Networks | Thursday 14:00-15:40 | |
Thierry Marchant
Ghent University | Denis Bouyssou | An interpretable axiomatization of the h-index | Friday 9:00-10:15 | |
Willem Mélange
Ghent University
| Herwig Bruneel, Dieter Claeys, Joris Walraevens | A discrete-time queueing model with constant service times and blocking | Friday 9:00-10:15 | |
Hadrien Mélot
Université de Mons, Departement d'Informatique, Faculté des Sciences
Mons | A. Hertz | Number of non-equivalent colorings of a graph | Thursday 16:10-17:25 | |
Mohand Mezmaz
University of Mons
| M. Mezmaz, A. Vandaele, D. Tuyttens, S. Itani and N. Melab | Towards a Lightning-Inspired Meta-heuristic | Friday 14:00-15:40 | |
Mohand Mezmaz
University of Mons
| R. Leroy, M. Mezmaz, N. Melab and D. Tuyttens | Using factorial number system to solve permutation optimization problems | Thursday 11:15-12:30 | |
Yves Molenbruch
Hasselt University | An Caris, Kris Braekers | Operational Effects of Variations in Service Level Criteria for the Dial-a-Ride Problem | Thursday 11:15-12:30 | |
Martim Moniz
Université Libre de Bruxelles | Bernard Fortz; Luís Gouveia | Models for traffic engineering with multiple spanning tree protocols | Thursday 14:00-15:40 | |
Daniel Palhazi Cuervo
University of Antwerp | Peter Goos, Roselinde Kessels and Kenneth Sörensen | Understanding people’s preferences: an integrated algorithm for the optimal design of discrete choice experiments with partial profiles | Thursday 16:10-17:25 | |
Célia Paquay
HEC - University of Liege | M. Schyns and S. Limbourg | A relax-and-fi x heuristic for the three-dimensional bin-packing model with transportation constraints | Thursday 14:00-15:40 | |
Ward Passchyn
KU Leuven
| F.C.R. Spieksma | Dynamic Programming for Scheduling Locks in Sequence | Thursday 16:10-17:25 | |
Thierry Pironet
HEC - University of Liege | Yves CRAMA | Multi-period vehicle assignment with stochastic load availability | Friday 14:00-15:40 | |
Hanne Pollaris
Hasselt University | Kris Braekers, An Caris, Gerrit K. Janssens | Incorporating axle weight restrictions in a two-dimensional CVRP | Friday 14:00-15:40 | |
Christophe Ponsard
CETIC | Renaud De Landtsheer, Yoann Guyot | A high-level, modular and declarative modeling framework for routing problems | Thursday 11:15-12:30 | |
Antonio M. Rodriguez-chia
Université Libre de Bruxelles (ULB) | I. Espejo (U. de Cádiz); A. Marín (U. de Murcia) | p-center problem with failure foresight and capacity constraints | Thursday 11:15-12:30 | |
Renaud Sarrazin
University of Brussels | Yves De Smet | Design safer and greener road projects by using a multiobjective optimization approach | Thursday 14:00-15:40 | |
Xavier Siebert
Faculté Polytechnique de Mons | Thierry Ravet, Christian Frisson, Stéphane Dupont | MediaCycle : A tool for interactive browsing of multimedia libraries. | Thursday 14:00-15:40 | |
Gilles Sinnaeve
Université Catholique de Louvain | Claire Beguin, Philippe Chevalier & Marianne Philippe | Using computer simulation to test a short stay unit | Friday 14:00-15:40 | |
Pieter Smet
KU Leuven, campus Gent | Greet Vanden Berghe | Integrated task scheduling and personnel rostering problems | Thursday 11:15-12:30 | |
Bart Smeulders
KU Leuven
| Frits C.R. Spieksma | Heuristics for Varian's Index | Thursday 14:00-15:40 | |
Olivier Sobrie
University of Mons / Ecole Centrale Paris
| Olivier Sobrie | Learning a majority rule model from large sets of assignment examples | Thursday 16:10-17:25 | |
Frits Spieksma
KU Leuven | T. Dokka and I. Mourtos | On the complexity of separation: the three-index assignment problem | Friday 9:00-10:15 | |
Thomas Stützle
Université Libre de Bruxelles (ULB) | Tianjun Liao | A simple and high-performing competitive--cooperative hybrid algorithm for black-box continuous optimization | Friday 14:00-15:40 | |
Luca Talarico
University of Antwerp | K. Sörensen, J. Springael | An iterative approach to generate k dissimilar VRP solutions | Thursday 16:10-17:25 | |
Jean-sébastien Tancrez
Louvain School of Management, Université catholique de Louvain | Joana M. Comas-Marti, Ralf W. Seifert | Effects of Carbon Footprint Reduction on Supply Chain Network Design | Thursday 11:15-12:30 | |
Claudio Telha Cornejo
Université Catolique de Louvain
| Mathieu Van Vyve | Competitive analysis of on-line algorithms : applications to Operations Research. | Friday 9:00-10:15 | |
Tulio Toffolo
KU Leuven | Haroldo G. Santos, Rafael Martinelli, Rafael A.M. Gomes, Greet Vanden Berghe | IP Techniques for Nurse Rostering Problem | Friday 14:00-15:40 | |
Christophe Ullrich
Royal Military Academy | C. Ullrich, F. Van Utterbeeck, E. Dhondt and M. Debacker | SIMEDIS disaster management simulator: aeronautical catastrophe | Friday 14:00-15:40 | |
Sam Van Malderen
KU Leuven, Department of Computer Science, CODeS & iMinds-ITEC | Tony Wauters, Greet Vanden Berghe | Improved Results for the Traveling Umpire Problem | Thursday 11:15-12:30 | |
Willem Van Onsem
KU Leuven | Bart Demoen and Patrick De Causmaecker | Hyper-Criticism: A critical reflection on todays Hyper-heuristics. | Friday 14:00-15:40 | |
Wim Vancroonenburg
KU Leuven | Patrick De Causmaecker, Frits Spieksma, Greet Vanden Berghe | Integrating patient-to-room assignment planning with elective admission scheduling | Friday 14:00-15:40 | |
Arnaud Vandaele
UMONS, Faculté Polytechnique | Daniel Tuyttens | Exact resolution of the Cover Printing Problem | Friday 9:00-10:15 | |
Christine Vanovermeire
University of Antwerp
| Daniel Palhazi Cuervo; Kenneth Sörensen | Estimating collaborative profits under varying partner characteristics and strategies | Thursday 14:00-15:40 | |
Cédric Verbeeck
Ghent University | P. Vansteenwegen, E.-H. Aghezzaf | Solution methods for the cycle trip planning problem | Thursday 14:00-15:40 | |
Lotte Verdonck
Hasselt University | An Caris, Katrien Ramaekers, Gerrit K. Janssens | Horizontal cooperation in logistics : Order sharing through joint route planning | Friday 14:00-15:40 | |
Derek Verleye
Ghent University | Derek Verleye | A hybrid piecewise-linear/Newton's method with corrected Jacobian matrix for multi-period water production and distribution in large networks | Thursday 16:10-17:25 | |
Jannes Verstichel
KU Leuven campus Gent | Joris Kinable, Patrick De Causmaecker, Greet Vanden Berghe | A Combinatorial Benders' decomposition for the lock scheduling problem | Thursday 16:10-17:25 | |
Alessia Violin
Université Libre de Bruxelles | Bernard Fortz, Martine Labbé | A Branch-and-Price Algorithm for the Network Pricing Problem with Connected Toll Arcs | Thursday 14:00-15:40 | |
Tony Wauters
KU Leuven, Department of Computer Science, CODeS - iMinds-ITEC | Sam Van Malderen, Greet Vanden Berghe | Local search approaches for 2D nesting problems | Friday 9:00-10:15 | |
Christophe Wilbaut
University of Valenciennes
France | S. Hanafi, A. Fréville,B. Haddar, M. Khemakhem | Some Heuristic Algorithms for the 0-1Knapsack Sharing Problem | Friday 14:00-15:40 | |
Sabine Wittevrongel
Ghent University | H. Bruneel, W. Rogiest, J. Walraevens and S. Wittevrongel | Analysis of a discrete-time queue with constant service capacity | Friday 9:00-10:15 | |
75 talks
