A Branch-and-Price Algorithm for Bin Packing Problem
dc.contributor.advisor | Chen, Michael | |
dc.creator | Ataei, Masoud | |
dc.date.accessioned | 2015-12-16T19:28:16Z | |
dc.date.available | 2015-12-16T19:28:16Z | |
dc.date.copyright | 2015-08-27 | |
dc.date.issued | 2015-12-16 | |
dc.date.updated | 2015-12-16T19:28:16Z | |
dc.degree.discipline | Applied and Industrial Mathematics | |
dc.degree.level | Master's | |
dc.degree.name | MSc - Master of Science | |
dc.description.abstract | Bin Packing Problem examines the minimum number of identical bins needed to pack a set of items of various sizes. Employing branch-and-bound and column generation usually requires designation of the problem-specific branching rules compatible with the nature of the pricing sub-problem of column generation, or alternatively it requires determination of the k-best solutions of knapsack problem at level kth of the tree. Instead, we present a new approach to deal with the pricing sub-problem of column generation which handles two-dimensional knapsack problems. Furthermore, a set of new upper bounds for Bin Packing Problem is introduced in this work which employs solutions of the continuous relaxation of the set-covering formulation of Bin Packing Problem. These high quality upper bounds are computed inexpensively and dominate the ones generated by state-of-the-art methods. | |
dc.identifier.uri | http://hdl.handle.net/10315/30728 | |
dc.language.iso | en | |
dc.rights | Author owns copyright, except where explicitly noted. Please contact the author directly with licensing requests. | |
dc.subject | Applied mathematics | |
dc.subject.keywords | Bin Packing Problem | |
dc.subject.keywords | Branch-and-Bound | |
dc.subject.keywords | Column Generation | |
dc.title | A Branch-and-Price Algorithm for Bin Packing Problem | |
dc.type | Electronic Thesis or Dissertation |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Ataei_Masoud_2015_Masters.pdf
- Size:
- 2.85 MB
- Format:
- Adobe Portable Document Format