A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
From MaRDI portal
Publication:3392005
Recommendations
- An effective heuristic for the two-dimensional irregular bin packing problem
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations
- Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins
- An efficient deterministic heuristic for two-dimensional rectangular packing
- scientific article; zbMATH DE number 5911854
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
- A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
Cited in
(40)- Irregular packing: MILP model based on a polygonal enclosure
- Artificial intelligence application in production scheduling problem systematic literature review: bibliometric analysis, research trend, and knowledge taxonomy
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- Descending packing algorithm for irregular graphics based on geometric feature points
- Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Complete and robust no-fit polygon generation for the irregular stock cutting problem
- A beam search implementation for the irregular shape packing problem
- Mathematical justification of a heuristic for statistical correlation of real-life time series
- Solving the irregular strip packing problem via guided local search for overlap minimization
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- Phi-functions for 2D objects formed by line segments and circular arcs
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- Modeling two-dimensional guillotine cutting problems via integer programming
- Jostling for position: local improvement for irregular cutting patterns
- A tutorial in irregular shape packing problems
- A clique covering MIP model for the irregular strip packing problem
- Decomposition algorithm for geometric objects in 2D packing and cutting problems
- Mathematical model and efficient algorithms for object packing problem
- Mixed-integer programming models for nesting problems
- Raster penetration map applied to the irregular packing problem
- Algorithms for nesting with defects
- Efficient implementations of construction heuristics for the rectilinear block packing problem
- An effective heuristic for the two-dimensional irregular bin packing problem
- A customized branch-and-bound approach for irregular shape nesting
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- Irregular packing using the line and arc no-fit polygon
- A hybrid approach for packing irregular patterns using evolutionary strategies and neural network
- Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory
- A fully general, exact algorithm for nesting irregular shapes
- An improved best-fit heuristic for the orthogonal strip packing problem
- Irregular stock cutting system based on AutoCAD
- A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
- Dealing with nonregular shapes packing
This page was built for publication: A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392005)
