Bin Packing Problems
Solving Bin Packing Problems Using VRPSolver Models
... mentioned bin packing variants and investigates the performance of the resulting BCP ...though bin packing problems are not VRPs, VRPSolver can be a quite effective tool for solving ...
22
One-Dimensional Bin-Packing Problems with Branch and Bound Algorithm
... past. Packing the produced goods in the optimum manner within a limited space has multiple paybacks to the production ...A Bin Packing Problem basically describes in three ways; One- Dimensional, ...
5
Jostle heuristics for the 2D-irregular shapes bin packing problems with free rotation
... Song and Bennell (2014) solve the irregular shape cutting stock problem. Cutting stock problems are slightly different to bin packing problems. While both pack multiple stock sheets, the ...
43
Generalized Bin Packing Problems
... any bin, and the First Fit with Time Buffer and Rejections (FFTBR), where the decision maker stores the received items into an unlimited buffer and periodically load them into ...
113
An investigation into two bin packing problems with ordering and orientation implications
... n’s, perhaps demonstrating the reduced accuracy of this algorithm with larger problem instances. 3.5 Experimental Results We tested both versions of our algorithm on the complete set of 3900 problem instances, using a ...
24
Bin Packing Problems with Uncertainty on Item Characteristics: An Application to Capacity Planning in Logistics
... Most modern companies are part of international economic networks, where goods are produced under different strategies, then transported over long distances and stored for variable periods of time at different locations ...
9
Solving bin-packing problems under privacy preservation: Possibilities and trade-offs
... The results of these optimizations are displayed in Fig. 4 . It is clear from Fig. 4 (a) that using the proposed optimization methods for anonymized data improves the solution quality compared to the standard ...
14
On-Line Sequential Bin Packing
... usual bin packing problems to situations in which one can handle only one bin at a time, and items must be processed immediately so they cannot wait for bin ...
21
Evolutionary Approach for the Containers Bin-Packing Problem
... Approach for the Pickup And Delivery Problem With Time Windows, Systems, Man and Cybernetics, 2005 IEEE International Conference on Volume 2, Issue , 12-12 Oct. 2005 Page(s):1156 – 1161 16. LODI, A., MARTELLO, S. and ...
10
Asymptotic results for the Generalized Bin Packing Problem
... Generalized Bin Packing Problem (GBPP), a fundamental packing problem arising in many Transportation and Logistics settings due to the joint presence of multiple bin and item attributes and to ...
10
Bin packing with colocations
... a bin consisting of all items of the groups in the ...a bin will contain at most kbq/kc ≤ q ...the bin associated to the block containing the pair of groups A and B if A and B are distinct, or to ...
14
Bin packing games
... The initial incentive of our research is to find the core allocation of the total earning of the grand coalition. Thus, allocation problems in real life also have much to do with bin packing games. ...
64
Bin Packing with Colocations
... in a feasible solution (copies of) a vertex (item) might be packed into more than one bin. Our initial motivation for studying BPCP was the work of Afrati et al. [1,2] on an assignment problem in MapReduce ...
13
Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems
... Other related formulations having a good performance have been recently presented. Brand˜ ao and Pedroso (2016) developed, among other improvements, a lifting procedure that is based on the fact that packing an ...
39
Online dynamic bin packing
... We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart dynamically. ...
116
Online Bin Packing with Advice
... final packing by A, call a bin “red” if all items packed in it are small items and call it “blue” otherwise (the blue bins constitute the approximated packing at the ...red bin in the final ...
13
On the generalized bin packing problem
... Although relevant work was done on the GBPP, only limited research has been devoted so far to the study of its approximability (Baldi et al., 2013). In this paper we propose a thorough study on the approximability of the ...
10
Ant colony optimisation and local search for bin-packing and cutting stock problems
... The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combi- natorial optimisation ...real-world problems we have to rely on heuristic ...these problems, ...
16
Ant colony optimization and local search for bin packing and cutting stock problems
... The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization ...real-world problems, we have to rely on heuristic ...these problems, ...
12
The Generalized Bin Packing Problem with bin-dependent item profits
... the problems deal with assignment of items to ...two problems are quite ...three-dimensional bin packing problem. For each bin, items can be packed into ...two problems. GBPPI ...
23