Tutor 1

Álvarez Martínez, David

Tutor 2

Camacho Muñoz, Guillermo Alberto

Resumen

In this work, a metaheuristic adapted to a Greedy Randomized Adaptive Search Procedures (GRASP) algorithm is presented and applied to the Three-Dimensional Distributor´s Pallet Packing Problem (3D-BPP) and to the Three-Dimensional Multiple Bin Packing Problem (3D-MBSBPP). The application is contextualized in logistic distribution operations and involves constraints related to cargo, pallets and vehicles. The validation of the proposed metaheuristic is focused on comparing its performance with other tools reported in the literature by solving test instances where at least one of the problems presented in this work is considered. A four-phase methodology is introduced: (1) the construction of the state of the art regarding the problems considered in this work, (2) the selection of the test instances that involve at least one of the problems considered in this work, (3) the selection of the most appropriate indicators to evaluate the selected instances, and (4) the adaptation and coding of the metaheuristic tool. The resulting heuristic performs well when compared with the literature for the selected instances, producing efficient solutions within an acceptable computation time and complying with the constraints considered in each instance

Palabras clave

Programación heurística, Sistemas de producción, Ingeniería de la producción

Licencia Creative Commons

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Fecha de publicación

1-1-2017

Programa académico

Ingeniería Industrial

Facultad

Facultad de Ingeniería

Compartir

COinS