Schedule

• A comparative study of branch-and-price algorithms for a vehicle routing problem with time windows and waiting time costs
  Stefano Michelini (HEC Liège - Management School of the University of Liège)
  Co-authors: Yasemin Arda, Hande Küçükaydin
  
• A model for container collection in a local recycle network
  Jens Van Engeland (KU Leuven Campus Brussel)
  Co-authors: Carolien Lavigne
  
• Improving the Last Mile Logistics in a City Area by Changing Time Windows
  Corrinne Luteyn (KU Leuven)
  Co-authors: Pieter Vansteenwegen
  
• A buffering-strategy-based solution method for the dynamic pickup and delivery problem with time windows
  Farzaneh Karami (KU Leuven)
  Co-authors: Wim Vancroonenburg, Greet Vanden Berghe
  

• Input data quality assessment in the context of emergency department simulations
  Lien Vanbrabant (Hasselt University)
  Co-authors: Niels Martin, Katrien Ramaekers, Kris Braekers
  
• Expanding the SIMEDIS simulator for studying the medical responce in disaster scenarios
  Selma Koghee (Royal Military Academy)
  Co-authors: F. Van Utterbeeck, M. Debacker, I. Hubloue, E. Dhondt
  
• Prioritization between boarding patients and patients currently waiting or under treatment in the emergency department
  Kim De Boeck (KU Leuven)
  Co-authors: Raïsa Carmen, Nico Vandaele
  
• Protecting operating room schedules against emergency surgeries: outlook on new stochastic optimization models
  Mathieu Vandenberghe (Ghent University)
  Co-authors: Stijn De Vuyst ; El-Houssaine Aghezzaf ; Herwig Bruneel
  

• Towards Algorithm Selection for the Generalised Assignment Problem
  Hans Degroote (KU Leuven Kulak)
  Co-authors: Patrick De Causmaecker; José Luis González Velarde
  
• Searching the Design Space of Adaptive Evolutionary Algorithms
  Ayman Srour (Ku leuven)
  Co-authors: Patrick De Causmaecker
  
• Analysis of algorithm components and parameters using surrogate modelling: some case studies
  Nguyen Dang (KU Leuven KULAK)
  Co-authors: Patrick De Causmaecker
  
• Automatic configuration of metaheuristics for the Q3AP
  Imène Ait Abderrahim (University of Oran 1 Ahmed Benbella, Algeria)
  Co-authors: Lakhdar Loukil, Thomas Stützle
  

• Exact solution methods for the bi-objective \{0, 1\}-quadratic knapsack problem
  Jean-philippe Hubinont (ULB)
  Co-authors: José Rui Figueira, Yves De Smet
  
• Analyzing objective interaction in lexicographic optimization
  Federico Mosquera (KU Leuven)
  Co-authors: Pieter Smet, Greet Vanden Berghe
  
• Military manpower planning through a career path approach
  Oussama Mazari Abdessameud (VUB)
  Co-authors: Filip Van Utterbeeck, Johan Van Kerckhoven, Marie-Anne Guerry
  
• Optimization of Emergency Service Center Locations Using an Iterative Solution Approach
  Mumtaz Karatas (National Defense University, Turkish Naval Academy)
  Co-authors: Ertan Yakici
  

• Vertical supply chain integration - Is routing more important than inventory management?
  Florian Arnold (University of Antwerp)
  Co-authors: Johan Springael, Kenneth Sörensen
  
• Stochastic solutions for the Inventory-Routing Problem with Transshipment
  Wouter Lefever (Ghent University)
  Co-authors: El-Houssaine Aghezzaf, Khaled Hadj-Hamou
  
• Solving an integrated order picking-vehicle routing problem with record-to-record travel
  Stef Moons (UHasselt - Hasselt University)
  Co-authors: Kris Braekers, Katrien Ramaekers, An Caris, Yasemin Arda
  
• The simultaneous vehicle routing and service network design problem in intermodal rail transportation
  Hilde Heggen (Universiteit Hasselt)
  Co-authors: An Caris, Kris Braekers
  

• Local evaluation techniques in bus line planning
  Evert Vermeir (KU Leuven)
  Co-authors: Pieter Vansteenwegen
  
• Integrating dial-a-ride services and public transport
  Yves Molenbruch (Hasselt University)
  Co-authors: Kris Braekers
  
