Picture map of Europe with pins indicating European capital cities

Open Access research with a European policy impact...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by Strathclyde researchers, including by researchers from the European Policies Research Centre (EPRC).

EPRC is a leading institute in Europe for comparative research on public policy, with a particular focus on regional development policies. Spanning 30 European countries, EPRC research programmes have a strong emphasis on applied research and knowledge exchange, including the provision of policy advice to EU institutions and national and sub-national government authorities throughout Europe.

Explore research outputs by the European Policies Research Centre...

A computational study of the local cuts from two-period convex hull closures for big-bucket lot-sizing problems

Fragkos, Ioannis and Akartunali, Kerem (2014) A computational study of the local cuts from two-period convex hull closures for big-bucket lot-sizing problems. In: International Workshop on Lot-Sizing (IWLS) 2014, 2014-08-27 - 2014-08-29.

PDF (Fragkos-Akartunali-IWLS2014-two-period-convex-hull-closures-big-bucket-lot-sizing)
Fragkos_Akartunali_IWLS2014_two_period_convex_hull_closures_big_bucket_lot_sizing.pdf - Accepted Author Manuscript

Download (64kB) | Preview


We study the big-bucket capacitated lot sizing problem with setup times. We use the novel methodology of Akartunali et al. (2014) that exploits two-period relaxations of the formulation in order to generate inequalities that cut-off the optimal solution of the linear programming relaxation. Our approach applies column generation in an unconventional way, with the master problem being a distance minimizing formulation and the subproblems being combina-torial two-period relaxations of the original problem. We identify a lower bound of the dimensionality of the generated cuts and provide extensive computational experiments that show how the generated bounds compare with other state-of- the-art approaches. Our results show that, for certain classes of problems, the bound improvement is considerable.