Packing Problem
One-Dimension Multi-Objective Bin Packing Problem using Memetic Algorithm
... Abstract— Memetic Algorithm has been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for One-dimension ...
6
High Multiplicity Strip Packing Problem With Three Rectangle Types
... A variant of 2D-SPP is the multiple strip packing problem (M-SPP), where the objective is to pack n rectangles into a constant number of strips. One application of M-SPP is to find a schedule of minimal ...
108
The presentation of an exploratory algorithm for the rectangle packing problem on the basis of the best fit algorithm and the lowest front-line strategy
... Wei et al. [37] have presented an algorithm based on the best-fit algorithm with a branch & bound approach for the rectangle packing problem with constant dimensions. This algorithm has a reasonable ...
10
An Algorithm for the Circle-packing Problem via Extended Sequence-pair with Nonlinear Optimization
... One idea of solving the circle-packing problem is to formulate the problem as a nonlinear programming problem and solve it by some nonlinear optimization solver. This is an ideal method, ...
6
A Particle Swarm Optimization Algorithm for a 2 D Irregular Strip Packing Problem
... rectangular packing problem has been shown by Fowler et ...the packing sequence of items that would lead to the best possible pattern when employed under a certain placement method (Babu and Babu ...
11
A Parallel Hyper-heuristic Approach for the Two-dimensional Rectangular Strip-packing Problem
... In this paper, we present a parallel hyper-heuristic approach for two-dimensional rectangular strip-packing problems (2DSP). This is an island model with a special master-slave structure, and in all the islands we ...
15
Solving Three Dimensional Bin Packing Problem Using Elitism Based Genetic Algorithm
... bin packing optimization ...a packing heuristic for generating a packing plan to be evaluated against the objective function to obtain the quality of the ...
5
Firefly Algorithm to Solve Two Dimensional Bin Packing Problem
... D. Implementation Results of Hard class Instances Hard class instances of Bin Packing problem finds more difficult and challenging to solve. In hard class, 10 instances were solved. It was found from the ...
6
Large neighborhood local search for the maximum set packing problem
... Ward, Justin and Sviridenko, Maxim (2013) Large neighborhood local search for the maximum set packing problem. In: Freivalds, Rūsiņš and Kwiatkowska, Martha and Fomin, Fedor V. and Peleg , David, (eds.) ...
16
An exchange heuristic for the bin packing problem
... produce identical solutions to a problem instance. However, if the random reordering is repeated, a set of different solutions can be obtained by FFDR. In fact one strong argument f[r] ...
11
A Dynamic Programming Approach for the Max Min Cycle Packing Problem in Even Graphs
... the problem is presented in [7], which iteratively looks for cycles of small length and removes the corresponding edges from the current graph until there is no cycle ...the problem is to relate maximum ...
11
Genetic algorithms for the scheduling in additive manufacturing
... Modern manufacturing environment has been featured by customer demands, raised product variety, demand for limited production cycles, etc. All of them highlight the relevance of adopting new technologies and systems to ...
5
Automatic Scaling In Cloud Environment
... bin packing problem looks to minimize the number of bins expected to schedule all n tasks such that the maximum load on any dimension over all bins is limited by a fixed ...when packing items into a ...
5
On-Line Sequential Bin Packing
... bin packing problem that achieves a cumulative loss (measured as the sum of the total wasted capacity and lost items) that is less than the total loss of the best strategy in the class (determined in ...
21
Online dynamic bin packing
... bin packing problem was first studied in 1-D for gen- eral size items by Coffman, Garey and Johnson [26], showing that the First-Fit (FF) algorithm has a competitive ratio lying between ...bin ...
116
Toward better build volume packing in additive manufacturing: classification of existing problems and benchmarks
... of packing problem found in AM is the bin packing problem, which can be denoted as 3/In/I/* using ‘*’ as a wildcard symbol that can take any ...common problem dealt with in the AM ...
10
A novel hybrid intelligence approach for 2D packing through Internet crowdsourcing
... possible problem solution based on ...bin packing problem based on the dimensions of the object i (its length and height) and the width of the ...
6
High Multiplicity Strip Packing
... bin packing problem will result in a solution that minimizes the number of buses used while keeping groups unseparated on ...Bin packing also has important implications to 2DSPP. In fact, bin ...
40
The packing and covering of the complete graph I: the forests of order five
... INTRODUCTION Graphs in this paper are fiite with no multiple edges or loops, leineke [I] defined the general covering respectively, packing problem as follows" For a given graph G find t[r] ...
6
Generic Algorithm Implementation of Approximation Algorithm using Simulated Annealing (SA)
... Bin packing [1] problem solves the packing of objects of different volumes into a finite number of bins of capacity V in a way that minimizes the number of bins ...Bin Packing Problem ...
8