|
|
Detailed schedule
Click on a link for more details
Show all the abstracts
Thursday 30 January:
Thursday 11:15-12:30 TA-1: COMEX - Optimization 1 Room Vesale 023 - Chair: M. Schyns
Thursday 11:15-12:30 TA-2: Software and Implementation Room Vesale 020 - Chair: M. Mezmaz
Thursday 11:15-12:30 TA-3: COMEX - Smart mobility Room Vesale 025 - Chair: A. Caris
Thursday 11:15-12:30 TA-4: Systems Room Pentagone 0A11 - Chair: P. Kunsch
Thursday 14:00-15:40 TB-1: Data Analysis 1 Room Vesale 023 - Chair: X.Siebert
Thursday 14:00-15:40 TB-2: Multiple Objectives Room Vesale 020 - Chair: Y. de Smet
Thursday 14:00-15:40 TB-3: Logistics Room Vesale 025 - Chair: D. De Wolf
Thursday 14:00-15:40 TB-4: COMEX - Applications to Economy Room Pentagone 0A11 - Chair: W. Brauers
Thursday 14:00-15:40 TB-5: Networks Room Pentagone 0A07 - Chair: B. Fortz
Thursday 16:10-17:25 TC-1: Mixed-integer nonlinear programming Room Vesale 023 - Chair: Y. Crama
Thursday 16:10-17:25 TC-2: Decision Analysis 1 Room Vesale 020 - Chair: S. Eppe
Thursday 16:10-17:25 TC-3: Routing Room Vesale 025 - Chair: K. Sörensen
Thursday 16:10-17:25 TC-4: Graphs Room Pentagone 0A11 - Chair: H. Mélot
Thursday 16:10-17:25 TC-5: Scheduling Room Pentagone 0A07 - Chair: S. Hanafi
Friday 9:00-10:15 FA-1: Queuing Room Vesale 023 - Chair: S. Wittevrongel
Friday 9:00-10:15 FA-2: Decision Analysis 2 Room Vesale 020 - Chair: R. Bisdorff
Friday 9:00-10:15 FA-3: COMEX - Optimization 2 Room Vesale 025 - Chair: M. Labbé
Friday 9:00-10:15 FA-4: Production Room Pentagone 0A11 - Chair: D. Tuyttens
Friday 14:00-15:40 FB-1: Data Analysis 2 Room Vesale 023 - Chair: P. Fortemps
Friday 14:00-15:40 FB-2: Heuristics Room Vesale 020 - Chair: T. Stützle
Friday 14:00-15:40 FB-3: COMEX - Transportation Room Vesale 025 - Chair: F. Spieksma
- Horizontal cooperation in logistics : Order sharing through joint route planning
Lotte Verdonck (Hasselt University) Co-authors: An Caris, Katrien Ramaekers, Gerrit K. Janssens Abstract: Transportation companies operating at the same level of the supply chain may cooperate horizontally to increase their efficiency levels. Analysis of existing scientific research on horizontal carrier collaboration reveals that the majority of logistics cooperation literature may be divided into two main research streams: order sharing and capacity sharing. In this paper one approach to order sharing is presented: joint route planning. Applying joint route planning, customer orders from all carriers are combined and collected in a central pool and efficient route schemes are set up for all requests simultaneously using appropriate vehicle routing techniques. The routing problem associated with horizontally cooperating carriers may be defined as a multi-depot pickup and delivery problem with time windows (MDPDPTW). The benefits of cooperative optimisation are demonstrated by means of a small numerical example. To conclude, solution techniques suitable to solve instances with a large number of requests are discussed.
- Multi-period vehicle assignment with stochastic load availability
Thierry Pironet (HEC - University of Liege) Co-authors: Yves CRAMA
- An Exact Bi-directional Dynamic Programming Algorithm for an Elementary Shortest Path Problem with Variable Service Start Time
Hande Küçükaydin (University of Liège) Co-authors: Yasemin Arda, Yves Crama
- Incorporating axle weight restrictions in a two-dimensional CVRP
Hanne Pollaris (Hasselt University) Co-authors: Kris Braekers, An Caris, Gerrit K. Janssens
Friday 14:00-15:40 FB-4: Health Room Pentagone 0A11 - Chair: G. Vanden Berghe
|
|