Heuristic Approach for the Multiple Bin-Size Bin Packing Problem
DOI
https://doi.org/10.1109/TLA.2018.8327421
Document Type
Article
Publication Date
2-1-2018
Publication Title
IEEE Latin America Transactions
Abstract
This article presents a heuristic to solve instances of the MBSBPP - Multiple Bin-Size Bin Packing Problem. The heuristic is validated by comparison with a commercial tool of high acceptance. A four-step methodology is used: (A) design of the optimization algorithm, (B) selection of test data, (C) calculation of the solution using the Cape Pack® and GrasPacking v1.0 optimization tools, (D) performance validation by comparison, with emphasis in the percentage of use and computational time. The performance of the proposed algorithm is evaluated in experimental cases and in instances associated with delivery orders of a logistic company. The results allow us to conclude that the proposed heuristic has a good performance and can overcome the commercial tool.
Volume
16
Issue
2
First Page
620
Last Page
626
ISSN
15480992
Recommended Citation
Camacho, Guillermo Alberto; Alvarez, David; and Cuellar, Daniel, "Heuristic Approach for the Multiple Bin-Size Bin Packing Problem" (2018). Scopus Unisalle. 240.
https://ciencia.lasalle.edu.co/scopus_unisalle/240
Identifier
SCOPUS_ID:85045017054