BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem

DOI10.1016/J.ENDM.2018.03.023zbMath1408.90354OpenAlexW2796752061WikidataQ129988561 ScholiaQ129988561MaRDI QIDQ1791951

Daniel Henrique da Silva Costa, Paulo Eustáquio Duarte Pinto, Igor M. Coelho, Bruno Porto Masquio, Anderson Zudio

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.023

zbMATH Keywords

three-dimensionalbin packingVNDBRKGA

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers

Uses Software

• TSpack

Cites Work

• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• TSpack: A unified tabu search code for multi-dimensional bin packing problems
• Heuristic algorithms for the three-dimensional bin packing problem
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• The Three-Dimensional Bin Packing Problem
• Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem
• Reducibility among Combinatorial Problems

This page was built for publication: BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem