ORBEL 32

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
Pictures

 

Speakers

Click on a name for more details
Each contributed talk will be allocated 20 minutes, including question time.
NameCo-authorsTalkSession
Maryam Abdolali
Amirkabir University of Technology (Tehran Polytechnic)
Nicolas GillisMore Robust and Scalable Sparse Subspace Clustering Based on Multi-Layered Graphs and Randomized Hierarchical ClusteringFriday 13:00 - 14:00
Babiche Aerts
University of Antwerp
T. Cornelissens, K. SorensenA decade of academic research on warehouse order picking: trends and challengesThursday 15:20 - 16:20
Imène Ait Abderrahim
University of Oran 1 Ahmed Benbella, Algeria
Algeria
Lakhdar Loukil, Thomas StützleAutomatic configuration of metaheuristics for the Q3APThursday 11:00 - 12:20
Ayse Akbalik
LCOMS, Université de Lorraine
Christophe RAPINE, Guillaume GOISQUEDynamic programming algorithms for energy constrained lot sizing problemsFriday 13:00 - 14:00
Man Shun Ang
Universite de Mons
Nicolas GillisLog-determinant Non-Negative Matrix Factorization via Successive Trace ApproximationThursday 15:20 - 16:20
Florian Arnold
University of Antwerp
Johan Springael, Kenneth SörensenVertical supply chain integration - Is routing more important than inventory management?Thursday 13:30 - 14:50
Dirk Briskorn
University of Wuppertal
Nils Boysen, Stefan Fedtke, Stefan SchwerdfegeDrone delivery from trucks: Drone scheduling for given truck routesFriday 13:00 - 14:00
Justin Buhendwa Nyenyezi
Université de Namur
Benchmarking some iterative linear systems solvers for deformable 3D images registrationThursday 13:30 - 14:50
Reshma Chirayil Chandrasekharan
KU Leuven
Tulio A. M. Toffolo, Tony WautersA constructive matheuristic strategy for the Traveling Umpire ProblemFriday 14:10 - 15:10
Jan Christiaens
KU Leuven
Tony Wauters, Greet Vanden BergheBenchmarks for the prisoner transportation problemThursday 13:30 - 14:50
Jérémy Cohen
UMONS/FNRS
Nicolas GillisSpectral Unmixing with Multiple DictionariesThursday 13:30 - 14:50
Jeroen Corstjens
Hasselt University
An Caris, Benoît DepaireAn analysis on the destroy and repair process in large neighbourhood search applied on the vehicle routing problem with time windowsThursday 16:30 - 17:10
Nguyen Dang
KU Leuven KULAK
Patrick De CausmaeckerAnalysis of algorithm components and parameters using surrogate modelling: some case studiesThursday 11:00 - 12:20
Morteza Davari
KU Leuven
Mohammad Ranjbar, Roel Leus, Patrick De CausmaeckerMinimizing makespan on a single machine with release date and inventory constraintsFriday 13:00 - 14:00
Bernard De Baets
Universiteit Gent
Raúl Pérez-Fernández, Marc SaderImproving the quality of the assessment of food samples by combining absolute and relative informationFriday 13:00 - 14:00
Jérôme De Boeck
Université Libre de Bruxelles
Luce Brotcorne, Fabio D'Andreagiovanni, Bernard FortzUnit Commitment under Market Equilibrium ConstraintsThursday 13:30 - 14:50
Kim De Boeck
KU Leuven
Raïsa Carmen, Nico VandaelePrioritization between boarding patients and patients currently waiting or under treatment in the emergency departmentThursday 11:00 - 12:20
Renaud De Landtsheer
CETIC
Quentin MeurisseGeneric Support for Global Routing Constraint in Constraint-Based Local Search FrameworksFriday 10:50 - 12:10
Christof Defryn
Maastricht University
Netherlands
Debdatta Sinha Roy, Bruce GoldenAddressing Uncertainty in Meter Reading for Utility Companies using RFID Technology: Simulation ExperimentsFriday 13:00 - 14:00
Hans Degroote
KU Leuven Kulak
Patrick De Causmaecker; José Luis González VelardeTowards Algorithm Selection for the Generalised Assignment ProblemThursday 11:00 - 12:20
Landelin Delcoucq
University of Mons
Design and implementation of a modular distributed and parallel clustering algorithmFriday 13:00 - 14:00
Reginald Dewil
Katholieke Universiteit Leuven
Ilker Küçükoglu, Corrinne Luteyn, Dirk CattrysseMulti-tool hole drilling with sequence dependent drilling timesThursday 16:30 - 17:10
Melvin Drent
University of Luxembourg
Luxembourg
Joachim ArtsStocking and Expediting in Two-Echelon Spare Parts Inventory Systems under System Availability ConstraintsFriday 13:00 - 14:00
Flavia Esposito
Università degli Studi di Bari Aldo Moro, Italy
Nicolas Gillis, Nicoletta Del BuonoOrthogonal Joint Sparse NMF for 3D-Microarray Data AnalysisThursday 15:20 - 16:20
Anna Fernández Antolín
TRANSP-OR, EPFL
Switzerland
Virginie Lurkin, Michel BierlaireMaximum likelihood estimation of discrete and continuous parameters: an MILP formulationFriday 14:10 - 15:10
Véronique François
HEC Liège - Management School of the University of Liège
Yasemin Arda, Diego Cattaruzza, Maxime OgierHome chemotherapy: optimizing the production and administration of drugs.Friday 10:50 - 12:10
Fabian Germeau
CETIC
Yoann Guyot, Gustavo Ospina, Renaud De Landtsheer, Christophe PonsardEasily Building Complex Neighbourhoods With the Cross-Product CombinatorFriday 10:50 - 12:10
Nicolas Gillis
University of Mons
Yaroslav ShitovLow-Rank Matrix Approximation in the Infinity NormThursday 13:30 - 14:50
Thomas Hacardiaux
Université catholique de Louvain
Jean-Sébastien TancrezAssessing Collaboration In Supply Chain Friday 10:50 - 12:10
Hilde Heggen
Universiteit Hasselt
An Caris, Kris BraekersThe simultaneous vehicle routing and service network design problem in intermodal rail transportationThursday 13:30 - 14:50
Ben Hermans
KULeuven
Roel LeusScheduling Markovian PERT networks to maximize the net present value: New resultsThursday 15:20 - 16:20
Jean-philippe Hubinont
ULB
José Rui Figueira, Yves De SmetExact solution methods for the bi-objective \{0, 1\}-quadratic knapsack problemThursday 11:00 - 12:20
Sarah Itani
University of Mons
Fabian Lecron & Philippe Fortemps A density-based decision tree for one-class classificationFriday 14:10 - 15:10
Farzaneh Karami
KU Leuven
Wim Vancroonenburg, Greet Vanden BergheA buffering-strategy-based solution method for the dynamic pickup and delivery problem with time windowsThursday 11:00 - 12:20
Mumtaz Karatas
National Defense University, Turkish Naval Academy
Turkey
Ertan YakiciOptimization of Emergency Service Center Locations Using an Iterative Solution ApproachThursday 11:00 - 12:20
Selma Koghee
Royal Military Academy
F. Van Utterbeeck, M. Debacker, I. Hubloue, E. DhondtExpanding the SIMEDIS simulator for studying the medical responce in disaster scenariosThursday 11:00 - 12:20
Wouter Lefever
Ghent University
El-Houssaine Aghezzaf, Khaled Hadj-HamouStochastic solutions for the Inventory-Routing Problem with TransshipmentThursday 13:30 - 14:50
Stef Lemmens
KU Leuven
Catherine Decouttere, Nico Vandaele, Mauro Bernuzzi, Amir ReichmanThe inventory/capacity trade-off with respect to the quality processes in a Guaranteed Service Vaccine Supply ChainThursday 16:30 - 17:10
Valentin Leplat
UMons
Nicolas Gillis, Xavier SiebertAudio Source Separation Using Nonnegative Matrix FactorizationThursday 15:20 - 16:20
Pieter Leyman
KU Leuven KULAK
België
Patrick De CausmaeckerWhat is the impact of a solution representation on metaheuristic performance?Friday 10:50 - 12:10
Virginie Lurkin
École polytechnique fédérale de Lausanne
Suisse
A. Zanarini, S.S. Azadeh, Y. Maknoon, M. BierlairePlanning of feeding station installment and battery sizing for an electric urban bus networkFriday 10:50 - 12:10
Corrinne Luteyn
KU Leuven
Pieter VansteenwegenImproving the Last Mile Logistics in a City Area by Changing Time WindowsThursday 11:00 - 12:20
Oussama Mazari Abdessameud
VUB
Filip Van Utterbeeck, Johan Van Kerckhoven, Marie-Anne GuerryMilitary manpower planning through a career path approachThursday 11:00 - 12:20
Stefano Michelini
HEC Liège - Management School of the University of Liège
Yasemin Arda, Hande KüçükaydinA comparative study of branch-and-price algorithms for a vehicle routing problem with time windows and waiting time costsThursday 11:00 - 12:20
Yves Molenbruch
Hasselt University
Kris BraekersIntegrating dial-a-ride services and public transportThursday 13:30 - 14:50
Stef Moons
UHasselt - Hasselt University
Kris Braekers, Katrien Ramaekers, An Caris, Yasemin ArdaSolving an integrated order picking-vehicle routing problem with record-to-record travelThursday 13:30 - 14:50
Federico Mosquera
KU Leuven
Pieter Smet, Greet Vanden BergheAnalyzing objective interaction in lexicographic optimizationThursday 11:00 - 12:20
Boris Ndjia Njike
Université de Mons
Xavier SiebertRisk bounds on statistical learningFriday 14:10 - 15:10
Meritxell Pacheco Paneque
TRANSP-OR EPFL
Switzerland
Shadi Sharif Azadeh, Michel Bierlaire, Bernard GendronIntegrating advanced discrete choice models in mixed integer linear optimizationFriday 14:10 - 15:10
Raúl Pérez Fernández
Ghent University
Bernard De BaetsOn facility location problems and penalty-based aggregationFriday 13:00 - 14:00
Tu San Pham
KU Leuven
Jo Devriendt, Patrick De CausmaeckerFormalize neighbourhoods for local search using predicate logicFriday 10:50 - 12:10
José Miguel Quesada PÉrez
Université catholique de Louvain
Jean-Charles Lange, Jean-Sébastien TancrezConsidering complex routes in the Express Shipment Service Network Design problemFriday 10:50 - 12:10
Elisabeth Rodriguez Heck
HEC Liège - Management School of the University of Liège
Yves CramaLinear and quadratic reformulation techniques for nonlinear 0-1 optimization problemsThursday 13:30 - 14:50
Jean Rosenfeld
Université libre de Bruxelles
Van Assche Dimitri, De Smet YvesExtensions of PROMETHEE to multicriteria clustering: recent developmentsFriday 13:00 - 14:00
Nico André Schmid
Ghent University
Veronique LimèreOptimizing line feeding under consideration of variable space constraintsThursday 15:20 - 16:20
Punit Sharma
University of Mons
Nicolas GillisOn computing the distances to stability for matricesThursday 13:30 - 14:50
Xavier Siebert
Faculté Polytechnique de Mons
Nouara Bellahdid, Moncef AbbasComparison of active learning classification strategiesFriday 14:10 - 15:10
 Abstract:
