dc.creatorCamacho, Guillermo Alberto
dc.creatorAlvarez, David
dc.creatorCuellar, Daniel
dc.date2018-02-01T08:00:00Z
dc.date.accessioned2022-10-13T13:37:35Z
dc.date.available2022-10-13T13:37:35Z
dc.identifierhttps://ciencia.lasalle.edu.co/scopus_unisalle/240
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4158031
dc.descriptionThis 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.
dc.sourceIEEE Latin America Transactions
dc.source620
dc.subjectDistributor's Pallet Packing Problem-DPPP
dc.subjectGRASP
dc.subjectGreedy Randomized Adaptive Search Procedure
dc.subjectThree Dimensional Multiple Bin-Size Bin Packing Problem-3DMBSBPP
dc.titleHeuristic Approach for the Multiple Bin-Size Bin Packing Problem
dc.typeArticle


Este ítem pertenece a la siguiente institución