𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving non-oriented two dimensional bin packing problem using evolutionary particle swarm optimisation

✍ Scribed by Omar, Mohamed K.; Ramakrishnan, Kumaran

Book ID
120635702
Publisher
Taylor and Francis Group
Year
2013
Tongue
English
Weight
348 KB
Volume
51
Category
Article
ISSN
0020-7543

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new lower bound for the non-oriented t
A new lower bound for the non-oriented two-dimensional bin-packing problem
✍ FranΓ§ois Clautiaux; Antoine Jouglet; Joseph El Hayek πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 183 KB

We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous results. Computational experiments show that the bounds are tight. We also discuss the case where the bin is not a square.

[ACM Press the 13th annual conference co
[ACM Press the 13th annual conference companion - Dublin, Ireland (2011.07.12-2011.07.16)] Proceedings of the 13th annual conference companion on Genetic and evolutionary computation - GECCO '11 - A hyper-heuristic for solving one and two-dimensional bin packing problems
✍ LΓ³pez-Camacho, Eunice; Terashima-MarΓ­n, Hugo; Ross, Peter πŸ“‚ Article πŸ“… 2011 πŸ› ACM Press βš– 437 KB

The idea behind hyper-heuristics is to discover rules that relate different problem states with the best single heuristic to apply. This investigation works towards extending the problem domain in which a given hyper-heuristic can be applied and implements a framework to generate hyperheuristics for