| Name | Co-authors | Talk | Session |
Guillaume Amand
University of Liège | Yasemin Arda | general lotsizing problem in a closed-loop supply chain with uncertain returns | Friday 9:00-10:15 | |
Kris Braekers
Universiteit Hasselt | An Caris, Gerrit K. Janssens | A time-dependent vehicle routing problem in the service area of intermodal terminals | Thursday 14:00-15:40 | |
Valérie Brison
UMONS, Faculté Polytechnique | Marc Pirlot | Elicitation procedures for the comparison of decisional maps | Friday 14:00-15:40 | |
Marco Castro
University of Antwerp | Pablo Maya, Kenneth Sorensen, Peter Goos | Planning the caregivers at Landelijke Thuiszorg | Thursday 14:00-15:40 | |
Dieter Claeys
Ghent University
| Joris Walraevens, Bart Steyaert, Herwig Bruneel | Optimal group sizes for dynamic group screening | Thursday 11:15-12:30 | |
Sofie Coene
KULeuven | P. Maya, K. Sörensen, P. Goos, F.C.R. Spieksma | The Budget-Constrained Min Cost Flow Problem | Thursday 14:00-15:40 | |
Annelies De Corte
University of Antwerp
| Kenneth Sörensen | Generation of synthetic water distribution networks | Friday 14:00-15:40 | |
Renaud De Landtsheer
CETIC
| Christophe Ponsard | OscaR.cbls: an open source framework for constraint-based local search | Thursday 14:00-15:40 | |
Karel De Loof
Universiteit Gent
| K. De Loof, B. De Baets and H. De Meyer | Dice representability of reciprocal relations | Thursday 16:10-17:25 | |
Christof Defryn
University of Antwerp
| C.Vanovermeire, K.Sörensen | The eect of customer characteristics on coalition gains in collaborative vehicle routing | Thursday 14:00-15:40 | |
Sofie Demeyer
Ghent University | Maarten Houbraken, Thijs Walcarius, Pieter Audenaert, Didier Colle, Mario Pickavet | Using Contraction Hierarchies to Find Dissimilar Paths in Transportation Networks | Thursday 11:15-12:30 | |
Reginald Dewil
Katholieke Universiteit Leuven | Pieter Vansteenwegen, Dirk Cattrysse | Hybrid approach for generating laser cutting tool paths | Thursday 11:15-12:30 | |
Ali Divsalar
KU Leuven | Pieter Vansteenwegen, Dirk Cattrysse | A Memetic Algorithm for the Orienteering Problem with Intermediate Facilities | Thursday 14:00-15:40 | |
Trivikram Dokka
K U Leuven | Yves Crama, Frits Spieksma | Approximation Algorithms for Multi-Dimensional Vector Assignment problems | Friday 9:00-10:15 | |
Alper Döyen
University of Liege | Necati Aras,Yasemin Arda | Two-stage stochastic integer programming models for strategic disaster preparedness | Friday 14:00-15:40 | |
Véronique François
HEC-Management School of the University of Liège | Yasemin Arda and Yves Crama | An Adaptive Large Neighborhood Search for a Vehicle Routing Problem with Multiple Trips and Driver Shifts | Thursday 16:10-17:25 | |
Dries Goossens
KU Leuven | Frits Spieksma, Sander Onderstal, Jan Pijnacker | Designing a combinatorial auction for Solids | Friday 14:00-15:40 | |
Renaud Hartert
Université Catholique de Louvain | Pierre Schaus | Multi-Objective Large Neighborhood Search | Thursday 14:00-15:40 | |
Maarten Houbraken
UGent | T. Walcarius, S. Demeyer, P. Audenaert, D. Colle, M. Pickavet | An insertion-based heuristic for the constrained pickup and delivery problem | Thursday 16:10-17:25 | |
Jochen Janssens
University of Antwerp | Joos Van Den Bergh | Routing for couriers: a multi-objective tabu search method to rebalance a tactical route plan with microzones | Thursday 16:10-17:25 | |
Komar Komarudin
Vrije Universiteit Brussel | M.-A. Guerry, G. Vanden Berghe and T. De Feyter | The overlapping case in an integrated staffing and rostering formulation | Thursday 14:00-15:40 | |
Hande KÜÇÜkaydin
University of Liège | Yasemin Arda, Yves Crama | Elementary shortest path problems for a multiple-trip vehicle routing problem | Thursday 14:00-15:40 | |
Arnaud Latiers
UCL Louvain-la-Neuve
| Francois Glineur, Emmanuel De Jaeger | Energy-Neutral Demand Response from a Large Population of batch-process loads | Thursday 11:15-12:30 | |
Manuel LÓpez-ibaÑez
Université Libre de Bruxelles | Franco Mascia, Jérémie Dubois-Lacoste and Thomas Stützle | From Grammars to Parameters: Automatic Design of Iterated Greedy Algorithms | Friday 14:00-15:40 | |
Virginie Lurkin
HEC- Université de Liège | Lurkin Virginie and Schyns Michael | Automatic Aircraft Cargo Load Planning with Pick-up and Deliveries | Thursday 16:10-17:25 | |
Tom Maertens
Ghent University | Herwig Bruneel | On a queue with customer deadlines | Friday 14:00-15:40 | |
Tabitha Maes
Hasselt University
Beligië | An Caris, Katrien Ramaekers, Gerrit K. Janssens | A tabu-embedded simulated annealing algorithm for a selective pickup and delivery problem | Thursday 16:10-17:25 | |
Thierry Marchant
Ghent University | Debasis Mishra | The characterization of affine maximizers when there are only two alternatives\,: A technical note | Friday 9:00-10:15 | |
Marie-eléonore Marmion
Université Libre de Bruxelles | Franco Mascia, Manuel López-Ibáñez, Thomas Stützle | An Approach to the Automatic Configuration of a Generalized Metaheuristic Structures | Friday 14:00-15:40 | |
Franco Mascia
Université Libre de Bruxelles (ULB) | Mauro Birattari and Thomas Stützle | Predicting parameter configurations for tuning effective algorithms on very large instances | Friday 14:00-15:40 | |
Tommy Messelis
KU Leuven kulak
België | Patrick De Causmaecker | Automatic algorithm selection for multi-mode resource-constrained project scheduling problems | Friday 14:00-15:40 | |
Mihail Mihaylov
CODeS, KAHO Sint-Lieven | Pieter Smet, Greet Vanden Berghe | Automatic Constraint Weight Extraction for Nurse Rostering: A Case Study | Thursday 14:00-15:40 | |
Martine Mostert
University of Liege
| Sabine LIMBOURG | Intermodal network design for freight transportation in Belgium - location of rail/road and road/inland waterway terminals | Thursday 11:15-12:30 | |
Ward Passchyn
KU Leuven
| S. Coene; F. C. R. Spieksma; G. Vanden Berghe; D. Briskorn; J. L. Hurink | The lockmaster's problem: a computational study | Thursday 14:00-15:40 | |
Thierry Pironet
University of Liège | Y. Arda, Y. Crama, D. Kronus, Th. Pironet, P. Van Hentenryck | Multiperiod vehicle loading with stochastic release dates | Friday 9:00-10:15 | |
Hanne Pollaris
Hasselt University | Kris Braekers, An Caris, Katrien Ramaekers, Gerrit K. Janssens | State of the art of vehicle routing problems with loading constraints | Thursday 14:00-15:40 | |
Luciano Porretta
Université Libre de Bruxelles | D. Catanzaro, M. Labbe | A Class Representative Model for Pure Parsimony Haplotyping under Uncertain Data | Friday 14:00-15:40 | |
Michael Rademaker
UGent | Bernard De Baets | Using a natural monotonicity constraint as the basis of a ranking procedure | Thursday 16:10-17:25 | |
Frederic Salmon
HEC-ULg QuantOM
| S.Limbourg | Optimisation model for empty container repositioning. | Thursday 14:00-15:40 | |
Vladimir Shikhman
Université Catholique de Louvain | O. Stein | On jet-convex functions and their tensor products | Thursday 11:15-12:30 | |
Pieter Smet
CODeS, KAHO Sint-Lieven | Tony Wauters, Greet Vanden Berghe | Hardness analysis and a new approach for the shift minimisation personnel task scheduling problem | Thursday 14:00-15:40 | |
Kenneth Sörensen
Universiteit Antwerpen | Johan Springael | Progressive multi-objective optimization | Friday 14:00-15:40 | |
Luca Talarico
University of Antwerp | K. Sörensen and J. Springael | New Metaheuristics for the Risk Constraint Cash-in-Transit Vehicle Routing Problem | Thursday 16:10-17:25 | |
| | Abstract:
In this work we propose two new metaheuristic algorithms to
cope with the Risk Constraint Cash-in-Transit Vehicle Routing Problem (RCTVRP for short) already introduced in the literature by (Talarico et al., 2012).
The RCTVRP is a variant of the well-known capacitated vehicle routing problem that models the problem of routing vehicles in the cash-in-transit industry by introducing a risk constraint. In the RCTVRP the risk associated with a robbery, which is assumed to be proportional both to the amount of cash being carried and the time or the distance covered by the vehicle carrying the cash, is limited by a certain risk threshold. In this work we propose two metaheuristic algorithms
named respectively m-ACO and p-ACO . Both the m-ACO and the p-ACO metaheuristics use the well known Ant Colony heuristic for the Traveling Salesman Problem introduced by (Dorigo, 1996). The risk constraint is relaxed and for this reason, the Ant Colony heuristic creates a single (TSP) tour. The best found giant TSP tour is subjected to a variant of the splitting procedure described in
Prins (2004). The solution obtained after the splitting heuristics serve as input for the variable neighbourhood search block, which is composed of seven of the most common local search operators for vehicle routing problems, modified for the RCTVRP.
The Ant Colony heuristic and the variable neighbourhood search block are embedded in two different global metaheuristic structures: a multistart and a destroy-and-repair (or perturbation) structure.
Both the m-ACO and p-ACO metaheuristics, in their optimal setting, are
used to solve all the instances contained in a specific set of RCTVRP instances named set O for which the optimal solutions are known (see (Talarico et al., 2012) for more details of the instances characteristics). The resulting methods are able to obtain solutions of excellent quality in very limited computing times.
|
Fabrice Talla Nobibon
KU Leuven | L. Cherchye, Y. Crama, T. Demuynck, B. De Rock, and F.C.R. Spieksma | Testing Rationality of Collective Household Consumption | Thursday 11:15-12:30 | |
Jean-sébastien Tancrez
Louvain School of Management, Université catholique de Louvain | A.C. Zeballos, R.W. Seifert | Dynamic Product Portfolio Management with Life Cycle Considerations | Thursday 11:15-12:30 | |
Jacques Teghem
Faculté Polytechnique de Mons | E.Dhouib;D.Tuyttens;T.Loukil | Lexicographic optimization of a bi-objective permutation flow shop with time lags | Friday 9:00-10:15 | |
Christophe Ullrich
Royal Military Academy
| F. Van Utterbeeck, M. Debacker, E. Dhondt | SIMEDIS disaster management simulator: major road traffic accident | Friday 14:00-15:40 | |
Wim Vancroonenburg
KU Leuven - KAHO Sint-Lieven | Federico Della Croce, Dries Goossens, Frits Spieksma | The Red-Blue Transportation Problem | Thursday 14:00-15:40 | |
Arnaud Vandaele
UMONS, Faculté Polytechnique | Daniel Tuyttens | A branch and bound algorithm for a lexicographic optimization of a bi-objective permutation flowshop with time lags | Friday 9:00-10:15 | |
Christine Vanovermeire
University of Antwerp
| Dries Vercruysse, Kenneth Sörensen | Analysis of different cost allocation methods in a collaborative transport setting | Thursday 11:15-12:30 | |
Lotte Verdonck
Hasselt University, Research Foundation Flanders (FWO) | Patrick Beullens, An Caris, Katrien Ramaekers, Gerrit K. Janssens | The cooperative facility location problem | Friday 9:00-10:15 | |
Jannes Verstichel
KU Leuven - KAHO Sint-Lieven | Patrick De Causmaecker, Greet Vanden Berghe | The ship placement problem: Decision support through exact decomposition | Thursday 14:00-15:40 | |
Jan Verwaeren
Ghent University | Michael Rademaker, Bernard De Baets | A Set-Based Approach to the Decomposition of Linear Mixtures Using Quasi-Convex Programming | Thursday 16:10-17:25 | |
Alessia Violin
Université Libre de Bruxelles | Bernard Fortz, Martine Labbé | Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs | Thursday 11:15-12:30 | |
Yuyi Wang
KULeuven | Jan Ramon | On the statistical analysis of overlapping observations in large networks | Thursday 11:15-12:30 | |
Tony Wauters
CODeS, KAHO Sint-Lieven | Jannes Verstichel, Greet Vanden Berghe | Two- and three-dimensional strip packing: a shaking procedure | Friday 9:00-10:15 | |
Laurence Wolsey
CORE, UCL | Feng Qiu, Shabbir Ahmed, Santanu S. Dey | Covering Linear Programs with Violations | Friday 9:00-10:15 | |
Luiza Zeltzer
Department of Industrial Management Faculty of Engineering and Architecture Ghent University Ghent, Belgium | Luiza Zeltzer, Veronique Limère, El-Houssaine Aghezzaf, Hendrik Van Landeghem | Measuring Complexity in Mixed-Model Assembly Workstations | Thursday 11:15-12:30 | |
58 talks
