Heuristics for packing semifluids

DOI10.1016/J.EJOR.2019.10.002MaRDI QIDQ2286867zbMATH OpenOpenAlexWikidataFDO

Authors João Pedro Pedroso

Publication date 23 January 2020

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

Full work available at URL https://arxiv.org/abs/1607.04403

zbMATH Keywords

heuristicspackingsemifluidsplittable itemstree searchtwo-dimensional knapsack problem

Mathematics Subject Classification ID

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

Abstract: Physical properties of materials are seldom studied in the context of packing problems. In this work we study the behavior of semifluids: materials with particular characteristics, that share properties both with solids and with fluids. We describe the importance of some specific semifluids in an industrial context, and propose methods for tackling the problem of packing them, taking into account several practical requirements and physical constraints. Although the focus of this paper is on the computation of practical solutions, it also uncovers interesting mathematical properties of this problem, which differentiate it from other packing problems.

Recommendations

• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Two-dimensional packing problems: a survey
• A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
• Heuristic placement routines for two-dimensional bin packing problem

Cites work

• A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
• A New Linear Programming Approach to the Cutting Stock Problem
• An Algorithm for Two-Dimensional Cutting Problems
• An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
• An integer programming model for two- and three-stage two-dimensional cutting stock problems
• Arc-flow model for the two-dimensional guillotine cutting stock problem
• Branch-and-Bound Methods: A Survey
• Characterization and modelling of guillotine constraints
• Constraint Integer Programming: A New Approach to Integrate CP and MIP
• Exact algorithms for the two-dimensional guillotine knapsack
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• Integer linear programming models for 2-staged two-dimensional knapsack problems
• LP models for bin packing and cutting stock problems
• Modeling two-dimensional guillotine cutting problems via integer programming
• Multistage Cutting Stock Problems of Two and More Dimensions
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Production Planning by Mixed Integer Programming
• Recursive circle packing problems
• Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem

Describes a project that uses

Uses Software

• SCIP

This page was built for publication: Heuristics for packing semifluids

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