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

 

Detailed schedule

Click on a link for more details
Show all the abstracts
Thursday 28, 2010
8:30-9:00Registration - Welcome coffee
9:00-9:30Welcoming session - Room 030
9:30-10:30Plenary session: P. Baptiste
Sustainable Development: How can we help

Room 030
10:30-11:00Coffee break
11:00-12:40Parallel sessions
  Timetabling in education and sport
Chair: G. Vanden Berghe
Room: 126
Transportation management
Chair: F. Semet
Room: 130
Networks
Chair: B. Fortz
Room: 138
Nonconvex optimization 1
Chair: F. Bach
Room: 035
12:40-14:00Lunch (and board meeting)
14:00-15:40Parallel sessions
  Constraint programming models 1
Chair: Y. Deville
Room: 126
Vehicle routing
Chair: S. Limbourg
Room: 130
Combinatorial optimization and IP applications
Chair: Q. Louveaux
Room: 138
Nonconvex Optimization 2
Chair: R. Sepulchre
Room: 035
15:40-16:10Coffee break
16:10-17:50Parallel sessions
  Constraint programming models 2
Chair: P. Schaus
Room: 126
Performance modeling
Chair: G. Janssens
Room: 130
Scheduling
Chair: K. Sorensen
Room: 138
Planning under uncertainty
Chair: R. Leus
Room: 035
17:50-General Assembly (Room 138)
18:45-Conference dinner

Friday 29, 2010
9:00-10:40Parallel sessions
  Metaheuristics
Chair: J. Teghem
Room: 126
Production and distribution (9:25)
Chair: Y. Arda
Room: 130
Multiple criteria
Chair: R. Bisdorff
Room: 138
Stochastic models (9:25)
Chair: L. Esch
Room: 035
10:40-11:00Coffee break
11:00-12:40Parallel sessions
  Constraint programming and Supply Chain Management
Chair: Y. Deville
Room: 126
OR in health management
Chair: P. De Causmaecker
Room: 130
Rankings and importance indices
Chair: JL. Marichal
Room: 138
Queueing
Chair: S. Wittevrongel
Room: 035
12:40-14:00Lunch
14:00-15:00Plenary session: M. Goemans
The Power of Matroids

Room 030
15:10-16:00Parallel sessions
  Optimization software
Chair: E. Loute
Room: 126
Integrated operations planning
Chair: B. Raa
Room: 130
Cycles in graphs
Chair: F. Spieksma
Room: 138
 
16:00-16:35Plenary session: ORBEL award and closing session
Room 030
16:35-...Coffee break
Show all the abstracts
Thursday 11:00:00 Timetabling in education and sport
Room 126 - Chair: G. Vanden Berghe

Thursday 11:00:00 Transportation management
Room 130 - Chair: F. Semet

Thursday 11:00:00 Networks
Room 138 - Chair: B. Fortz

Thursday 11:00:00 Nonconvex optimization 1
Room 035 - Chair: F. Bach

Thursday 14:00:00 Constraint programming models 1
Room 126 - Chair: Y. Deville

Thursday 14:00:00 Vehicle routing
Room 130 - Chair: S. Limbourg
  • Integrating empty container allocation with vehicle routing decisions
    Kris Braekers (Universiteit Hasselt)
    Co-authors: Gerrit K. Janssens and An Caris
  • Searching for reliable routes in case of customer demand dependence
    Patrick Schittekat (University of Antwerp)
    Co-authors: Frederik Michieks
  • Effective routing for couriers: a divide and conquer strategy
    Joos Van Den Bergh (University of Antwerp)
    Co-authors: Kenneth Sorensen
    Abstract:
    The vehicle routing problems faced by courier companies are among the most challenging ones in existence. Unlike some other difficult routing problems, this is not so much due to the mathematical complexity of the routing problem, but to the enormous amounts of deliveries that need to be performed every day, and to a number of requirements that are generally overlooked in vehicle routing ap- plications. These requirements include the fact that customers that frequently require delivery should always be visited by the same driver, and the fact that sorting should start before all drop locations are known. More than a compu- tational challenge, this presents an organizational challenge to the planners at routing companies. Up to now, efficient tools for the planning of these challenging routing problems are lacking. In logistics optimization, the general assumption is that integrated decision making is better. A consequence is that the different optimization problems that appear in the operational planning of the supply chain should be combined into a single global optimization problem and solved as such. In this talk, we demonstrate that this approach does not work for large and complex courier routing problems. On the contrary: even integrating all the decisions in the vehicle routing problem faced by courier companies results in an organizational nightmare. Rather, courier companies successfully divide their vehicle routing problems in more manageable sub-problems that are solved independently. This has many organizational advantages, but presents additional challenges, such as the question on how the different optimization problems should be coupled. In this talk, we present the global routing problem faced by courier compa- nies, and present a technique to efficiently solve it by dividing it into several subproblems. We discuss the coupling of these subproblems and present some challenges for future research.

Thursday 14:00:00 Combinatorial optimization and IP applications
Room 138 - Chair: Q. Louveaux

Thursday 14:00:00 Nonconvex Optimization 2
Room 035 - Chair: R. Sepulchre

Thursday 16:10:00 Constraint programming models 2
Room 126 - Chair: P. Schaus

Thursday 16:10:00 Performance modeling
Room 130 - Chair: G. Janssens

Thursday 16:10:00 Scheduling
Room 138 - Chair: K. Sorensen

Thursday 16:10:00 Planning under uncertainty
Room 035 - Chair: R. Leus

Friday 09:00:00 Metaheuristics
Room 126 - Chair: J. Teghem

Friday 09:25:00 Production and distribution (9:25)
Room 130 - Chair: Y. Arda

Friday 09:00:00 Multiple criteria
Room 138 - Chair: R. Bisdorff

Friday 09:25:00 Stochastic models (9:25)
Room 035 - Chair: L. Esch

Friday 11:00:00 Constraint programming and Supply Chain Management
Room 126 - Chair: Y. Deville

Friday 11:00:00 OR in health management
Room 130 - Chair: P. De Causmaecker

Friday 11:00:00 Rankings and importance indices
Room 138 - Chair: JL. Marichal

Friday 11:00:00 Queueing
Room 035 - Chair: S. Wittevrongel

Friday 15:10:00 Optimization software
Room 126 - Chair: E. Loute

Friday 15:10:00 Integrated operations planning
Room 130 - Chair: B. Raa

Friday 15:10:00 Cycles in graphs
Room 138 - Chair: F. Spieksma

 
 
  SOGESCI/ORBEL
QuantOM - HEC-Management School - University of Liège
Our partners: