Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
From MaRDI portal
Publication:2803270
DOI10.1111/itor.12104zbMath1338.90347OpenAlexW2129847851MaRDI QIDQ2803270
Publication date: 4 May 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12104
simulated annealinggenetic algorithmstwo-dimensional layoutcut schedulingfashion industrygenetic annealingapparel manufacturingcut order planningirregular packing and cuttingmake to order
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
Uses Software
Cites Work
- An effective heuristic for the two-dimensional irregular bin packing problem
- Tools of mathematical modeling of arbitrary object packing problems
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- Cut scheduling in the apparel industry
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- On genetic algorithms for the packing of polygons
- Solving a cutting problem based on existing patterns
- Two genetic algorithms to solve a layout problem in the fashion industry
- A 2-exchange heuristic for nesting problems
- An algorithm for polygon placement using a bottom-left strategy
- Alternative formulations for a layout problem in the fashion industry
- Mathematical model and efficient algorithms for object packing problem
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- The geometry of nesting problems: a tutorial
- Exhaustive approaches to 2D rectangular perfect packings
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- An improved typology of cutting and packing problems
- Fast neighborhood search for two- and three-dimensional nesting problems
- A Mixed Integer Programming Model for Solving a Layout Problem in the Fashion Industry
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- A tutorial in irregular shape packing problems
This page was built for publication: Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
