Investigating the Effectiveness of Shallow and Deep Learning Techniques on Predicting the Quality of a Policy Matrix
The Original Bin Packing problem is a classic one where a finite number of items varying in size are packed into bins of fixed capacity. This is an easy problem to solve and there are many simple algorithms to provide near optimal packing. Larger instances of the problem however require slightly mor...
| Main Author: | |
|---|---|
| Format: | Dissertation (University of Nottingham only) |
| Language: | English |
| Published: |
2016
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/39157/ |
| _version_ | 1848795776274137088 |
|---|---|
| author | Beglou, Asghar |
| author_facet | Beglou, Asghar |
| author_sort | Beglou, Asghar |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | The Original Bin Packing problem is a classic one where a finite number of items varying in size are packed into bins of fixed capacity. This is an easy problem to solve and there are many simple algorithms to provide near optimal packing. Larger instances of the problem however require slightly more complex algorithms but are still possible to provide exact solutions. A classic and effective heuristic for example is the first fit algorithm which provides fast placement of items into the first bin which it fits in. Although this in itself is an interesting problem, one which carries more importance is the Online bin packing problem. This is the same as the original bin packing problem but with one variant. We are not aware of the number of items in the stream that arrive, and so are left with important decisions to make in order to minimise the total number of bins used. A proposed solution is through a heuristic representation in the form of a Policy Matrix which can be thought of as a 2-dimensional rule book for packing incoming items. A way to discover high performance policies is using genetic algorithms to create generations of heuristics improving in performance over iterations. However, this takes time to complete as poor performance policies take time to evaluate. To solve this problem, it was suggested to create a Fitness Approxima-tor that would approximate the performance of a policy before candidate selection during each iteration of the genetic algorithm. The steps taken towards accomplishing this involved generating large data sets of packing policies, designing and implementing neural networks to extract patterns from the structure of a policy matrix. The 2 sub-categories of neural network used are Multi-Layer Perceptron and Convolutional Neu-ral Networks, both of these function as feature extractors that can predict under-lying patterns in data. Results show that it is possible to classify and distinguish high performance policy matrices from low performance matrices, both multi-layer perceptron and convolutional neural networks displayed similarly high levels of accuracy suggesting there are patterns within the heuristics that can be identified and related to performance in packing. Further research could still be done on improving the accuracy of prediction, however the huge takeaway from this is that heuristics represented as a policy matrix can have their features define performance in their given task. |
| first_indexed | 2025-11-14T19:37:28Z |
| format | Dissertation (University of Nottingham only) |
| id | nottingham-39157 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T19:37:28Z |
| publishDate | 2016 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-391572017-10-19T17:35:05Z https://eprints.nottingham.ac.uk/39157/ Investigating the Effectiveness of Shallow and Deep Learning Techniques on Predicting the Quality of a Policy Matrix Beglou, Asghar The Original Bin Packing problem is a classic one where a finite number of items varying in size are packed into bins of fixed capacity. This is an easy problem to solve and there are many simple algorithms to provide near optimal packing. Larger instances of the problem however require slightly more complex algorithms but are still possible to provide exact solutions. A classic and effective heuristic for example is the first fit algorithm which provides fast placement of items into the first bin which it fits in. Although this in itself is an interesting problem, one which carries more importance is the Online bin packing problem. This is the same as the original bin packing problem but with one variant. We are not aware of the number of items in the stream that arrive, and so are left with important decisions to make in order to minimise the total number of bins used. A proposed solution is through a heuristic representation in the form of a Policy Matrix which can be thought of as a 2-dimensional rule book for packing incoming items. A way to discover high performance policies is using genetic algorithms to create generations of heuristics improving in performance over iterations. However, this takes time to complete as poor performance policies take time to evaluate. To solve this problem, it was suggested to create a Fitness Approxima-tor that would approximate the performance of a policy before candidate selection during each iteration of the genetic algorithm. The steps taken towards accomplishing this involved generating large data sets of packing policies, designing and implementing neural networks to extract patterns from the structure of a policy matrix. The 2 sub-categories of neural network used are Multi-Layer Perceptron and Convolutional Neu-ral Networks, both of these function as feature extractors that can predict under-lying patterns in data. Results show that it is possible to classify and distinguish high performance policy matrices from low performance matrices, both multi-layer perceptron and convolutional neural networks displayed similarly high levels of accuracy suggesting there are patterns within the heuristics that can be identified and related to performance in packing. Further research could still be done on improving the accuracy of prediction, however the huge takeaway from this is that heuristics represented as a policy matrix can have their features define performance in their given task. 2016-12-14 Dissertation (University of Nottingham only) NonPeerReviewed application/pdf en https://eprints.nottingham.ac.uk/39157/1/Asghar%20Neema%20Mohammad%20Beglou%204260017.pdf Beglou, Asghar (2016) Investigating the Effectiveness of Shallow and Deep Learning Techniques on Predicting the Quality of a Policy Matrix. [Dissertation (University of Nottingham only)] Policy matrix Multi-layer perceptron Convolutional Neural Network Online-bin-packing. |
| spellingShingle | Policy matrix Multi-layer perceptron Convolutional Neural Network Online-bin-packing. Beglou, Asghar Investigating the Effectiveness of Shallow and Deep Learning Techniques on Predicting the Quality of a Policy Matrix |
| title | Investigating the Effectiveness of Shallow and Deep Learning Techniques on
Predicting the Quality of a Policy Matrix |
| title_full | Investigating the Effectiveness of Shallow and Deep Learning Techniques on
Predicting the Quality of a Policy Matrix |
| title_fullStr | Investigating the Effectiveness of Shallow and Deep Learning Techniques on
Predicting the Quality of a Policy Matrix |
| title_full_unstemmed | Investigating the Effectiveness of Shallow and Deep Learning Techniques on
Predicting the Quality of a Policy Matrix |
| title_short | Investigating the Effectiveness of Shallow and Deep Learning Techniques on
Predicting the Quality of a Policy Matrix |
| title_sort | investigating the effectiveness of shallow and deep learning techniques on
predicting the quality of a policy matrix |
| topic | Policy matrix Multi-layer perceptron Convolutional Neural Network Online-bin-packing. |
| url | https://eprints.nottingham.ac.uk/39157/ |