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 |
Abstract
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.
Creators(s): |
Fragkos, Ioannis and Akartunali, Kerem ![]() | Item type: | Conference or Workshop Item(Paper) |
---|---|
ID code: | 51975 |
Keywords: | convex hull closures, lot-sizing problems, two-period relaxations, Manufactures, Industrial and Manufacturing Engineering, Control and Optimization |
Subjects: | Technology > Manufactures |
Department: | Strathclyde Business School > Management Science |
Depositing user: | Pure Administrator |
Date deposited: | 27 Feb 2015 10:18 |
Last modified: | 21 Dec 2020 02:43 |
Related URLs: | |
URI: | https://strathprints.strath.ac.uk/id/eprint/51975 |
Export data: |