๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems

โœ Scribed by E. Hopper; B.C.H. Turton

Book ID
110314593
Publisher
Springer Netherlands
Year
2001
Tongue
English
Weight
244 KB
Volume
16
Category
Article
ISSN
0269-2821

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Solving the 2D Bin Packing Problem by Me
Solving the 2D Bin Packing Problem by Means of a Hybrid Evolutionary Algorithm
โœ Blum, Christian; Schmid, Verena ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Elsevier ๐ŸŒ English โš– 144 KB

Combinatorial optimization problems dealing with 2D bin packing find applications, for example, in the context of transporta- tion/warehousing and for the cutting of glass, wood, and metal. In this work we consider the oriented 2D bin packing problem under free guillotine cutting, a problem in which

Application of a 2D-CFDTD algorithm to t
Application of a 2D-CFDTD algorithm to the analysis of photonic crystal fibers (PCFs)
โœ Yanjie Zhu; Yinchao Chen; Paul Huray; Xiaopeng Dong ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 411 KB

## Abstract This research applies an efficient twoโ€dimensional cylindrical finiteโ€differenceโ€“timeโ€domain (2Dโ€CFDTD) algorithm implemented on the transverse plane of a guidedโ€wave structure to analyze a photonic crystal fiber (PCF) structure. An unsplit anisotropic perfectly matched layer (APML) is