Tackling the container loading problem: a hybrid approach based on integer linear programming and genetic algorithms

Authors:
Napoleão Nepomuceno;Plácido Pinheiro;André L. V. Coelho
Affiliations:
Universidade de Fortaleza, Mestrado em Informática Aplicada, Fortaleza, CE, Brazil;Universidade de Fortaleza, Mestrado em Informática Aplicada, Fortaleza, CE, Brazil;Universidade de Fortaleza, Mestrado em Informática Aplicada, Fortaleza, CE, Brazil
Venue:
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Year:
2007

Citing 2
Cited 3

Combinations of local search and exact algorithms

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II

On the concept of density control and its application to a hybrid optimization framework: Investigation into cutting problems

Computers and Industrial Engineering
Applying backtracking heuristics for constrained two-dimensional guillotine cutting problems

ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
The generate-and-solve framework revisited: generating by simulated annealing

EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Integer Linear Programming (ILP) and Genetic Algorithms (GAs). More precisely, a GA engine works as a generator of reduced instances for the original CL problem, which are formulated as ILP models. These instances, in turn, are solved by an exact optimization technique (solver), and the performance measures accomplished by the respective models are interpreted as fitness values by the genetic algorithm, thus guiding its evolutionary process. Computational experiments performed on standard benchmark problems, as well as a practical case study developed in a metallurgic factory, are also reported and discussed here in a manner as to testify the potentialities behind the novel approach.