Rectangle packing with a recursive pilot method

DOI10.1016/J.COR.2023.106447MaRDI QIDQ6065652zbMATH OpenOpenAlexFDO

Authors Vitor Pimenta dos Reis Arruda, Luiz Gustavo Bizarro Mirisola, Nei Yoshihiro Soma

Publication date 15 November 2023

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2023.106447

zbMATH Keywords

heuristicsrectangle packingskylinepilot method

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A hybrid evolutionary algorithm for the two-dimensional packing problem
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
• A least wasted first heuristic algorithm for the rectangular packing problem
• A new heuristic algorithm for rectangle packing
• A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
• A simple randomized algorithm for two-dimensional strip packing
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An Algorithm for Two-Dimensional Cutting Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• An effective quasi-human based heuristic for solving the rectangle packing problem
• An efficient deterministic heuristic for two-dimensional rectangular packing
• An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
• An improved typology of cutting and packing problems
• An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
• Data set generation for rectangular placement problems
• Exact solution techniques for two-dimensional cutting and packing
• Orthogonal Packings in Two Dimensions
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
• The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs

This page was built for publication: Rectangle packing with a recursive pilot method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065652)