An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem

Hopper, E. Mitchell; Turton, Brian

doi:10.1016/s0377-2217(99)00357-4

Cited by 420 publications

(303 citation statements)

References 19 publications

Supporting

Mentioning

271

Contrasting

Unclassified

Order By: Relevance

“…One known strategy for packing is the Bottom-Left(BL). Each rectangle is slid as far as possible to the bottom and then as far as possible to the left [16]. It is known that for some problems BL can not find constant approximation to the optimal packing, but a successful approach is to apply BL to the rectangles ordered by decreasing sizes that is referred as Bottom Left Decreasing(BLD) or Larger Size First (LSF).…”

Section: Two Level Hierarchy Schedulingmentioning

confidence: 99%

Two Level Job-Scheduling Strategies for a Computational Grid

Tchernykh

Ramírez

Avetisyan

et al. 2006

Parallel Processing and Applied Mathematics

View full text Add to dashboard Cite

Abstract. We address parallel jobs scheduling problem for computational GRID systems. We concentrate on two-level hierarchy scheduling: at the first level broker allocates computational jobs to parallel computers. At the second level each computer generates schedules of the parallel jobs assigned to it by its own local scheduler. Selection, allocation strategies, and efficiency of proposed hierarchical scheduling algorithms are discussed.

show abstract

Section: Two Level Hierarchy Schedulingmentioning

confidence: 99%

Two Level Job-Scheduling Strategies for a Computational Grid

Tchernykh

Ramírez

Avetisyan

et al. 2006

Parallel Processing and Applied Mathematics

View full text Add to dashboard Cite

show abstract

“…The strip packing problems for rectangles that can be rotated by 90° were also tested using the hybrid GA developed in this study. The test data, which consists of 21 problems presented in seven different-sized categories, are taken from Hopper and Turton [6]. These test problems are very difficult to solve as they are 'perfect packings' obtained by cutting a given rectangle of fixed dimensions into smaller rectangular items.…”

Section: Results For the 2d Rectangular Strip Packing Problemsmentioning

confidence: 99%

A Genetic Algorithm for Two Dimensional Strip Packing Problems

Mancapa¹,

Niekerk²,

Tian³

2009

The South African Journal of Industrial Engineering

View full text Add to dashboard Cite

Cutting and packing problems are combinatorial optimisation problems. In most manufacturing situations a raw material, usually in some standard size, has to be divided or cut into smaller items to complete the production of some product. It is therefore desirable that this raw material be used efficiently. A novel placement heuristic, hybridised with a genetic algorithm, is presented in this paper. A general solution encoding scheme, which is used to encode two dimensional strip packing problems, is also introduced in this study. OPSOMMINGDie optimisering van sny-en pakprobleme vorm deel van die kombinasieleer. Dit is dikwels so by vervaardiging dat grondstof onderverdeel (gesny) word om te pas by die samestelling van 'n gegewe produk. Sodanige onderverdeling moet doeltreffend verrig word. 'n Veredelde heuristiese genetiese algoritme word hiervoor bekend gestel. 'n Algemene koderingsmetode vir tweedimensionele strookverpakking word voorgehou.

show abstract

“…It is capable of filling enclosed wasted areas. Notice that, according to the way BLF is implemented, its worst time complexity goes from O n 3 [28] to O n 2 [29] for a permutation of n objects. TSD does not code packings with permutations but adopts a direct representation where a "solution" s ∈ S (optimal or not) is a {L, E} set: -L, for "Location" (of the rectangular objects to be positioned in P ), is an n-vector.…”

Section: Search Space: a Direct Representationmentioning

confidence: 99%

“…We employed this decoder / order since previous experiments suggested that the BLF placement algorithm usually outperforms other φ decoders, see [28,31] for instance.…”

Section: Initial Solutionmentioning

confidence: 99%

See 1 more Smart Citation

A Tabu Search Algorithm with Direct Representation for Strip Packing

Hamiez

Robet

Hao

2009

Evolutionary Computation in Combinatorial Optimization

View full text Add to dashboard Cite

Abstract. This paper introduces a new tabu search algorithm for a twodimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of the problem, a satisfaction-based solving scheme, two different complementary neighborhoods, a diversification mechanism and a particular tabu structure. The representation allows inexpensive basic operations. The solving scheme considers the 2D-SPP as a succession of satisfaction problems. The goal of the combination of two neighborhoods is (to try) to reduce the height of the packing while avoiding solutions with (hard to fill) tall and thin wasted spaces. Diversification relies on a set of historically "interesting" packings. The tabu structure avoids visiting similar packings. To assess the proposed approach, experimental results are shown on a set of well-known benchmark instances and compared with previously reported tabu search algorithms as well as the best performing algorithms.

show abstract

An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem

Cited by 420 publications

References 19 publications

Two Level Job-Scheduling Strategies for a Computational Grid

Two Level Job-Scheduling Strategies for a Computational Grid

A Genetic Algorithm for Two Dimensional Strip Packing Problems

A Tabu Search Algorithm with Direct Representation for Strip Packing

Contact Info

Product

Resources

About