A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering

DOI10.1016/j.ejor.2013.06.020zbMath1317.90163MaRDI QIDQ2356195

Ahmed Elkeran

Publication date: 29 July 2015

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.06.020

zbMATH Keywords

clustering; guided local search; cutting; nesting; cuckoo search; no-fit polygon

Mathematics Subject Classification ID

90C27: Combinatorial optimization

52A40: Inequalities and extremum problems involving convexity in convex geometry

90B80: Discrete location and assignment

Related Items

Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, Robust mixed-integer linear programming models for the irregular strip packing problem, A clique covering MIP model for the irregular strip packing problem, Visualizing data as objects by DC (difference of convex) optimization, Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations, A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems, Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes, Descending packing algorithm for irregular graphics based on geometric feature points, Raster penetration map applied to the irregular packing problem, A hybrid chaos firefly algorithm for three-dimensional irregular packing problem, An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations

Uses Software

• TOPOS

Cites Work

• Unnamed Item
• Unnamed Item
• A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
• Solution approaches to irregular nesting problems
• Compaction and separation algorithms for non-convex polygons and their applications
• On genetic algorithms for the packing of polygons
• Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
• TOPOS -- A new constructive algorithm for nesting problems
• The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
• A 2-exchange heuristic for nesting problems
• An algorithm for polygon placement using a bottom-left strategy
• Mathematical model and efficient algorithms for object packing problem
• Computing the intersection-depth to polyhedra
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• An improved typology of cutting and packing problems
• Fast neighborhood search for two- and three-dimensional nesting problems
• A tutorial in irregular shape packing problems
• Solving the irregular strip packing problem via guided local search for overlap minimization
• A tabu thresholding implementation for the irregular stock cutting problem
• Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
• Polygon decomposition for efficient construction of Minkowski sums