Heuristics for solving bin-packing problem
Solving the two-dimensional bin packing problem
... The heuristics compares the current gap against the width and height of all unpacked ...the bin on both ...the bin is completely filled with items and areas declared as ...new bin is ...
84
Extreme-Point-based Heuristics for the Three-Dimensional Bin Packing problem
... constructive heuristics for the 3D-BP problem, but also to more complex methods such as the Branch & Bound by Martello, Pisinger, and Vigo (Martello et ...2D-BP problem yields results that ...
30
On the generalized bin packing problem
... the problem, the sign objective function of any solution built from the instance can be either negative, zero or ...the problem to be ...NP-hard problem, but that even the problem of finding a ...
10
Solving the 2D Bin Packing Problem by Means of a Hybrid Evolutionary Algorithm
... the packing stage these items are packed from the list into ...The packing stage is an iterative process in which the following actions are performed at each ...the bin or the left edge of the first ...
10
Novel Hyper-heuristics Applied to the Domain of Bin Packing
... Programming packing combinations of heuristics, applied to pack different bins from the same prob- lem instance, have been shown in some cases to outperform the constituent heuristics [78, ...simple ...
216
Solving bin Packing Problem with a Hybrid Genetic Algorithm for VM Placement in Cloud
... The Bin Packing Problem’s purpose (BPP) is to find the minimum number of bins needed to pack a given set of objects of known sizes so that they do not exceed the capacity of each ...This problem is ...
9
Solving the Bin-Packing Problem by Means of Tissue P System with 2-Division
... 5 Conclusions The complexity theory of membrane computing is full of interesting open prob- lems. The most important is the P˘ aun conjecture [ 14 , 20 , 27 ] which ask if a con- crete P system model is able to solve or ...
12
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
The stochastic generalized bin packing problem
... Generalized Bin Packing Problem (GBPP) is a recently introduced packing problem where, given a set of bins characterized by volume and cost and a set of items characterized by volume ...
7
The maximum resource bin packing problem
... We also consider another on-line problem, On-Line Dual Maximum Resource Bin Packing. Here, the number of available bins is fixed. For each item, an algorithm has to accept it and place it in one of ...
13
The stochastic generalized bin packing problem
... Generalized Bin Packing Problem (GBPP) is a recently introduced packing problem where, given a set of bins characterized by volume and cost and a set of items characterized by volume ...
10
Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
... the bin changes from vertical to horizontal (the large black dots in Figure ...the bin defined by the lower and upper terminal lines of each item (see Figure 2a for an example of Corner Points in three ...
32
The Generalized Bin Packing Problem with bin-dependent item profits
... 2015 problem The ESICUP 2015 context dealt with a container-loading problem to be considered by Renault for the daily loading of containers, and to “estimate every week the number of containers needed for ...
23
Solving Three Dimensional Bin Packing Problem Using Elitism Based Genetic Algorithm
... for solving the bin packing ...combinatorial bin packing optimization ...for solving the bin packing ...a packing heuristic for generating a packing ...
5
Heuristics for the strip packing problem with unloading constraints
... two-dimensional packing and the routing ...This problem is called Two-Dimensional Loading Capacitated Vehicle Routing Problem (2L-CVRP) ...traditional packing constraints and a new unloading ...
13
Heuristics for the score-constrained strip-packing problem
... 3 Heuristics for the SCSPP In this section, we now turn our attention to the multi-strip version of the prob- ...Instead, heuristics can be used to find near-optimal solutions in a shorter amount of ...
14
A Branch-and-Price Algorithm for Bin Packing Problem
... knapsack problem is solved by a fast heuristic or an approximation algorithm until the reduced cost of the generated column gets ...of heuristics and approximation algorithms will increase the number of ...
121
Evolutionary Approach for the Containers Bin-Packing Problem
... [Wilson and col., 2001], [Wilson and Roach, 1999] and [Wilson and Roach, 2000] developed a computer system that generates a sub-optimal solution to the stowage pre- planning problem. The planning process of this ...
10
Comments on the hierarchically structured bin packing problem
... first bin, and the other buckets each constitute a single ...each bin, we count the number of internal nodes that have at least one descendant in that bin, and then we sum up all these ...per ...
11
Asymptotic results for the Generalized Bin Packing Problem
... open bin able to contain it, otherwise a new bin is selected from a list of bins sorted according to a given ...open bin able to contain it, otherwise a new bin is selected from a list of bins ...
10