A hybrid heuristic algorithm for the 2D variable-sized bin packing problem

DOI10.1016/J.EJOR.2014.03.049zbMATH Open1338.90217OpenAlexW2070817017WikidataQ57569999 ScholiaQ57569999MaRDI QIDQ296697FDOQ296697

Authors: Shaohui Hong, Defu Zhang, Hoong Chuin Lau, XiangXiang Zeng, Yain-Whar Si 

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.03.049

Recommendations

• The two-dimensional bin packing problem with variable bin sizes and costs
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics
• A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
• A variable neighborhood descent approach for the two-dimensional bin packing problem

zbMATH Keywords

simulated annealingheuristicpackingguillotine constraint

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Cites Work

• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Algorithms for the variable sized bin packing problem
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• LP models for bin packing and cutting stock problems
• An agent-based approach to the two-dimensional guillotine bin packing problem
• A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• A population heuristic for constrained two-dimensional non-guillotine cutting
• A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• The two-dimensional bin packing problem with variable bin sizes and costs
• Exact solution of the two-dimensional finite bin packing problem
• An exact approach to the strip-packing problem
• Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
• Two-Dimensional Finite Bin-Packing Algorithms
• Title not available (Why is that?)
• Average-case analysis of cutting and packing in two dimensions
• Data set generation for rectangular placement problems
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• Recent advances on two-dimensional bin packing problems

Cited In (16)

• Title not available (Why is that?)
• A hybrid algorithm based on variable neighbourhood for the strip packing problem
• A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
• An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
• Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem
• A morph-based simulated annealing heuristic for a modified bin-packing problem
• A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
• A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
• A hybrid metaheuristic for the two-dimensional strip packing problem
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• The two-dimensional bin packing problem with variable bin sizes and costs
• A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
• A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
• A variable neighborhood descent approach for the two-dimensional bin packing problem
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem

This page was built for publication: A hybrid heuristic algorithm for the 2D variable-sized bin packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296697)