We propose two mixed-integer linear programming based approaches for the 2-D orthogonal strip packing problem. Using knowledge from the alternative forms of time representation in scheduling formulations, we show how to efficiently combine three different concepts into the xand ydimensions. One model features a discrete representation on the x-axis (strip width) and a continuous representation ...

based approach for placement [2][3]. Onodera describes a branch and bound based placement approach [4]. Sechen’s TimberwolfMC placement and global routing tool was one of the first tools based on simulated annealing [5]. Lastly, one of the most recent proposals to placement was a rectangle packing approach described by Kajitani [6]. Each method has its merits, but so far, no method has emerged ...

The two dimensional orthogonal rectangular strip packing problem is a common NPhard optimisation problem whereby a set of rectangular shapes must be placed on a fixed width stock sheet with infinite length in such a way that wastage is minimised and material utilisation is maximised. The bidirectional best-fit heuristic is a deterministic approach which has previously been shown to outperform e...

FPGA is a 2D array of configurable logic blocks. Packing is to pack logic elements into device specific configurable logic blocks for subsequent placement. The traditional fixed delay model of inter and intra cluster delays used in packing does not represent post-placement delays and often leads to sub-optimal solutions. This paper presents a new layout driven packing algorithm, named LDPack, b...

In [J. Csirik, G.J. Woeginger, An on-line algorithm for multidimensional bin packing, Inform. Process. Lett. 63 (1997) 171–175] the authors study the asymptotic worst case ratio between the height of the strip needed to on-line pack a list of boxes by means of the Harmonic Shelf Algorithm and the height of the strip used by an optimal algorithm. In this note we analyze the effectiveness of the ...

This paper presents a packing algorithm to solve an irregular shape strip packing problem. The polygons are packed in strip material, which limits a bin width but not limits a bin length. The objective of a packing algorithm is to minimize a bin length. This paper proposes a hybrid method of genetic algorithms and tabu search to solve a packing problem. Initially, a hybrid method behaves like r...

Manuscript Received 4-June-2012 and revised 18-September-2012 ISSN: 2322-3936 Accepted on 1December-2012 Abstract—This paper presents a new approach for the design of a multiband uniplanar CPW-fed monopole antenna. The antenna consists of a fork like monopole strip to which is added an inverted U-shaped strip. The three branch fork like strip can create three resonant bands within the WLAN rang...