Two-dimensional packing problems: a survey

From MaRDI portal

Publication:1847188

Jump to:navigation, search

DOI10.1016/S0377-2217(02)00123-6zbMath1081.90576WikidataQ56169156 ScholiaQ56169156MaRDI QIDQ1847188

Andrea Lodi, Michele Monaci, Silvano Martello

Publication date: 17 November 2002

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

zbMATH Keywords

Bin packing problems Strip packing problems Two-dimensional packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms, Integrated shipment dispatching and packing problems: a case study, On the Approximability of Orthogonal Order Preserving Layout Adjustment, Sequential heuristic for the two-dimensional bin-packing problem, A variable neighborhood descent approach for the two-dimensional bin packing problem, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem, An effective hybrid algorithm for the problem of packing circles into a larger containing circle, An improved typology of cutting and packing problems, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, A hybrid genetic algorithm for the two-dimensional single large object placement problem, A new exact method for the two-dimensional orthogonal packing problem, A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem, Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic, A dynamic adaptive local search algorithm for the circular packing problem, An integrated cutting stock and sequencing problem, A two-dimensional strip cutting problem with sequencing constraint, Optimising the cutting of wood fibre plates in the hardboard industry, Exhaustive approaches to 2D rectangular perfect packings, Arc-flow model for the two-dimensional guillotine cutting stock problem, An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem, Approximation and online algorithms for multidimensional bin packing: a survey, Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning, Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, Vehicle routing with private and shared delivery locations, The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview, The bin packing problem with item fragmentation: a worst-case analysis, Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics, Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques, Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries, An introduction to the two‐dimensional rectangular cutting and packing problem, Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, A mathematical modeling approach to optimize composite parts placement in autoclave, Metaheuristics for truck loading in the car production industry, Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width, HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS, Asymptotically optimal scheduling of random malleable demands in smart grid, Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem, An enumeration scheme to generate constrained exact checkerboard patterns, An optimization algorithm for a penalized knapsack problem, Two-dimensional bin packing with one-dimensional resource augmentation, O problema de corte de estoque em indústrias de móveis de pequeno e médio portes, Efficient algorithms for orthogonal packing problems, Improved local search algorithms for the rectangle packing problem with general spatial costs, A 3-approximation algorithm for two-dimensional bin packing, A new heuristic recursive algorithm for the strip rectangular packing problem, Unnamed Item, TOC-based planning and scheduling model, Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization, Robust Distributed Query Processing for Streaming Data, The Two Dimensional Bin Packing Problem with Side Constraints, A note on linear models for two-group and three-group two-dimensional guillotine cutting problems, Foldabilizing furniture, An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem, Upper bounds for heuristic approaches to the strip packing problem, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais, New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing Problem, Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions, Hybrid approach for the two-dimensional bin packing problem with two-staged patterns, New Lower Bound and Exact Method for the Continuous Berth Allocation Problem, Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem, Linear models for 1-group two-dimensional guillotine cutting problems, Optimal aircraft load balancing, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems, An efficient deterministic optimization approach for rectangular packing problems, Linear models for the approximate solution of the problem of packing equal circles into a given domain, Asynchronous optimization of part logistics routing problem, Quasi-phi-functions and optimal packing of ellipses, Compact visualisation of video summaries, Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, Constrained order packing: comparison of heuristic approaches for a new bin packing problem, A hybrid evolutionary algorithm for the two-dimensional packing problem, New exact approaches and approximation results for the penalized knapsack problem, A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints, A hybrid algorithm based on variable neighbourhood for the strip packing problem, Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem, Provider selection and task allocation in telecommunications with QoS degradation policy, A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints, Adaptive simulated annealing with greedy search for the circle bin packing problem, The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints, Bin packing and cutting stock problems: mathematical models and exact algorithms, Models for the two-dimensional two-stage cutting stock problem with multiple stock size, An effective shaking procedure for 2D and 3D strip packing problems, An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems, Logic based Benders' decomposition for orthogonal stock cutting problems, Fast machine reassignment, Scheduling under the network of temporo-spatial proximity relationships, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, Combined cutting stock and lot-sizing problem with pattern setup, A simple randomized algorithm for two-dimensional strip packing, Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts, An exact strip packing algorithm based on canonical forms, An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem, A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation, A new heuristic algorithm for the circular packing problem with equilibrium constraints, The constrained compartmentalised knapsack problem, Corner occupying theorem for the two-dimensional integral rectangle packing problem, A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem, Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem, Two- and three-dimensional parametric packing, Fragmentary structures in a two-dimensional strip packing problem, On the complexity of adjacent resource scheduling, Space and time allocation in a shipyard assembly hall, A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem, Redundant cumulative constraints to compute preemptive bounds, Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem, Packing chained items in aligned bins with applications to container transshipment and project scheduling, A squeaky wheel optimisation methodology for two-dimensional strip packing, Optimizing yard assignment in an automotive transshipment terminal, Maximizing revenue with allocation of multiple advertisements on a Web banner, A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts, Co-scheduling algorithms for high-throughput workload execution, An effective approximation algorithm for the malleable parallel task scheduling problem, A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size, Offline first-fit decreasing height scheduling of power loads, A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber, Characterization and modelling of guillotine constraints, Relations between capacity utilization, minimal bin size and bin number, Exact and heuristic methods for optimizing lock-quay system in inland waterway, A coupling cutting stock-lot sizing problem in the paper industry, Reactive GRASP for the strip-packing problem, A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem, Parameterized complexity of strip packing and minimum volume packing, The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints, Irreducible bin packing and normality in routing open shop, Handling precedence constraints in scheduling problems by the sequence pair representation, The complexity landscape of decompositional parameters for ILP, Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues, Mixed-integer linear programming heuristics for the prepack optimization problem, Layout optimisation for an installation port of an offshore wind farm, Numerical optimization method for packing regular convex polygons, A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem, Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources, The load planning problem for double-stack intermodal trains, Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem, A least wasted first heuristic algorithm for the rectangular packing problem, Exact and heuristic methods for placing ships in locks, Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem, New lower bounds for bin packing problems with conflicts, An integer programming model for two- and three-stage two-dimensional cutting stock problems, Bidirectional best-fit heuristic for orthogonal rectangular strip packing, The pallet loading problem: three-dimensional bin packing with practical constraints, Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective, The forgotten sons: warehousing systems for brick-and-mortar retail chains, Exact solution techniques for two-dimensional cutting and packing, Queue-constrained packing: a vehicle ferry case study, A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem, 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 branch and bound algorithm for the strip packing problem, Exact algorithms for the two-dimensional strip packing problem with and without rotations, A branch-and-price algorithm for the two-dimensional level strip packing problem, A hybrid metaheuristic for the two-dimensional strip packing problem, New lower bounds for the three-dimensional finite bin packing problem, A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting, Techniques and results on approximation algorithms for packing circles, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, Heuristic algorithms for the three-dimensional bin packing problem, A branch-and-price algorithm for the temporal bin packing problem, A hybrid chaos firefly algorithm for three-dimensional irregular packing problem, An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle, 2DPackLib: a two-dimensional cutting and packing library, The layout problem of two kinds of graph elements with performance constraints and its optimality conditions, Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints

Uses Software

Tabu search

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1847188&oldid=14229002"