A study of heuristic techniques inspired in natural process for the solution of the container fill problem

Authors:
M. Delgado Pineda;J. M. De Pedro Salinas;J. Aranda Almansa
Affiliations:
E.T.S.I. Informática, Universidad de Educación a Distancia;E.T.S.I. Informática, Universidad de Educación a Distancia;E.T.S.I. Informática, Universidad de Educación a Distancia
Venue:
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
Year:
2005

Citing 3
Cited 0

Genetic Algorithms Plus Data Structures Equals Evolution Programs

Genetic Algorithms Plus Data Structures Equals Evolution Programs
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search

Tabu Search

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article shows some techniques based on simulated annealing and genetic alghoritms for the resolution of a filling problem of a container of two dimensions using rectangular pieces of sizes not congruent. This problem is quite related to problems like bin-packing or strip-packing. The comparative was made using several type problems and having into account parameters like run time, number of solutions that converge to the optimum one and quality of the found non-optimum solutions.