Jostling for position: local improvement for irregular cutting patterns

No abstract is available for this paper.

• Publication year

  1998

• Venue

  Journal of the Operational Research Society

• Publication date

  1998-05-29

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1057/PALGRAVE.JORS.2600563
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem

  1996cited by this paper
• Compaction and separation algorithms for non-convex polygons and their applications☆

  1995cited by this paper
• Algorithms for Nesting Problems

  1993cited by this paper
• Cut out waste!

  1992cited by this paper
• An algebra of polygons through the notion of negative shapes

  1991cited by this paper
• Marker-making using automatic placement of irregular shapes for the garment industry

  1990cited by this paper
• An approach to two-dimensional cutting stock problems

  1987cited by this paper
• Approximation Algorithms for Bin-Packing — An Updated Survey

  1984cited by this paper
• NESTING TWO-DIMENSIONAL SHAPES IN RECTANGULAR MODULES

  1976cited by this paper

• A Tetris Beam Search Algorithm for the Distributor’s Pallet Loading Problem

  2025cites this paper
• Nest smarter, not harder: a hybrid vision-based deep reinforcement learning agent for packing 2D irregular geometries by rotational placement

  2025cites this paper
• Q-learning-based hyper-heuristic algorithm for open dimension irregular packing problems

  2025cites this paper
• Irregular multi-plate packing based on the dotted board model

  2025cites this paper
• The Normalized Direct Trigonometry Model for the Two-Dimensional Irregular Strip Packing Problem

  2024cites this paper
• Nonlinear Optimization and Adaptive Heuristics for Solving Irregular Object Packing Problems

  2024cites this paper
• Two-dimensional irregular packing problems: A review

  2022cites this paper
• Voxel-Based Solution Approaches to the Three-Dimensional Irregular Packing Problem

  2022cites this paper
• Overlap Detection in 2D Amorphous Shapes for Paper Optimization in Digital Printing Presses

  2021influential citation
• A fast and scalable algorithm to solve nesting problems using a semi-discrete representation

  2021cites this paper
• A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation

  2021cites this paper
• Hybridizing Beam Search with Tabu Search for the Irregular Packing Problem

  2021cites this paper
• Two effective methods for the irregular knapsack problem

  2020cites this paper
• Greedy Adaptive Search: A New Approach for Large-Scale Irregular Packing Problems in the Fabric Industry

  2020cites this paper
• A Solution Approach to The Problem of Nesting Rectangles with Arbitrary Rotations into Containers of Irregular Convex and Non-Convex Shapes

  2020cites this paper
• Production planning for cloud-based additive manufacturing - A computer vision-based approach

  2019cites this paper
• Exact approaches for the cutting path determination problem

  2019cites this paper
• Intégration Produit-Process appliquée à la sélection de procédés de Fabrication Additive

  2019cites this paper
• Irregular Packing for Mobile Game Texture Atlases

  2018cites this paper
• Survey on Intelligent Leather Nesting and Cutting Machine Technology

  2018cites this paper
• Jostle heuristics for the 2D-irregular shapes bin packing problems with free rotation

  2018influential citation
• An innovative data structure to handle the geometry of nesting problems

  2018cites this paper
• A clique covering MIP model for the irregular strip packing problem

  2017influential citation
• Cutting patterns for efficient production of irregular-shaped pieces

  2017influential citation
• Efficient Local Search Heuristics for Packing Irregular Shapes in Two-Dimensional Heterogeneous Bins

  2017cites this paper
• A SURVEY ON HEURISTICS FOR THE TWO-DIMENSIONAL RECTANGULAR STRIP PACKING PROBLEM

  2016cites this paper
• A new rectangular packing algorithm based on dynamic updating of packing point set and improved particle swarm optimization

  2016cites this paper
• Heuristics for Multidimensional Packing Problems

  2015cites this paper
• Toward better build volume packing in additive manufacturing: classification of existing problems and benchmarks

  2015cites this paper
• Free-form contour packing based on material grid approximation and lowest-gravity-center methods

  2015cites this paper
• Width-Packing Heuristic for Grouping in Two-Dimensional Irregular Shapes Cutting Stock Problem

  2015cites this paper
• Uma abordagem heurística para o corte de itens irregulares em múltiplos recipientes

  2015influential citation
• Nesting Problems and Steiner Tree Problems

  2015influential citation
• Width-Packing Heuristic for Grouping in Two-Dimensional Irregular Shapes Cutting Stock Problem

  2015cites this paper
• Algorithms for nesting with defects

  2014cites this paper
• Waste minimization in irregular stock cutting

  2014cites this paper
• A global optimization point of view to handle non-standard object packing problems

  2013cites this paper
• An effective heuristic for the two-dimensional irregular bin packing problem

  2013cites this paper
• A global optimization point of view to handle non-standard object packing problems

  2012cites this paper
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem

  2012cites this paper
• Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives

  2012cites this paper
• Heuristic algorithm based on the principle of minimum total potential energy (HAPE): a new algorithm for nesting problems

  2011cites this paper
• A beam search implementation for the irregular shape packing problem

  2010cites this paper
• Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems

  2010cites this paper
• Irregular Packing Using the Line and Arc No-Fit Polygon

  2010cites this paper
• Mixed-integer programming models for nesting problems

  2009cites this paper
• A tutorial in irregular shape packing problems

  2009cites this paper
• Complete and robust no-fit polygon generation for the irregular stock cutting problem

  2007cites this paper
• The irregular nesting problem: a new approach for nofit polygon calculation

  2007cites this paper
• Fast neighborhood search for two- and three-dimensional nesting problems

  2007influential citation
• Hiperheur?sticas para resolver el problema de empacado irregular de material en dos dimensiones

  2007cites this paper
• A local search approach to a circle cutting problem arising in the motor cycle industry

  2007cites this paper
• Exact and approximate Mixed-Integer Programming models for the nesting problem

  2006cites this paper
• Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming

  2006influential citation
• Method of sentinels for packing items within arbitrary convex regions

  2006cites this paper
• Method of Sentinels for Packing Objects within Arbitrary Regions

  2005cites this paper
• A global constraint for nesting problems

  2004cites this paper
• Solving nesting problems with non‐convex polygons by constraint logic programming

  2003cites this paper
• A 2-exchange heuristic for nesting problems

  2002cites this paper
• Minimizing waste in the 2-dimensional cutting stock problem

  2002cites this paper
• A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM

  2002cites this paper
• A Best-Local Position Procedure-Based Heuristic for Two-Dimensional Layout Problems

  2002cites this paper
• A 2-exchange heuristic for nesting problems q

  2002cites this paper
• An algorithm for polygon placement using a bottom-left strategy

  2002cites this paper
• A New Parallel Approach for Multi-dimensional Packing Problem

  2001cites this paper
• Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting

  2001cites this paper
• The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon

  2001cites this paper
• A client-broker-server architecture of a virtual enterprise for cutting stock applications

  2001cites this paper
• TOPOS – A new constructive algorithm for nesting problems

  2000influential citation
• An efficient algorithm for the regular W1 packing of polygons in the infinite plane

  1999cites this paper
• Mic'2001 -4th Metaheuristics International Conference a Grasp Approach to the Nesting Problem

  year unknowncites this paper
• Voxel-based solution approaches to the 3D irregular packing problem

  year unknowncites this paper