• Benchmarks for the prisoner transportation problem
  Jan Christiaens (KU Leuven)
  Co-authors: Tony Wauters, Greet Vanden Berghe
  
• Optimizing city-wide vehicle allocation for car sharing
  Toni Wickert (KU Leuven)
  Co-authors: Federico Mosquera, Pieter Smet, Emmanouil Thanos
  

• On computing the distances to stability for matrices
  Punit Sharma (University of Mons)
  Co-authors: Nicolas Gillis
  
• Low-Rank Matrix Approximation in the Infinity Norm
  Nicolas Gillis (University of Mons)
  Co-authors: Yaroslav Shitov
  
• Benchmarking some iterative linear systems solvers for deformable 3D images registration
  Justin Buhendwa Nyenyezi (Université de Namur)
  
• Spectral Unmixing with Multiple Dictionaries
  Jérémy Cohen (UMONS/FNRS)
  Co-authors: Nicolas Gillis
  

• The maximum covering cycle problem
  Wim Vancroonenburg (KU Leuven - FWO)
  Co-authors: Andrea Grosso, Fabio Salassa
  
• Linear and quadratic reformulation techniques for nonlinear 0-1 optimization problems
  Elisabeth Rodriguez Heck (HEC Liège - Management School of the University of Liège)
  Co-authors: Yves Crama
  
• Unit Commitment under Market Equilibrium Constraints
  Jérôme De Boeck (Université Libre de Bruxelles)
  Co-authors: Luce Brotcorne, Fabio D'Andreagiovanni, Bernard Fortz
  

• A decade of academic research on warehouse order picking: trends and challenges
  Babiche Aerts (University of Antwerp)
  Co-authors: T. Cornelissens, K. Sorensen
  
• Iterated local search algorithm for solving operational workload imbalances in order picking
  Sarah Vanheusden (Hasselt University, research group logistics)
  
• Scheduling container transportation with capacitated vehicles through conflict-free trajectories: A local search approach
  Emmanouil Thanos (KU Leuven)
  Co-authors: Tony Wauters, Greet Vanden Berghe
  

• The Robust Machine Availability Problem
  Guopeng Song (KU Leuven)
  Co-authors: Daniel Kowalczyk, Roel Leus
  
• Optimizing line feeding under consideration of variable space constraints
  Nico André Schmid (Ghent University)
  Co-authors: Veronique Limère
  
• Scheduling Markovian PERT networks to maximize the net present value: New results
  Ben Hermans (KULeuven)
  Co-authors: Roel Leus
  

• Log-determinant Non-Negative Matrix Factorization via Successive Trace Approximation
  Man Shun Ang (Universite de Mons)
  Co-authors: Nicolas Gillis
  
• Audio Source Separation Using Nonnegative Matrix Factorization
  Valentin Leplat (UMons)
  Co-authors: Nicolas Gillis, Xavier Siebert
  
• Orthogonal Joint Sparse NMF for 3D-Microarray Data Analysis
  Flavia Esposito (Università degli Studi di Bari Aldo Moro, Italy)
  Co-authors: Nicolas Gillis, Nicoletta Del Buono
  

• Intermodal Rail-Road Terminal Operations
  Michiel Van Lancker (KU Leuven)
  Co-authors: Greet Vanden Berghe, Tony Wauters
  
• Reducing Picker Blocking in a Real-life Narrow-Aisle Spare Parts Warehouse
  Teun Van Gils (Hasselt University)
  Co-authors: Katrien Ramaekers & An Caris
  

• An analysis on the destroy and repair process in large neighbourhood search applied on the vehicle routing problem with time windows
  Jeroen Corstjens (Hasselt University)
  Co-authors: An Caris, Benoît Depaire
  
• Multi-tool hole drilling with sequence dependent drilling times
  Reginald Dewil (Katholieke Universiteit Leuven)
  Co-authors: Ilker Küçükoglu, Corrinne Luteyn, Dirk Cattrysse
  

• Giving Priority Access to Freight Vehicles at Signalized Intersections
  Joris Walraevens (Ghent University)
  Co-authors: Tom Maertens, Sabine Wittevrongel
  
• Creating a dynamic impact zone for conflict prevention in real-time railway traffic management
  Sofie Van Thielen (KU Leuven)
  Co-authors: Pieter Vansteenwegen
  

