Multi-container loading with non-convex 3D shapes using a GA/TS hybrid

Authors:
Philipp Nebel;Gunther Richter;Karsten Weicker
Affiliations:
HTWK Leipzig, Leipzig, Germany;ccc software gmbh, Markkleeberg, Germany;HTWK Leipzig, Leipzig, Germany
Venue:
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Year:
2012

Citing 5
Cited 0

The Three-Dimensional Bin Packing Problem

Operations Research
A Maximal-Space Algorithm for the Container Loading Problem

INFORMS Journal on Computing
A Tree Search Algorithm for Solving the Container Loading Problem

INFORMS Journal on Computing
A hybrid genetic algorithm for packing in 3d with deepest bottom left with fill method

ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
Local search for a multi-drop multi-container loading problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A genetic algorithm is developed for a multi-container problem and integrated into a commercial software product. The considered problem is characterized by specific requirements, e.g. non-convex 3D shapes composed of several cuboids and a broad range of constraints. The algorithm uses the packing list as genotype, the first-fit heuristic for placing the items, and a set of problem-specific operators. The algorithm is tested on simple examples, benchmarks by Bischoff/Ratcliff and Loh/Nee, and real-world customer data. The proposed algorithm proves to be an all-rounder that excels on non-convex problems and delivers acceptable results on regular (benchmark) problems.