Neural-Driven heuristic for strip packing trained with Black-Box optimization
We address the well-known NP-hard problem of packing rectangular items into a strip, a problem of significant importance in electronics (e.g., packing components on printed circuit boards and macro-cell placement in Very-Large- Scale Integration design) and telecommunications (e.g., allocating data...
Saved in:
| Main Authors: | Mariusz Kaleta, Tomasz Śliwiński |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Academy of Sciences
2025-06-01
|
| Series: | International Journal of Electronics and Telecommunications |
| Subjects: | |
| Online Access: | https://journals.pan.pl/Content/135232/7_5028_L_Kaleta_sk.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A steady state micro genetic algorithm for hyper-heuristic generation in one-dimensional bin packing
by: Julio Juárez, et al.
Published: (2025-07-01) -
A new approach for bin packing problem using knowledge reuse and improved heuristic
by: Jie Fang, et al.
Published: (2024-12-01) -
Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard
by: György Dósa, et al.
Published: (2025-02-01) -
A patterning algorithm for the dynamic bin packing problem with placement groups
by: Evgeniy A. Brazhnikov, et al.
Published: (2025-06-01) -
On the Areal Random Packing
by: Masaharu Tanemura
Published: (2013-12-01)