• The inventory/capacity trade-off with respect to the quality processes in a Guaranteed Service Vaccine Supply Chain
  Stef Lemmens (KU Leuven)
  Co-authors: Catherine Decouttere, Nico Vandaele, Mauro Bernuzzi, Amir Reichman
  
• Optimization tool for the drug manufacturing in the pharmaceutical industry
  Charlotte Tannier (N-SIDE)
  Co-authors: Benoit David, Sebastien Coppe
  

• Staff Scheduling at a Medical Emergency Service: a case study at Instituto Nacional de Emergência Médica
  Hendrik Vermuyten (KU Leuven, Campus Brussels)
  Co-authors: Joana Namorado Rosa; Inês Marques; Jeroen Beliën; Ana Barbosa-Póvoa
  
• Home chemotherapy: optimizing the production and administration of drugs.
  Véronique François (HEC Liège - Management School of the University of Liège)
  Co-authors: Yasemin Arda, Diego Cattaruzza, Maxime Ogier
  
• An analysis of short term objectives for dynamic patient admission scheduling
  Yi-hang Zhu (KU Leuven)
  Co-authors: Túlio A. M. Toffolo, Wim Vancroonenburg, Greet Vanden Berghe
  
• Robust Kidney Exchange Programs
  Bart Smeulders (HEC Liège - Management School of the University of Liège)
  Co-authors: Yves Crama, Frits C.R. Spieksma
  

• Considering complex routes in the Express Shipment Service Network Design problem
  José Miguel Quesada PÉrez (Université catholique de Louvain)
  Co-authors: Jean-Charles Lange, Jean-Sébastien Tancrez
  
• Assessing Collaboration In Supply Chain
  Thomas Hacardiaux (Université catholique de Louvain)
  Co-authors: Jean-Sébastien Tancrez
  
• Planning of feeding station installment and battery sizing for an electric urban bus network
  Virginie Lurkin (École polytechnique fédérale de Lausanne)
  Co-authors: A. Zanarini, S.S. Azadeh, Y. Maknoon, M. Bierlaire
  
• A matheuristic for the problem of pre-positioning relief supplies
  Renata Turkes (University of Antwerp)
  Co-authors: Kenneth Sörensen, Daniel Palhazi Cuervo
  

• Easily Building Complex Neighbourhoods With the Cross-Product Combinator
  Fabian Germeau (CETIC)
  Co-authors: Yoann Guyot, Gustavo Ospina, Renaud De Landtsheer, Christophe Ponsard
  
• Generic Support for Global Routing Constraint in Constraint-Based Local Search Frameworks
  Renaud De Landtsheer (CETIC)
  Co-authors: Quentin Meurisse
  
• Formalize neighbourhoods for local search using predicate logic
  Tu San Pham (KU Leuven)
  Co-authors: Jo Devriendt, Patrick De Causmaecker
  Abstract:
  Local search heuristics are powerful approaches to solve difficult combinatorial optimization problems and are particularly suitable for large size problems. However, local search approaches are often expressed in low-level concepts, which are not suitably formal to allow for modularity and reusability. Related to this issue, Swan et. al. point out the need of a pure-functional description of local search and metaheuristics. Lastly, Hooker opined in that “Since modelling is the master and computation the servant, no computational method should presume to have its own solver. [...] Exact methods should evolve gracefully into inexact and heuristic methods as the problem scales up.” The above issues inspire our work on formalizing local search heuristics, which should lead to modular, reusable and machine-interpretable formalizations of local search heuristics. A local search heuristic consists of 3 layers: search strategy, neighbourhood moves and evaluation machinery. While the first and last layers are most likely problem independent, neighbourhood moves are usually problem-specific. Given a set of neighbourhoods moves, several local search heuristics can be created for a single problem. Small changes in problem requirements are also easy to be taken into account without affecting most of the neighbourhoods and the general algorithms. Therefore, formalizing neighbourhood moves is the first step towards formalizing local search heuristics. In this work, we formally describe neighbourhood moves and their corresponding move evaluations in FO(.), a rich extension of first-order logic, in which a problem’s constraints and objective function can also be formalized. We also extend IDP, an automated reasoning system , with built-in local search heuristics, e.g. first improvement search, best improvement search and local search, to obtain a framework that employs the modular neighbourhood formalizations to simulate a local search algorithm. This framework is demonstrated by reusing the formalizations of three different optimization problems: the Travelling Salesman Problem, the assignment problem and the colouring violations problems. The numerical results show the feasibility of our work.
  
