Augmented neural networks and problem structure-based heuristics for the bin-packing problem

@article{Kasap2012AugmentedNN,
  title={Augmented neural networks and problem structure-based heuristics for the bin-packing problem},
  author={Nihat Kasap and Anurag Agarwal},
  journal={International Journal of Systems Science},
  year={2012},
  volume={43},
  pages={1412 - 1430}
}
  • N. Kasap, Anurag Agarwal
  • Published 1 August 2012
  • Computer Science, Business
  • International Journal of Systems Science
In this article, we report on a research project where we applied augmented-neural-networks (AugNNs) approach for solving the classical bin-packing problem (BPP). AugNN is a metaheuristic that combines a priority rule heuristic with the iterative search approach of neural networks to generate good solutions fast. This is the first time this approach has been applied to the BPP. We also propose a decomposition approach for solving harder BPP, in which subproblems are solved using a combination… 
5 Citations
Resolution of one-dimensional bin packing problems using augmented neural networks and minimum bin slack
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,
Resolution of 1-D Bin Packing Problem using Augmented Neural Networks and Minimum Bin Slack
The objective of this work is to compare the Augmented Neural Network (AugNN) metaheuristic to Minimum Bin Slack (MBS) heuristic to solve Combinatorial Optimization Problems, specifically, in this
Resolution of 1-D Bin Packing Problem using Augmented Neural Networks and Minimum Bin Slack
The objective of this work is to compare the Augmented Neural Network (AugNN) metaheuristic to Minimum Bin Slack (MBS) heuristic to solve Combinatorial Optimization Problems, specifically, in this
Resolução de problemas de Bin Packing utilizando rede neural aumentada e Minimum Bin Slack
The objective of this work is to compare the Augmented Neural Network (AugNN) metaheuristic with Minimum Bin Slack (MBS) heuristic to solve Combinatorial Optimization Problems, specifically, in this

References

SHOWING 1-10 OF 29 REFERENCES
Augmented neural networks for task scheduling
Theoretical insights into the augmented-neural-network approach for combinatorial optimization
TLDR
Some theoretical insights and justification for the AugNN approach are provided through some basic theorems and the algorithm and the formulation are described with the help of examples.
A morph-based simulated annealing heuristic for a modified bin-packing problem
TLDR
This paper presents a local-search heuristic, based on the simulated annealing (SA) algorithm for a modified bin-packing problem (MBPP), and concludes that the morphing process is a significant enhancement to SA algorithms for these problems.
Hybrid genetic algorithms for bin-packing and related problems
TLDR
This paper describes a general approach which promises good performance for a fairly extensive class of problems by hybridizing the GA with existing simple heuristics, and raises the possibility of blending GAs with orthodox mathematical programming procedures.
Bin-packing by simulated annealing
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem
TLDR
The hybrid improvement procedure for the bin packing problem improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms.
NeuroGenetic approach for combinatorial optimization: an exploratory analysis
TLDR
The proposed NeuroGenetic approach combines the Augmented Neural Network and the Genetic Algorithm search approaches by interleaving the two, which offer complementary advantages and disadvantages and capitalizes on the strong points of each approach while avoiding their shortcomings.
Exact solution of bin-packing problems using column generation and branch-and-bound
TLDR
The linear relaxation of this model provides a strong lower bound for the bin‐packing problem and leads to tractable branch‐and‐bound trees for the instances under consideration.
Evolutionary based heuristic for bin packing problem
Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
...
...