Modern technologies constantly produce huge quantities of data. Because these data are often plain and unlabeled, a particular class of machine learning algorithms is devoted to help in the data annotation process. In the setting considered in this paper, the algorithm interacts with an oracle (e.g., a domain expert) to label instances from an unlabeled data set. The goal of active learning is to reduce the labeling effort from the oracle while achieving a good classification. One way to achieve this is to carefully choose which unlabeled instance to provide to the oracle such that it most improves the classifier performance. Active learning therefore consists in finding the most informative and representative sample. Informativeness measures the impact in reducing the generalization error of the model, while representativeness considers how the sample represents the underlying distribution. In early active learning research the approaches were based on informativeness, with methods such as uncertainty sampling, or query by committee. These approaches thus ignore the distribution of the data. To overcome this issue, active learning algorithms that exploit the structure of the data have been proposed. Among them, approaches based on the representativeness criterion have proved quite successful, such as clustering methods and optimal experiment design. Various approaches combining the two criteria have been studied: methods based on the informativeness of uncertainty sampling or query by committee, and a measure of density to discover the representativeness criterion, others methods combine the informativeness with semi-supervised algorithms that provide the representativeness. In this work, we review several active learning classification strategies and illustrate them with simulations to provide a comparative study between these strategies.
Bart Smeulders
HEC Liège - Management School of the University of Liège
Yves Crama, Frits C.R. SpieksmaRobust Kidney Exchange ProgramsFriday 10:50 - 12:10
Guopeng Song
KU Leuven
Daniel Kowalczyk, Roel LeusThe Robust Machine Availability ProblemThursday 15:20 - 16:20
Ayman Srour
Ku leuven
Patrick De CausmaeckerSearching the Design Space of Adaptive Evolutionary AlgorithmsThursday 11:00 - 12:20
Charlotte Tannier
N-SIDE
Benoit David, Sebastien CoppeOptimization tool for the drug manufacturing in the pharmaceutical industryThursday 16:30 - 17:10
Emmanouil Thanos
KU Leuven
Tony Wauters, Greet Vanden BergheScheduling container transportation with capacitated vehicles through conflict-free trajectories: A local search approachThursday 15:20 - 16:20
Renata Turkes
University of Antwerp
Kenneth Sörensen, Daniel Palhazi CuervoA matheuristic for the problem of pre-positioning relief suppliesFriday 10:50 - 12:10
David Van Bulck
Ghent University
Dries GoossensScheduling time-relaxed double round-robin tournaments with availability constraintsFriday 14:10 - 15:10
Jens Van Engeland
KU Leuven Campus Brussel
Carolien LavigneA model for container collection in a local recycle networkThursday 11:00 - 12:20
Teun Van Gils
Hasselt University
Katrien Ramaekers & An CarisReducing Picker Blocking in a Real-life Narrow-Aisle Spare Parts WarehouseThursday 16:30 - 17:10
Michiel Van Lancker
KU Leuven
Greet Vanden Berghe, Tony WautersIntermodal Rail-Road Terminal OperationsThursday 16:30 - 17:10
Sofie Van Thielen
KU Leuven
Pieter VansteenwegenCreating a dynamic impact zone for conflict prevention in real-time railway traffic managementThursday 16:30 - 17:10
Lien Vanbrabant
Hasselt University
Niels Martin, Katrien Ramaekers, Kris BraekersInput data quality assessment in the context of emergency department simulationsThursday 11:00 - 12:20
Wim Vancroonenburg
KU Leuven - FWO
Andrea Grosso, Fabio SalassaThe maximum covering cycle problemThursday 13:30 - 14:50
Mathieu Vandenberghe
Ghent University
België
Stijn De Vuyst ; El-Houssaine Aghezzaf ; Herwig BruneelProtecting operating room schedules against emergency surgeries: outlook on new stochastic optimization modelsThursday 11:00 - 12:20
Bart Vangerven
Bergische Universität Wuppertal
Dries R. Goossens, Frits C.R. SpieksmaCoordination and threshold problems in combinatorial auctionsFriday 13:00 - 14:00
Sarah Vanheusden
Hasselt University, research group logistics
Iterated local search algorithm for solving operational workload imbalances in order pickingThursday 15:20 - 16:20
Evert Vermeir
KU Leuven
Pieter VansteenwegenLocal evaluation techniques in bus line planningThursday 13:30 - 14:50
Hendrik Vermuyten
KU Leuven, Campus Brussels
Joana Namorado Rosa; Inês Marques; Jeroen Beliën; Ana Barbosa-PóvoaStaff Scheduling at a Medical Emergency Service: a case study at Instituto Nacional de Emergência MédicaFriday 10:50 - 12:10
Joris Walraevens
Ghent University
Tom Maertens, Sabine WittevrongelGiving Priority Access to Freight Vehicles at Signalized IntersectionsThursday 16:30 - 17:10
Toni Wickert
KU Leuven
Federico Mosquera, Pieter Smet, Emmanouil ThanosOptimizing city-wide vehicle allocation for car sharingThursday 13:30 - 14:50
Ertan Yakici
National Defense University, Turkish Naval Academy
Turkey
Mumtaz Karatas, Oktay YilmazA UAV Location and Routing Problem with Synchronization ConstraintsFriday 13:00 - 14:00
Xia-jie Yi
Ghent University
Dries GoossensCombined proactive and reactive strategies for round robin football schedulingFriday 14:10 - 15:10
Yi-hang Zhu
KU Leuven
Túlio A. M. Toffolo, Wim Vancroonenburg, Greet Vanden BergheAn analysis of short term objectives for dynamic patient admission schedulingFriday 10:50 - 12:10
80 talks

 
 
  ORBEL - Conference chair: Prof. A. Arda - Platform: Prof. M. Schyns.