HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS

DOI10.1142/S0217595911003168zbMath1211.90193MaRDI QIDQ2998846

No author found.

Publication date: 11 May 2011

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

local searchguillotine cut2D rectangular SBSBPPstochastic neighborhood structurestwo dimensional bin packing and cutting stock problems

Mathematics Subject Classification ID

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

Related Items (max. 100)

Sequential heuristic for the two-dimensional bin-packing problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Hybrid approach for the two-dimensional bin packing problem with two-staged patterns

Cites Work

• Recent advances on two-dimensional bin packing problems
• An integer programming model for two- and three-stage two-dimensional cutting stock problems
• Variable neighborhood search
• Two-dimensional packing problems: a survey
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
• New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
• An improved typology of cutting and packing problems
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• On Packing Two-Dimensional Bins
• An Algorithm for Two-Dimensional Cutting Problems
• Variable neighborhood search: Principles and applications

This page was built for publication: HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS