|
|
Detailed schedule
Click on a link for more details
Show all the abstracts
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
|
|