On a Hybrid Genetic Algorithm for Solving the Container Loading Problem with no Orientation Constraints

Authors:
Hamadi Hasni;Houssem Sabri
Affiliations:
Ecole Nationale des Sciences de l'Informatique, Campus Universitaire Manouba, Manouba, Tunisia 2010;Ecole Nationale des Sciences de l'Informatique, Campus Universitaire Manouba, Manouba, Tunisia 2010
Venue:
Journal of Mathematical Modelling and Algorithms
Year:
2013

Citing 9
Cited 0

Practical genetic algorithms

Practical genetic algorithms
A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
The Three-Dimensional Bin Packing Problem

Operations Research
A parallel tabu search algorithm for solving the container loading problem

Parallel Computing - Special issue: Parallel computing in logistics
Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study

Computers and Operations Research
A GRASP Approach to the Container-Loading Problem

IEEE Intelligent Systems
A new heuristic algorithm for cuboids packing with no orientation constraints

Computers and Operations Research
Extreme Point-Based Heuristics for Three-Dimensional Bin Packing

INFORMS Journal on Computing
A Maximal-Space Algorithm for the Container Loading Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new hybrid genetic algorithm for solving the container loading problem in the general case, precisely when the boxes have no orientation constraints. In order to improve the genetic algorithm efficiency, we developed a hybrid method, based on deterministic approaches combining the wall-building, level-slice approach and strip packing. A serie of experiments was achieved on 47 related benchmarks from the OR-Library. We could reach an average utilization of 94.47% and an average computation time of 840s on a 1.7 GHz core duo.