• What is the impact of a solution representation on metaheuristic performance?
  Pieter Leyman (KU Leuven KULAK)
  Co-authors: Patrick De Causmaecker
  

• Dynamic programming algorithms for energy constrained lot sizing problems
  Ayse Akbalik (LCOMS, Université de Lorraine)
  Co-authors: Christophe RAPINE, Guillaume GOISQUE
  
• Minimizing makespan on a single machine with release date and inventory constraints
  Morteza Davari (KU Leuven)
  Co-authors: Mohammad Ranjbar, Roel Leus, Patrick De Causmaecker
  
• Stocking and Expediting in Two-Echelon Spare Parts Inventory Systems under System Availability Constraints
  Melvin Drent (University of Luxembourg)
  Co-authors: Joachim Arts
  

• Drone delivery from trucks: Drone scheduling for given truck routes
  Dirk Briskorn (University of Wuppertal)
  Co-authors: Nils Boysen, Stefan Fedtke, Stefan Schwerdfege
  
• Addressing Uncertainty in Meter Reading for Utility Companies using RFID Technology: Simulation Experiments
  Christof Defryn (Maastricht University)
  Co-authors: Debdatta Sinha Roy, Bruce Golden
  
• A UAV Location and Routing Problem with Synchronization Constraints
  Ertan Yakici (National Defense University, Turkish Naval Academy)
  Co-authors: Mumtaz Karatas, Oktay Yilmaz
  

• Extensions of PROMETHEE to multicriteria clustering: recent developments
  Jean Rosenfeld (Université libre de Bruxelles)
  Co-authors: Van Assche Dimitri, De Smet Yves
  
• More Robust and Scalable Sparse Subspace Clustering Based on Multi-Layered Graphs and Randomized Hierarchical Clustering
  Maryam Abdolali (Amirkabir University of Technology (Tehran Polytechnic) )
  Co-authors: Nicolas Gillis
  
• Design and implementation of a modular distributed and parallel clustering algorithm
  Landelin Delcoucq (University of Mons)
  

• On facility location problems and penalty-based aggregation
  Raúl Pérez Fernández (Ghent University)
  Co-authors: Bernard De Baets
  
• Improving the quality of the assessment of food samples by combining absolute and relative information
  Bernard De Baets (Universiteit Gent)
  Co-authors: Raúl Pérez-Fernández, Marc Sader
  
• Coordination and threshold problems in combinatorial auctions
  Bart Vangerven (Bergische Universität Wuppertal)
  Co-authors: Dries R. Goossens, Frits C.R. Spieksma
  

• Scheduling time-relaxed double round-robin tournaments with availability constraints
  David Van Bulck (Ghent University)
  Co-authors: Dries Goossens
  
• Combined proactive and reactive strategies for round robin football scheduling
  Xia-jie Yi (Ghent University)
  Co-authors: Dries Goossens
  
• A constructive matheuristic strategy for the Traveling Umpire Problem
  Reshma Chirayil Chandrasekharan (KU Leuven)
  Co-authors: Tulio A. M. Toffolo, Tony Wauters
  

• Maximum likelihood estimation of discrete and continuous parameters: an MILP formulation
  Anna Fernández Antolín (TRANSP-OR, EPFL)
  Co-authors: Virginie Lurkin, Michel Bierlaire
  
• Integrating advanced discrete choice models in mixed integer linear optimization
  Meritxell Pacheco Paneque (TRANSP-OR EPFL)
  Co-authors: Shadi Sharif Azadeh, Michel Bierlaire, Bernard Gendron
  

• A density-based decision tree for one-class classification
  Sarah Itani (University of Mons)
  Co-authors: Fabian Lecron & Philippe Fortemps
  
• Comparison of active learning classification strategies
  Xavier Siebert (Faculté Polytechnique de Mons)
  Co-authors: Nouara Bellahdid, Moncef Abbas
  
• Risk bounds on statistical learning
  Boris Ndjia Njike (Université de Mons)
  Co-authors: Xavier Siebert