A variable neighborhood descent approach for the two-dimensional bin packing problem

DOI10.1016/j.endm.2014.11.016zbMath1362.90364MaRDI QIDQ2631240

Dhouha Ghazouani, Nadia Dahmani, Saoussen Krichen

Publication date: 29 July 2016

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

zbMATH Keywords

heuristics; variable neighborhood descent; two-dimensional bin packing problem

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

Homogeneous grouping of non-prime steel products for online auctions: a case study, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers

Cites Work

• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• Variable neighbourhood search: methods and applications
• Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
• The two-dimensional finite bin packing problem. II: New lower and upper bounds
• Two-dimensional packing problems: a survey
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
• Two-Dimensional Finite Bin-Packing Algorithms
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Guided construction search metaheuristics for the capacitated p-median problem with single source constraint