ORBEL 31

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

 

Speakers

Speakers

Click on a name for more details
NameCo-authorsTalkSession
Florian Arnold
University of Antwerp
Kenneth SörensenRouting - efficient and simple
 Abstract:
Routing problems are among the widest-studied area in combinatorial optimization. Their popularity arises from their complexity and applicability in practice. Due to the problem complexity, a major research stream on heuristics has evolved, to find high-quality solutions in a feasible time. The success of heuristics has triggered a race for ever better and faster solution methods. This race has changed the research focus heavily towards the metrics accuracy and speed. In exaggerated words, a heuristic has to produce excellent solutions on benchmark instances in order to be published. As a consequence, many state-of-the-art heuristics have become extremely complex, both in the design and the amount of parameter that they involve. This complexity leads to two disadvantages. Firstly, it becomes more difficult to study the impact of the individual components and thereby generalize findings and generate deeper understanding of why exactly the heuristic works well. Secondly, the heuristics can barely be reimplemented (to validate results or reuse it in another context). Even though this complexity of modern heuristics might be a necessary evil to obtain outstanding solutions, simplicity and flexibility should also be essential attributes of good heuristics. Simple and flexible heuristics are easier to understand in detail and can be more readily applied to a variety of problems. In the following work, we address the question, whether it is possible to get the best of both worlds. Can we design a heuristic that produces excellent solutions in a short time and is, yet, simple and flexible? Our conceptual design is driven by two components. Firstly, we focus heavily on a well-implemented and efficient local search. We use few but powerful local search operators that have been proven and tested many times. Secondly, we strive to make the local search even more effective by guiding it through problem-specific knowledge. As a result, we demonstrate that a simply-designed metaheuristic based almost entirely on local search is sufficient to compete with the best heuristics on various benchmark sets for the standard Vehicle Routing Problem. Moreover, we can easily extend the heuristic framework to other variants of routing problems, like the routing from multiple depots and routing with route-constraints.
Elina Avila-ordóñez
KU Leuven
Pieter Vansteenwegen and Chris TampèreInsights of Flexible Line Planning
Jeroen Belien
KU Leuven
België
Liesje De Boeck, Jens VermeirTeaching linear programming through a Game of Thrones adventure
Valérie Brison
UMONS, Faculté Polytechnique
Pirlot MarcMCDA in environmental assessment contexts
Justin Buhendwa Nyenyezi
Université de Namur
Annick SartenaerPreconditioning linear systems from deformable 3D medical image registration using tensor train format
Sofie Burggraeve
KU Leuven
Pieter Vansteenwegen Optimizing buffer times and supplements in passenger robust timetabling
Hatice Calik
Universite Libre de Bruxelles
Bernard FortzA Benders decomposition approach for locating stations in a one-way electric car sharing system
Jan Christiaens
KU Leuven
Greet Vanden BergheA ruin & recreate heuristic for capacitated vehicle routing problems
Jeroen Corstjens
Hasselt University
An Caris, Benoît Depaire, Kenneth SörensenA statistical methodology for analysing heuristic algorithms
Sam Cosaert
Luxembourg Institute of Socio-Economic Reseaerch
What types are there?
Stefan Creemers
IESEG School of Management
France
Jeroen Beliën, Gert Woumans, Robert BouteIdentification of collaborative shipping opportunities using BBaRT
Nguyen Dang
KU Leuven KULAK
Leslie Perez Caceres, Thomas Stutzle, Patrick De CausmaeckerTuning irace using surrogate tuning benchmarks
Morteza Davari
KU Leuven
Erik DemeulemeesterThe proactive and reactive resource-constrained project scheduling problem: The crucial role of buffer-based reactions
Jérôme De Boeck
Université Libre de Bruxelles
M. Labbé, E. Marcotte, P.Marcotte, G.SavardBidding on day-ahead markets : a dynamic programming approach
Philippe De Bruecker
Odisee University College - Brussels
Prof. dr. Wouter VerheyenAutomatized cargo bundling for SMEs
Renaud De Landtsheer
CETIC
Yoann Guyot, Gustavo Ospina, Christophe PonsardAdding a Sequence Variable to the OscaR.CBLS Engine
Renaud De Landtsheer
CETIC
Gaetan Delannay, Renaud De Landtsheer, Christophe PonsardPlanning Doctor Shift in Hospital: an Approach focusing on Perceived Fairness
Stijn De Vuyst
Ghent University
Belgie
Dieter Claeys, Birger Raa, El-Houssaine AghezzafGradient-based optimization of the expected profit in a serial production line with single sampling plans
Christof Defryn
University of Antwerp
Kenneth SörensenThe integration of individual partner objectives in the logistic optimisation model for a horizontal cooperation
Sarah Dendievel
Ghent University, Department of TELIN, SMACS Research Group
S. Hautphenne, G. Larouche, P.G. TaylorThe expected loss revenue function of a MAP/PH/1/C queue
Reginald Dewil
Conundra
Simon Crevals, Sam Van MalderenVehicle Routing in practice
Mohammad Saied Fallah Niasar
Antwerp
M. Sajadifar,A.H. TayebiAdaptive Large Neighborhood search for school
Everton Fernandes Da Silva
KU Leuven
Túlio A. M. Toffolo, Greet Vanden Berghe, Tony WautersA study of exact methods for container loading problems
Annette Ficker
KU Leuven
België
Frits C.R. Spieksma, Gerhard J. WoegingerThe Transportation Problem with Conflicts
Juan Garcia
KU Leuven
Johan Eyckmans and Sandra RousseauOn the economics of circular economies
Dries Goossens
Ghent University
België
Jari Kyngäs, Kimmo Nurmi, Nico KyngäsScheduling the Australian Football League
Tias Guns
Vrije Universiteit Brussel
Behrouz Babaki, Luc De RaedtStochastic Constraint Programming with And-Or Branch-and-Bound
Thomas Hacardiaux
Université catholique de Louvain
Jean-Sébastien TancrezA Supply Chain Network Design Model to Assess Horizontal Cooperation
Hilde Heggen
Hasselt University
België
Kris Braekers; An CarisMulti-objective decisions for train load planning
Itsaso Hermosilla
Royal Military Academy
Ben Lauwens, Johan GallantModelling and simulation of the ballistic protection limit V50 by exact sampling of an integrated Brownian motion process with drift
Sam Heshmati
KU Leuven
Túlio Toffolo, Wim Vancroonenburg, Greet Vanden BergheHeuristics for crane scheduling and location assignment problems in automated warehouses
Martijn Huysmans
KU Leuven
{Making exit costly but efficient: Optimal exit timing in political unions
Evert-jan Jacobs
KU Leuven
België
Jannes Verstichel, Túlio A.M. Toffolo, Tony Wauters and Greet Vanden BergheA heuristic approach to the truck scheduling problem in a tank terminal
Hamed Jalali
KU Leuven
Inneke Van NieuwenhuyseRisk-averse Assortment and Pricing Decisions in Production/Inventory Systems
Daniel Kowalczyk
KU Leuven
België
Daniel Kowalczyk, Roel LeusA branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
Kunal Kumar
Ghent University
Tarik AouamOptimizing raw materials and finished goods safety stocks in a production network under guaranteed service approach.
Hélène Le Cadre
EnergyVille
On the Efficiency of Local Electricity Markets: A Bilevel Optimization Approach
Wouter Lefever
Ghent University
El-Houssaine Aghezzaf, Khaled Hadj-Hamou, Bernard PenzThe Inventory-Routing Problem with Transshipment
Stef Lemmens
KU Leuven
C.J. Decouttere, N.J. Vandaele, M. BernuzziPerformance measurement of a rotavirus vaccine supply chain design by the integration of production capacity into the guaranteed service approach
Pieter Leyman
KU Leuven KULAK
Patrick De CausmaeckerTermination criteria for metaheuristics: Is computation time worth the time?
Veronique Limère
Ghent University
Lawrence BonczarModeling a Materials Feeding System in a Hospital Operating Room: a Case Study
Corrinne Luteyn
KU Leuven
Pieter VansteenwegenImproving an Incomplete Road Network given a Budget Constraint
Inês Marques
Universidade de Lisboa
Portugal
Inês Marques, Maria Eugénia CaptivoA robust optimization approach for scheduling surgeries in operating rooms
Oussama Mazari Abdessameud
VUB
Filip Van Utterbeeck; Marie-Anne GuerryCost flow modeling for military manpower management
Deni Mazrekaj
KU Leuven
België
Kristof De Witte, Thomas TriebsThe Impact of Class Size on Academic Underachievement: An Advanced Stochastic Frontier Approach
Beatriz M. Méndez-hernández
Universidad Central
Cuba
Erick D. Rodri?guez-Bazan, Yailen Marti?nez-Jime?nez, Pieter Libin, Ann Nowe?CIPS: a new method to handle robustness in the Job Scheduling problem
Yves Molenbruch
Hasselt University
Kris Braekers, An CarisScheduling procedures minimizing the total user ride time in dial-a-ride problems
Stef Moons
Hasselt University
Katrien Ramaekers, An Caris, Yasemin ArdaAn integrated approach for order picking and vehicle routing in a B2C e-commerce context
Federico Mosquera
KU Leuven
Pieter Smet, Greet Vanden BergheA new approach to scheduling home care personnel in Flanders
Federico Pagnozzi
Université Libre de Bruxelles
Thomas StützleAutomatic design of Hybrid Stochastic Local search algorithms
Wenli Peng
Université catholique de Louvain
Gilles Merckx, Philippe Chevalier, Aadhaar ChaturvediThe impact of joint purchasing on competition among allies in the downstream market with incompletion information
Diego Ponce
Université Libre de Bruxelles
Samuel Deleplanque, Martine Labbé and Justo PuertoA GRASP heuristic for the Discrete Ordered Median Problem: how to exploit it into an exact method
Nils-hassan Quttineh
Linköping University
Sweden
A Mathematical Model and a Meta-Heuristic for the Cast Batching Problem
Salim Rostami
KU Leuven
Stefan Creemers and Roel LeusSequential testing of n-out-of-n systems: A comparison of exact approaches
Fritz Schiltz
KU Leuven
Kristof De WitteMeasuring and explaining school district performance. The influence of school district management and organizational practices.
Nico André Schmid
Ghent University
Veronique LimèreThe assembly line feeding problem: classification and literature review
Matias Schuster
Université catholique de Louvain
Stefan Minner, Jean-Sébastien TancrezTwo-stage supply chain design with safety stock placement decisions
Fabio Sciamannini
Université Libre de Bruxelles
A Column Generation Approach for the graph b-Coloring Problem
Pieter Smet
KU Leuven
A local search approach to the many-to-many carpooling problem
Bart Smeulders
Université de Liège
Testing Random Utility Models: An Optimization Problem
Thomas StÜtzle
Université Libre de Bruxelles (ULB)
Holger H. HoosScaling analysis of state-of-the-art TSP algorithms
Tulio Toffolo
KU Leuven
Tony Wauters, Antonio Martinez-SykoraInteger programming based heuristics for a leather industry nesting problem
Thomas Van Den Bossche
KU Leuven, Department of Computer Science, CODeS & imec-ITEC
Juan Francisco Correcher, Ramo?n A?lvarez-Valde?s, Greet Vanden BergheAn exact and heuristic approach to the berth allocation problem in tank terminals
Jens Van Engeland
KU Leuven Campus Brussel
Spatial Price Competition in a Waste Management Context
Teun Van Gils
Hasselt University
Kris Braekers, Katrien Ramaekers, and An CarisJoint Order Batching, Routing, and Picker Scheduling in Manual Order Picking Systems
Johan Van Kerckhoven
Koninklijke Militaire School
Ben Lauwens, Oussama Mazari-Abdessameu, Filip Van UtterbeeckSimulation based manpower planning: an introduction using SimJulia
Sofie Van Thielen
KU Leuven
Pieter VansteenwegenHeuristic for real-time train rescheduling and local rerouting
Kay Van Wynendaele Van Wynendaele
Conundra
Simon Crevals, Mieke DefraeyeA step counting hill climbing heuristic for the practical Inventory Routing Problem
Lien Vanbrabant
Hasselt University
België
Katrien Ramaekers; Kris BraekersAnalysis and simulation of emergency departments: state of the art and prospects
Wim Vancroonenburg
KU Leuven
Eline Esprit, Pieter Smet, Greet Vanden BergheDynamic pickup and delivery for internal hospital logistics
Bart Vangerven
K.U. Leuven
Dries Goossens and Frits SpieksmaOvercoming the Threshold Problem in Ascending Combinatorial Auctions
Sarah Vanheusden
Hasselt University
Katrien Ramaekers, An CarisConsidering human factors in planning problems for manual order picking systems: a state of the art
Wouter Verbeke
Vrije Universiteit Brussel
Cristián BravoA cost-sensitive regression evaluation framework
Floor Verbiest
University of Antwerp
Trijntje Cornelissens and Johan SpringaelOptimal design of multiproduct batch plants using heuristic techniques
Lotte Verdonck
Hasselt University, Research Foundation Flanders (FWO)
Katrien Ramaekers, An Caris, Dries Meers, Cathy MacharisAnalyzing cost allocation techniques in intermodal barge networks for freight bundling
Hendrik Vermuyten
KU Leuven, Campus Brussels
Jeroen Beliën; Tony WautersThe impact of timetabling on the efficient evacuation of a building
76 talks

 
 
  ORBEL - Conference chair: Prof. J. Beliën - Platform: Prof. M. Schyns