A hybrid algorithm for constrained order packing

DOI10.1007/S10100-012-0282-3MaRDI QIDQ301159zbMATH OpenOpenAlexFDO

Authors Nikolaus Furian, Siegfried Vössner

Publication date 29 June 2016

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10100-012-0282-3

zbMATH Keywords

heuristicsconstraintsshortest pathbin packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Recommendations

• Constrained order packing: comparison of heuristic approaches for a new bin packing problem
• Exact and approximate methods for the score-constrained packing problem
• scientific article; zbMATH DE number 1830743
• Higher‐Dimensional Packing with Order Constraints
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem

Cites work

• A 2-exchange heuristic for nesting problems
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
• A heuristic for solving large bin packing problems in two and three dimensions
• A lower bound for the non-oriented two-dimensional bin packing problem
• A new lower bound for the non-oriented two-dimensional bin-packing problem
• A new model for complete solutions to one-dimensional cutting stock problems.
• A note on two problems in connexion with graphs
• A two-dimensional strip cutting problem with sequencing constraint
• An improved typology of cutting and packing problems
• Approximation algorithm for the oriented two-dimensional bin packing problem
• Constrained order packing: comparison of heuristic approaches for a new bin packing problem
• Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
• Exact solution of the two-dimensional finite bin packing problem
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Heuristic shortest path algorithms for transportation applications: state of the art
• Modified subset sum heuristics for bin packing
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
• Routing problems with loading constraints
• Strip packing with precedence constraints and strip packing with release times
• TSpack: A unified tabu search code for multi-dimensional bin packing problems
• The one-dimensional cutting stock problem with due dates
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• The two-dimensional finite bin packing problem. II: New lower and upper bounds
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
• Two-dimensional packing with conflicts
• Worst-case analysis of the subset sum algorithm for bin packing.

Cited in

(4)

• Constrained order packing: comparison of heuristic approaches for a new bin packing problem
• One-dimensional stock cutting: optimization of usable leftovers in consecutive orders
• Order Reconfiguration Under Width Constraints.
• Exact and approximate methods for the score-constrained packing problem

Describes a project that uses

Uses Software

• TOPOS
• TSpack

This page was built for publication: A hybrid algorithm for constrained order packing

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