three-dimensional – Optimization Online

Solving the n_1 × n_2 × n_3 Points Problem for n_3 < 6

Published: 2022/06/14

Graphs and Matroids connectivity, Covering path, Game, graph theory, Link-length, Outside the box, Point, three-dimensional, Upper bound

In this paper, we show enhanced upper bounds of the nontrivial n_1 × n_2 × n_3 points problem for every n_1

A biased random-key genetic algorithm for a 2D and 3D bin packing problem

Published: 2012/04/09

José Fernando Gonçalves

Mauricio G.C. Resende

Applications - OR and Management Sciences, Meta Heuristics biased random-key genetic algorithms, bin packing, genetic algorithm, heuristics, random keys, three-dimensional

We present a novel multi-population biased random-key genetic algorithm (BRKGA) for the 2D and 3D bin packing problem. The approach uses a maximal-space representation to manage the free spaces in the bins. The proposed algorithm uses a decoder based on a novel placement procedure within a multi-population genetic algorithm based on random keys. The BRKGA … Read more