| Name | Co-authors | Talk | Session |
Florian Arnold
University of Antwerp | Kenneth Sörensen | Routing - efficient and simple | | |
Elina Avila-ordóñez
KU Leuven | Pieter Vansteenwegen and Chris Tampère | Insights of Flexible Line Planning | | |
Jeroen Belien
KU Leuven
België | Liesje De Boeck, Jens Vermeir | Teaching linear programming through a Game of Thrones adventure | | |
Valérie Brison
UMONS, Faculté Polytechnique | Pirlot Marc | MCDA in environmental assessment contexts | | |
Justin Buhendwa Nyenyezi
Université de Namur | Annick Sartenaer | Preconditioning 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 Fortz | A Benders decomposition approach for locating stations in a one-way electric car sharing system | | |
Jan Christiaens
KU Leuven | Greet Vanden Berghe | A ruin & recreate heuristic for capacitated vehicle routing problems | | |
Jeroen Corstjens
Hasselt University | An Caris, Benoît Depaire, Kenneth Sörensen | A 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 Boute | Identification of collaborative shipping opportunities using BBaRT | | |
Nguyen Dang
KU Leuven KULAK | Leslie Perez Caceres, Thomas Stutzle, Patrick De Causmaecker | Tuning irace using surrogate tuning benchmarks | | |
Morteza Davari
KU Leuven
| Erik Demeulemeester | The 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.Savard | Bidding on day-ahead markets : a dynamic programming approach | | |
Philippe De Bruecker
Odisee University College - Brussels | Prof. dr. Wouter Verheyen | Automatized cargo bundling for SMEs | | |
Renaud De Landtsheer
CETIC
| Yoann Guyot, Gustavo Ospina, Christophe Ponsard | Adding a Sequence Variable to the OscaR.CBLS Engine | | |
Renaud De Landtsheer
CETIC
| Gaetan Delannay, Renaud De Landtsheer, Christophe Ponsard | Planning Doctor Shift in Hospital: an Approach focusing on Perceived Fairness | | |
Stijn De Vuyst
Ghent University
Belgie | Dieter Claeys, Birger Raa, El-Houssaine Aghezzaf | Gradient-based optimization of the expected profit in a serial production line with single sampling plans | | |
Christof Defryn
University of Antwerp
| Kenneth Sörensen | The 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. Taylor | The expected loss revenue function of a MAP/PH/1/C queue | | |
Reginald Dewil
Conundra | Simon Crevals, Sam Van Malderen | Vehicle Routing in practice | | |
Mohammad Saied Fallah Niasar
Antwerp | M. Sajadifar,A.H. Tayebi | Adaptive Large Neighborhood search for school | | |
Everton Fernandes Da Silva
KU Leuven
| Túlio A. M. Toffolo, Greet Vanden Berghe, Tony Wauters | A study of exact methods for container loading problems | | |
Annette Ficker
KU Leuven
België | Frits C.R. Spieksma, Gerhard J. Woeginger | The Transportation Problem with Conflicts | | |
Juan Garcia
KU Leuven
| Johan Eyckmans and Sandra Rousseau | On the economics of circular economies | | |
Dries Goossens
Ghent University
België | Jari Kyngäs, Kimmo Nurmi, Nico Kyngäs | Scheduling the Australian Football League | | |
Tias Guns
Vrije Universiteit Brussel | Behrouz Babaki, Luc De Raedt | Stochastic Constraint Programming with And-Or Branch-and-Bound | | |
Thomas Hacardiaux
Université catholique de Louvain | Jean-Sébastien Tancrez | A Supply Chain Network Design Model to Assess Horizontal Cooperation | | |
Hilde Heggen
Hasselt University
België | Kris Braekers; An Caris | Multi-objective decisions for train load planning | | |
Itsaso Hermosilla
Royal Military Academy
| Ben Lauwens, Johan Gallant | Modelling 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 Berghe | Heuristics 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 Berghe | A heuristic approach to the truck scheduling problem in a tank terminal | | |
Hamed Jalali
KU Leuven | Inneke Van Nieuwenhuyse | Risk-averse Assortment and Pricing Decisions in Production/Inventory Systems | | |
Daniel Kowalczyk
KU Leuven
België | Daniel Kowalczyk, Roel Leus | A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching | | |
Kunal Kumar
Ghent University | Tarik Aouam | Optimizing 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 Penz | The Inventory-Routing Problem with Transshipment | | |
Stef Lemmens
KU Leuven | C.J. Decouttere, N.J. Vandaele, M. Bernuzzi | Performance 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 Causmaecker | Termination criteria for metaheuristics: Is computation time worth the time? | | |
Veronique Limère
Ghent University | Lawrence Bonczar | Modeling a Materials Feeding System in a Hospital Operating Room: a Case Study | | |
Corrinne Luteyn
KU Leuven | Pieter Vansteenwegen | Improving an Incomplete Road Network given a Budget Constraint | | |
Inês Marques
Universidade de
Lisboa
Portugal | Inês Marques, Maria Eugénia Captivo | A robust optimization approach for scheduling surgeries in operating rooms | | |
Oussama Mazari Abdessameud
VUB | Filip Van Utterbeeck; Marie-Anne Guerry | Cost flow modeling for military manpower management | | |
Deni Mazrekaj
KU Leuven
België | Kristof De Witte, Thomas Triebs | The 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 Caris | Scheduling procedures minimizing the total user ride time in dial-a-ride problems | | |
Stef Moons
Hasselt University | Katrien Ramaekers, An Caris, Yasemin Arda | An integrated approach for order picking and vehicle routing in a B2C e-commerce context | | |
Federico Mosquera
KU Leuven
| Pieter Smet, Greet Vanden Berghe | A new approach to scheduling home care personnel in Flanders | | |
Federico Pagnozzi
Université Libre de Bruxelles | Thomas Stützle | Automatic design of Hybrid Stochastic Local search algorithms | | |
| | Abstract:
Stochastic local search , SLS, methods such as Iterated Local Search (ILS), Iterated Greedy (IG), Tabu Search (TS), GRASP or Simulated Annealing (SA) have been used with good results for many NP-hard optimization problems. Typically, when tackling a problem, an algorithm designer has to decide which one of these methods to apply and how to adapt the chosen metaheuristic to the problem. The concept of automatic algorithm design can be traced back to the introduction of automatic configuration tools, such as ParamILS , SMAC and irace , and unified algorithm implementations such as MOACO , UACOR , SATenstein. The former simplifies the configuration of algorithms with big parameter set, while, the latter expose the design choices, when building a SLS, as parameters. By using the two together, we can automatize the design of specific SLS in a process called programming by optimization . Here we propose a way how to adapt these ideas towards generating high-performing algorithms for important scheduling problems. Our method is based on decomposing the SLS algorithms to simple components and to define a set of rules to describe how to combine them. Finally, we use an automatic configuration tool to find the best combination of components that satisfies the given rules. The presented system can choose either to instantiate an exisisting SLS method or to create a new one by hybridizing two, or more, SLS algorithms. More specifically, we use irace as automatic configuration tool, expressing the rules using the grammar approach presented in, and a new framework, EMILI to implement the components and to instantiate the algorithms.
EMILI has been designed to be an unified framework for the automatic SLS design. Its architecture is based on a general definition of the components of a SLS so that the algorithms are not linked to any particular problem definition. To test our approach we tackle the Permutation Flowshop Problem (PFSP). This problem has been extensively studied since it was formally described and it has been proved to be NP-hard for various objective functions . Moreover, PFSP has a very simple structure that can be used to represent many other permutation and flowshop problems. This flexibility and the presence of many high performing SLS algorithms make PFSP a very good test case for our method. In particular, in this talk we generate algorithms to solve three of the most studied PFSP objectives : the minimization of the makespan; the minimization of the sum of completion times, and the minimization of the total tardiness. We compare the generated algorithms with the state of the art for each objective. Our results show that the generated algorithms outperforms the state of the art for every objective.
|
Wenli Peng
Université catholique de Louvain | Gilles Merckx, Philippe Chevalier, Aadhaar Chaturvedi | The 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 Puerto | A 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 Leus | Sequential testing of n-out-of-n systems: A comparison of exact approaches | | |
Fritz Schiltz
KU Leuven
| Kristof De Witte | Measuring and explaining school district performance. The influence of school district management and organizational practices. | | |
Nico André Schmid
Ghent University | Veronique Limère | The assembly line feeding problem: classification and literature review | | |
Matias Schuster
Université catholique de Louvain | Stefan Minner, Jean-Sébastien Tancrez | Two-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. Hoos | Scaling analysis of state-of-the-art TSP algorithms | | |
Tulio Toffolo
KU Leuven | Tony Wauters, Antonio Martinez-Sykora | Integer 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 Berghe | An 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 Caris | Joint Order Batching, Routing, and Picker Scheduling in Manual Order Picking Systems | | |
Johan Van Kerckhoven
Koninklijke Militaire School | Ben Lauwens, Oussama Mazari-Abdessameu, Filip Van Utterbeeck | Simulation based manpower planning: an introduction using SimJulia | | |
Sofie Van Thielen
KU Leuven | Pieter Vansteenwegen | Heuristic for real-time train rescheduling and local rerouting | | |
Kay Van Wynendaele Van Wynendaele
Conundra
| Simon Crevals, Mieke Defraeye | A step counting hill climbing heuristic for the practical Inventory Routing Problem | | |
Lien Vanbrabant
Hasselt University
België | Katrien Ramaekers; Kris Braekers | Analysis and simulation of emergency departments: state of the art and prospects | | |
Wim Vancroonenburg
KU Leuven | Eline Esprit, Pieter Smet, Greet Vanden Berghe | Dynamic pickup and delivery for internal hospital logistics | | |
Bart Vangerven
K.U. Leuven
| Dries Goossens and Frits Spieksma | Overcoming the Threshold Problem in Ascending Combinatorial Auctions | | |
Sarah Vanheusden
Hasselt University | Katrien Ramaekers, An Caris | Considering human factors in planning problems for manual order picking systems: a state of the art | | |
Wouter Verbeke
Vrije Universiteit Brussel | Cristián Bravo | A cost-sensitive regression evaluation framework | | |
Floor Verbiest
University of Antwerp | Trijntje Cornelissens and Johan Springael | Optimal design of multiproduct batch plants using heuristic techniques | | |
Lotte Verdonck
Hasselt University, Research Foundation Flanders (FWO) | Katrien Ramaekers, An Caris, Dries Meers, Cathy Macharis | Analyzing cost allocation techniques in intermodal barge networks for freight bundling | | |
Hendrik Vermuyten
KU Leuven, Campus Brussels | Jeroen Beliën; Tony Wauters | The impact of timetabling on the efficient evacuation of a building | | |
76 talks
