Sciweavers

74 search results - page 4 / 15
» Problem Generators for Rectangular packing problems
Sort
View
PDPTA
1996
13 years 10 months ago
Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
Darrell R. Ulm, Johnnie W. Baker
IOR
2008
102views more  IOR 2008»
13 years 8 months ago
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
The ordered open-end bin packing problem is a variant of the bin packing problem in which the items to be packed are sorted in a given order and the capacity of each bin can be ex...
Alberto Ceselli, Giovanni Righini
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 2 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
COR
2006
95views more  COR 2006»
13 years 8 months ago
Generating optimal two-section cutting patterns for rectangular blanks
This paper presents an algorithm for generating unconstrained guillotine-cutting patterns for rectangular blanks. A pattern includes at most two sections, each of which consists o...
Yaodong Cui, Dongli He, Xiaoxia Song
EOR
2006
91views more  EOR 2006»
13 years 8 months ago
Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming
In this paper a hybrid algorithm to solve Irregular Strip Packing problems is presented. The metaheuristic simulated annealing is used to guide the search over the solution space ...
A. Miguel Gomes, José F. Oliveira