Local search of orthogonal packings using the lower bounds

DOI10.1134/S0005117909060113zbMath1181.93011MaRDI QIDQ1040483

A. S. Filippova, E. A. Mukhacheva, M. A. Mesyagutov, Vadim M. Kartak

Publication date: 24 November 2009

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117909060113

zbMATH Keywords

evolutionary algorithm; one-dimensional cutting; packing the rectangular half-infinite strip

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution, Optimal placement of rectangles on a plane with fixed objects, Mathematical models and routing algorithms for CAD technological preparation of cutting processes

Cites Work

• Recent advances on two-dimensional bin packing problems
• An application of simulated annealing to the cutting stock problem
• The rectangular packing problem: local optimum search methods based on block structures
• Design of rectangular packings using decoders of block structure
• Comparison of certain evolutionary algorithms
• Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• Two-Dimensional Finite Bin-Packing Algorithms
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing