ORBEL 24

About the conference
What is OR
Organisation
Deadlines
Call for papers
Registration
   Registration
   Participants
Conference program
   Key speakers
   Speakers
   Detailed program
Location
Conference dinner
Partners
Contact

 

Speakers

Key speakers: Michel Goemans (MIT) and Philippe Baptiste (CNRS-Ecole Polytechnique LIX)
Click on a name for more details
NameCo-authorsTalkSession
Guillaume Amand
Université de Liège
Stackleberg game in transportationFriday 09:25:00
Francis Bach
INRIA - Ecole Normale Superieure
France
Discriminative Clustering for Image Co-segmentationThursday 14:00:00
Justyna Bakowska
Hasselt University
An Caris, Katrien Ramaekers,Gerrit Janssens, Tom Bellemans Developments in Freight Modeling Thursday 16:10:00
Jeroen Beliën
hogeschool universiteit brussel
Dries Goossens, Daam Van Reeth, Liesje De BoeckUsing mixed integer programming to win a cycling gameThursday 14:00:00
Lotte Berghman
Katholieke Universiteit Leuven
Roel LeusUsing Lagrangian relaxation to solve a dock assignment problemThursday 16:10:00
Burak Bilgin
Kaho Sint-Lieven
Patrick De Causmaecker, Greet Vanden BergheModelling questions in nurse rosteringFriday 11:00:00
Raymond Bisdorff
University of Luxembourg
Luxembourg
On detecting and enumerating chordless circuits in a digraphFriday 15:10:00
Pierre Borckmans
UCL (INMA)
Pierre-Antoine AbsilFast Oriented Bounding Box Computation Using Particle Swarm OptimizationThursday 14:00:00
Kris Braekers
Universiteit Hasselt
Gerrit K. Janssens and An CarisIntegrating empty container allocation with vehicle routing decisionsThursday 14:00:00
Willem K. Brauers
University of Antwerp
R. Ginevicius, R. BisdorffRegional Development in a Well-Being Economy: The Case of LithuaniaFriday 09:00:00
Jasmine Buré
KULeuven
Pieter Vansteenwegen, Dirk CattrysseThe mobile repairman problem: classification of existing modelsFriday 15:10:00
Sylvie Busschaert
University of Antwerp
Evaluation of multi-criteria techniques for project portfolio managementFriday 09:00:00
Dario Campagna
University of Perugia
Italy
A CLP engine for product configurationFriday 11:00:00
Wouter Charle
K.U.Leuven
Francesco Viti, Chris M.J. TampèreA clustering approach to estimate route travel time distributionsFriday 09:25:00
Herman Crauwels
campus De Nayer, Hogeschool voor Wetenschap & Kunst
Educational course timetabling: a case studyThursday 11:00:00
Stefan Creemers
K.U.Leuven
Roel LeusR&D project planning with multiple trials in uncertain environmentsThursday 16:10:00
Frans De Rooij
AIMMS
The Netherlands
Fast optimization modeling with AIMMSFriday 15:10:00
Stijn De Vuyst
Ghent University
Dieter Fiems (first author), Stijn De Vuyst, Herwig Bruneel.Queueing analysis of outpatient scheduling in health careFriday 11:00:00
Boris Defourny
University of Liege
Damien Ernst and Louis WehenkelExtra-Small Scenario Trees for Multistage Stochastic ProgrammingFriday 09:25:00
Peter Demeester
KaHo Sint-Lieven
A hyper-heuristics approach to solve a real-world and a benchmark examination timetabling problemThursday 11:00:00
Peter Demeester
KaHo Sint-Lieven
G. Vanden Berghe, P. De CausmaeckerEducational timetabling, an overview of a mature research domainThursday 11:00:00
Thomas Demoor
Ghent University
Dieter Fiems and Herwig BruneelSimulation study of outpatient scheduling with unpunctual patientsFriday 11:00:00
Reginald Dewil
Katholieke Universiteit Leuven
Pieter Vansteenwegen, Dirk CattrysseThe generalized sequential ordering problem for laser cutting toolpath generationThursday 14:00:00
Jérémie Dubois-lacoste
IRIDIA, CoDE, Université Libre de Bruxelles
Manuel López-Ibáñez and Thomas StützleA Hybrid Algorithm for Bi-objective Flowshop SchedulingThursday 16:10:00
Wout Dullaert
University of Antwerp
B. RaaAggregate production-distribution planning with shared production resourcesFriday 09:25:00
Julien Dupuis
UCLouvain
Pierre Schaus, Yves DevilleFailure Detection for the Bin-Packing ConstraintThursday 16:10:00
Céline Engelbeen
Université Libre de Bruxelles
Antje KieselBinary matrix decompositions without tongue-and-groove underdosage for radiation therapy planningFriday 11:00:00
Mahsa Faizrahnemoon
Islamic Azad University, Tehran Science and Research Branch
A. DavoodiSensitivity analysis of the additive model in data envelopment analysis while inputs and outputs are fuzzy dataFriday 09:00:00
Bart Feyaerts
Ghent University
Stijn De Vuyst, Sabine Wittevrongel, Herwig BruneelModelling data traffic performance in file servers: session-based arrivalsFriday 11:00:00
 Abstract:
