A maximal-space algorithm for the container loading problem

• Tipo: Artigo em Revista Científica Internacional
• Data: 2008

Autores

Parreno, F (Autor) Outra; Alvarez Valdes, R (Autor) Outra; Tamarit, JM (Autor) Outra; Oliveira, JF (Autor) FEUP

Revista

Título: INFORMS Journal on Computing

Vol. 20 Nº 3

Páginas: 412-422

ISSN: 1091-9856

Editora: Institute for Operations Research and the Management Sciences

Indexação

ISI Web of Knowledge - 63 Citações

ISI Web of Science

Scopus - 90 Citações

Classificação Científica

CORDIS: Ciências Tecnológicas > Engenharia > Engenharia industrial ; Ciências Físicas > Matemática > Matemática aplicada > Investigação operacional

FOS: Ciências da engenharia e tecnologias > Biotecnologia industrial

Outras Informações

ID Authenticus: P-003-YVH

DOI: 10.1287/ijoc.1070.0254

Abstract (EN): In this paper, a greedy randomized adaptive search procedure (GRASP) for the container loading problem is presented. This approach is based on a constructive block heuristic that builds upon the concept of maximal space, a nondisjoint representation of the free space in a container. This new algorithm is extensively tested over the complete set of Bischoff and Ratcliff problems [Bischoff, E. E., M. S. W. Ratcliff. 1995. Issues in the development of approaches to container loading. Omega 23 377-390], ranging from weakly heterogeneous to strongly heterogeneous cargo, and outperforms all the known nonparallel approaches that, partially or completely, have used this set of test problems. When comparing against parallel algorithms, it is better on average but not for every class of problem. In terms of efficiency, this approach runs in much less computing time than that required by parallel methods. Thorough computational experiments concerning the evaluation of the impact of algorithm design choices and internal parameters on the overall efficiency of this new approach are also presented.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 11