Lower bounds and reduction procedures for the bin packing problem
Discrete Applied Mathematics - Combinatorial Optimization
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem
Computers and Operations Research
Evolutionary Algorithms in Management Applications
Evolutionary Algorithms in Management Applications
New heuristics for one-dimensional bin-packing
Computers and Operations Research
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem
Journal of Heuristics
Revisiting evolutionary algorithms with on-the-fly population size adjustment
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A new representation and operators for genetic algorithms applied to grouping problems
Evolutionary Computation
Solving the quadratic assignment problem with clues from nature
IEEE Transactions on Neural Networks
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
A memetic algorithm and a parallel hyperheuristic island-based model for a 2D packing problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
In this paper, we investigate the use of evolutionary based heuristic to the one-dimensional bin packing problem (BPP). Unlike other evolutionary heuristics used with optimization problems, a non-specialized and non-hybridized algorithm is proposed and analyzed for solving BPP. The algorithm uses a modified permutation with separators encoding scheme, unique concept of separators' movements during mutation, and separators removal as a technique of problem size reduction. The set of experiments confirmed that the proposed approach is comparable to much more complicated algorithms.