Resolution of one-dimensional bin packing problems using augmented neural networks and minimum bin slack Online publication date: Mon, 05-Dec-2016
by Ricardo De Almeida; Maria Teresinha Arns Steiner
International Journal of Innovative Computing and Applications (IJICA), Vol. 7, No. 4, 2016
Abstract: The objective of this work is to compare the augmented neural network (AugNN) metaheuristic to minimum bin slack (MBS) heuristic to solve combinatorial optimisation problems, specifically, in this case, the one-dimensional bin packing problem (1D-BPP), a class of cutting and packing problems (CPP). CPP are easily found among various industry sectors and its proper treatment can improve the use of stocks in cutting problems or optimise physical space in packing problems. In order to optimise AugNN parameters, a design of experiment (DOE) was applied in order to guide a statistical analysis of different configurations of AugNN. The tests, developed in many benchmark problems found in the literature, showed that MBS heuristic was, in general superior, both in terms of the solution quality, which is about 70% better, and computational time, which is about 90% less.
Online publication date: Mon, 05-Dec-2016
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com