|
|
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
Thursday 14:00:00 Combinatorial optimization and IP applications Room 138 - Chair: Q. Louveaux
- Using mixed integer programming to win a cycling game
Jeroen Beliën (hogeschool universiteit brussel) Co-authors: Dries Goossens, Daam Van Reeth, Liesje De Boeck
- Budget Constraint in Reforestation for Sediment Flow Minimization
Pablo Vanegas (Katholieke Universiteit Leuven) Co-authors: Dirk Cattrysse, Jos Van Orshoven
- The generalized sequential ordering problem for laser cutting toolpath generation
Reginald Dewil (Katholieke Universiteit Leuven) Co-authors: Pieter Vansteenwegen, Dirk Cattrysse
- A real world 1D stock cutting problem: exact and heuristic algorithms
Wim Vancroonenburg (KaHo Sint-Lieven) Co-authors: T. Wauters, G. Vanden Berghe Abstract: In a modern joinery shop floor, profiles are cut from different materials (e.g. wood, aluminium and plastics) with different properties (e.g. color). For constructing door and window frames, the profiles need to be cut under varying angles, in order to make assembly possible. The process of cutting materials also causes losses proportional to the width of the saw blade and dependent on the angle under which the material is being cut. Lastly, cutting stock generates leftover material that sometimes still has some value. Companies are interested in reusing these leftover pieces in order to minimize waste and to reduce costs. All these factors result in the real world stock cutting problem that we will present.
We give a brief introduction to a comparative study of recent optimisation methods for this real world stock cutting problem. We will look at both exact and heuristic algorithms for solving this problem. Our first results show improvements of about 1% compared to currently used methods in practice.
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
|
|