Abstract Contemporary communication networks are faced with increasingly heterogeneous traffic characteristics. In order to get reliable predictions about the network performance, adequate models for both data traffic and network components are indispensable. In this paper we focus on the session-based arrival process, a novel model for data traffic. This model considers users that can start and end sessions, during which data are transported over the network. We then use the model to obtain analytical and numerical results for the mean delay of a session in a network buffer. 1 Introduction Packet buffers are crucial components in many communication networks, where they provide for temporary storage of data packets. A sound understanding of these buffers and how they behave, is therefore crucial to study the network performance as a whole. An essential factor of the performance measures of a packet buffer, is the nature of the arrival process that generates the data packets. Session-based arrival streams form a new approach for modelling data traffic in modern communication networks. Users from an infinite population can start and end sessions, during which data are sent over the network. In this paper, we focus on a packet buffer, modelled as a discrete-time, single-server queueing system with infinite buffer capacity, geometric service times and session-based arrivals. Per time slot, each of the sessions generates a random but strictly positive number of information packets. The sessions all last for a random, but yet again, strictly positive number of time slots. This session-based packet generation scheme counts as a generalization of the train arrival process, where sessions (in this context referred to as messages) have a fixed bandwidth of 1 packet per slot. All data traffic arriving to the buffer can be divided into an arbitrary number T of session types. Each of these session types is characterized by three stochastic components. The session generation process of a particular type describes the number of new sessions of that type during a random slot. The session bandwidth denotes the number of packets generated by a session during a random slot. Finally, the session length corresponds to the number of slots a session lasts. 2 Description of the analysis In previous work [1], a Markovian system state description with an infinite-length system state vector was constructed. This vector contains the buffer content at the end of a certain slot and for each session type, the number of active sessions during that slot, grouped by the amount of slots the sessions are already active. Also the steady-state probability generating function of this system state vector has been obtained, as well as analytical expressions for the mean buffer content and the mean packet delay. Based on these preliminary results, we now investigate the mean value of the session delay. The delay of a session is defined as the integer number of slots, starting at the end of the slot in which the session's first packet arrives to the buffer, until the end of the slot in which the session's final packet leaves the system. The first step is then to obtain the mean session delay of sessions of a given type and length. This derivation is very different for single-slot and multiple-slot sessions. In the next step we produce the mean session delay of sessions of a given type by taking the sum of the conditional means obtained in the former step, weighted over the corresponding session length probability. In the final step, an analogous weighted sum yields the overall mean session delay. Numerical examples show both some intuitive and some more intriguing results. As expected, an increasing system load leads to an increasing mean session delay; this result is also obtained for an increasing variance in the arrival process. A more counterintuitive result is that the mean session delay can be smaller than the mean packet delay for some configurations. This can occur when there is unbalanced traffic: frequent few-packet sessions in combination with unfrequent many-packet sessions where the major part of the packets arrive during the unfrequent sessions. Although these unfrequent sessions have little effect on the mean session delay, they have a crucial effect on the mean packet delay. 3 Application A possible application of our model is to study the behaviour of the output buffer of a file server. Considering each file transfer as a single session, the traffic to such an output buffer can be well described by our session-based model. Since the model allows for general distributions of both the session lengths and the session bandwidths, it enables us to take into account actual traffic characteristics, as observed from a real traffic trace. References [1] S. Wittevrongel, S. De Vuyst and H. Bruneel, Analysis of discrete-time buffers with general session-based arrivals, Proceedings of ASMTA 2009 (Madrid, June 2009), Lecture Notes in Computer Science, 2009, vol. 5513, pp. 189-203.
Kevin Ghislain
ULB
Limal
B. Fortz, S. Zampelli, P. Schaus, A. ZanariniDynaUniversity2009Thursday 14:00:00
Dries Goossens
Katholieke Universiteit Leuven
F.C.R. SpieksmaThe carry-over effect does not exist in footballThursday 11:00:00
Maria Govorun
ULB, Belgium
Financial flow modeling for non-state pension fundsThursday 16:10:00
Marie-anne Guerry
Vrije Universiteit Brussel
Brussel
Multicriteria decision making in a multi-level manpower systemFriday 09:00:00
Sophie Hautphenne
Université Libre de Bruxelles
Guy LatoucheExtinction Probability of a Branching Process in a Markovian Random EnvironmentFriday 09:25:00
Trong Viet Ho
UCL, Belgium
Yves Deville, Olivier BonaventureImplementation in COMET of a Traffic Engineering technique that Preserves IP Fast RerouteThursday 14:00:00
Olivier Hudry
Ecole nationale supérieure des télécommunications
France
Lucile Belgacem, Irène CharonIndependent sets and the routing and wavelength assignment problemThursday 11:00:00
Mariya Ishteva
Université catholique de Louvain, Department of Mathematical Engineering
PA. Absil, S. Van Huffel, L. De LathauwerOn the best low multilinear rank approximation of higher-order tensorsThursday 11:00:00
Imed Kacem
UNIVERSITY PAUL VERLAINE METZ
France
Hans KellererNo-Wait Scheduling of a Single-Machine to Minimize the Maximum LatenessFriday 09:00:00
Sandeep Karmarkar
India Institute of Management, Ahmedabad
India
G. Dutta, T. BandyopadhyayImpact of Demand Unconstraining and Dependency on Airlines Revenue PerformanceThursday 16:10:00
Ben Lauwens
Royal Military Academy
Stochastic Hybrid SimulationFriday 11:00:00
Vianney Le Clément
UCLouvain
Yves Deville, Christine SolnonConstraint-Based Graph MatchingThursday 14:00:00
Sabine Limbourg
HEC-ULg
Liège
B. JourquinLocation and market area of rail-road terminalsThursday 11:00:00
Thibaut Lust
Faculté Polytechnique de Mons
Jacques TeghemCombining metaheuristics and exact methods to solve the multiobjective multidimensional knapsack problemFriday 09:00:00
Guoxuan Ma
K.U. Leuven
Erik DemeulemeesterEvaluating the impact of case mix decisions on capacity utilizations through discrete-event simulationFriday 11:00:00
Tabitha Maes
Hasselt University
Beligië
Katrien Ramaekers, An Caris, Tom Bellemans, Gerrit JanssensIncorporating logistics decisions in activity-based freight modelingThursday 11:00:00
Thierry Marchant
Ghent University
Score-based bibliometric rankings of authorsFriday 11:00:00
Jean-luc Marichal
University of Luxembourg
Luxembourg
P. MathonetMeasuring the interactions among variables of functions over the unit hypercubeFriday 11:00:00
Pierre Mathonet
University of Luxemboug,
Luxembourg
JL. MarichalWeighted Banzhaf interaction indexes and weighted least squaresFriday 11:00:00
Pablo Andres Maya Duque
University of Antwerp
K. Sorensen, P. GoosA GRASP metaheuristic for allocating resources to improve the accessibility in a road network after a natural disasterThursday 11:00:00
Tommy Messelis
KULeuven Campus Kortrijk
Stefaan Haspeslagh, Patrick De CausmaeckerOn expressing nurse rostering constraints as propositional satisfiability problemsThursday 16:10:00
Stephane Aimé Metchebon Takougang
UMONS, Faculté Polytechnique de Mons
M. PirlotAssessing the evolution of a situation based on GISFriday 11:00:00
Gilles Meyer
University of Liège
Gilles Meyer, Silvère Bonnabel and Rodolphe SepulchreRegression on fixed-rank positive semidefinite matrices: a geometric approachThursday 11:00:00
Mustafa Misir
KaHo Sint-Lieven - Katholieke Universiteit Leuven
Katja Verbeeck, Greet Vanden Berghe, Patrick De CausmaeckerHyper-heuristics learning a varying set of low-level heuristicsFriday 09:00:00
Jean-noël Monette
Université catholique de Louvain
Yves Deville, Pascal Van HentenryckJust-In-Time Scheduling with Constraint ProgrammingFriday 11:00:00
Sébastien Mouthuy
Université Catholique de Louvain
Y.Deville and P.Van Hentenryck Constraint-based Very Large-Scale NeighborhoodsThursday 14:00:00
Giang Nguyen
Universite Libre de Bruxelles
Markov Chains to solve the Hamiltonian Cycle ProblemThursday 11:00:00
Sergio Perelman
Université de Liège
Tomas SerebriskyMeasuring the Technical Efficiency of Airports in Latin America and the CaribbeanThursday 16:10:00
Quang Dung Pham
UCLouvain
Yves DEVILLE, Pascal van HENTENRYCKConstrained Optimum Paths Problems with LS(Graph)Thursday 16:10:00
Thierry Pironet
Université de Liège
Amand, Arda, Crama, Kronus, PironetVehicle loading optimization with stochastic supplyThursday 11:00:00
Michael Poss
Université Libre de Bruxelles
L.S. Moulin, C. SagastizabalTransmission Expansion Planning with Re-designThursday 11:00:00
Birger Raa
Ghent University
W. DullaertAn integrated solution method for order batching and pickingFriday 15:10:00
Patrick Schittekat
University of Antwerp
Frederik MichieksSearching for reliable routes in case of customer demand dependenceThursday 14:00:00
Frederic Semet
Ecole Centrale de Lille
France
B. Gendron, P.-V. KhuongVariable Neighborhood Approaches For a Multi-Echelon Capacitated Location-Distribution ProblemFriday 09:25:00
Rodolphe Sepulchre
Université de Liège
Michel Journée, Peter Richtarik, Yurii NesterovGeneralized Power Method for Sparse Principal Component AnalysisThursday 11:00:00
Megha Sharma
Indian Institute of Management Ahmedabad
India
D. GoshDesign of Reliable NetworksThursday 11:00:00
Thomas Stützle
Université Libre de Bruxelles (ULB)
Brussels
Prasanna Balaprakash, Mauro Birattari, Marco DorigoEffective Estimation-based Stochastic Local Search Algorithms for Stochastic Routing ProblemsFriday 11:00:00
Kenneth SÖrensen
Universiteit Antwerpen
Dirk CattrysseA Variable Neighbourhood Search metaheuristic for scheduling the hot rolling operations at a steel millThursday 16:10:00
Fabrice Talla Nobibon
Katholieke Universiteit Leuven
C. Hurkens, R. Leus, FCR. SpieksmaColoring Graphs to Avoid Monochromatic CyclesFriday 15:10:00
Philippe Toint
Fac. Universitaires Notre-Dame de la Paix
BFO: a simple "brute-force" optimizerThursday 14:00:00
Konstantinos Triantis
Virginia Tech/Northern Virginia Center
Usa
Warren Vaneman, Kalyan PasupathyDynamic Performance Measurement and Evaluation: Will Bridging Paradigms Lead to Improved System Design?Thursday 16:10:00
Natalya Usotskaya
Maastricht University
Netherlands
A.Berger, A.GrigorievThe time-optimal helicopter trajectory is a circle segmentThursday 14:00:00
Joos Van Den Bergh
University of Antwerp
Kenneth SorensenEffective routing for couriers: a divide and conquer strategyThursday 14:00:00
Rowan Van Schaeren
Antwerp Maritime Academy
Tank allocation for liquid bulk vessels using a hybrid constraint programming approachFriday 11:00:00
Sofie Van Volsem
Ghent University
Zwijnaarde
S. NeirynckUsing the PlayStation3 for speeding up metaheuristic optimizationFriday 09:00:00
Wim Vancroonenburg
KaHo Sint-Lieven
T. Wauters, G. Vanden BergheA real world 1D stock cutting problem: exact and heuristic algorithmsThursday 14:00:00
Pablo Vanegas
Katholieke Universiteit Leuven
Dirk Cattrysse, Jos Van OrshovenBudget Constraint in Reforestation for Sediment Flow MinimizationThursday 14:00:00
Jannes Verstichel
KaHo Sint-Lieven
G. Vanden Berghe, H. CallensA pooling approach for the feed mixing problemThursday 11:00:00
Joris Walraevens
Ghent University - UGent
Tom Maertens. Herwig BruneelGeneralization of preemptive and non-preemptive priority queuesFriday 11:00:00
Tony Wauters
KaHo Sint-Lieven
Jannes Verstichel, Katja Verbeeck, Greet Vanden BergheA hybrid learning and combinatorial optimization approach for automotive maintenance schedulingThursday 16:10:00
Pieter Wuille
KULeuven
Tom SchrijversFinite Domain Modeling and Solving in the Monadic Constraint Programming FrameworkThursday 16:10:00
80 talks
A few more names should appear in the short future.
 
 
  SOGESCI/ORBEL
QuantOM - HEC-Management School - University of Liège
Our partners: