Robust Optimization for the Two-Dimensional Strip-Packing Problem with Variable-Sized Bins
The two-dimensional strip-packing problem (2D-SPP) emerges as a notable variant of the cutting and packing (C&P) problem, aiming to optimize the arrangement of small rectangular items within unique strips with a fixed width and infinite height to minimize the usage of height. Despite extensive a...
Main Authors: | Kaiyuan Liu, Hongyu Zhang, Chong Wang, Hui Li, Yongquan Chen, Qiong Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-11-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/23/4781 |
Similar Items
-
Metaheuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications
by: Munien Chanaleä, et al.
Published: (2021-04-01) -
A Study of Evolutionary Algorithm Selection Hyper-Heuristics for the One-Dimensional Bin-Packing Problem
by: Nelishia Pillay
Published: (2012-06-01) -
On on-line algorithms for Bin, Strip and Box Packing, and their worstand average-case analysis
by: D. O. Lazarev, et al.
Published: (2018-10-01) -
Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard
by: György Dósa, et al.
Published: (2025-02-01) -
Connected bin packing problem on traceable graphs
by: A. Nejoomi, et al.
Published: (2022-03-01)