Bin Packing Problem
A Generalized Bin Packing Problem for parcel delivery in last-mile logistics
... the packing literature so that, in addition to their classical uses at the operational level, packing problems have gradually appeared as tools for modeling strategic and tactical decisions taken in the ...
11
Firefly Algorithm to Solve Two Dimensional Bin Packing Problem
... problems. Bin packing Problem is NP hard optimization ...Dimensional Bin packing ...minimizing bin space wastage and execution ...
6
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
... two-dimensional bin packing problem so as to handle rotation and guillotine cutting ...specific problem variant is the constructive heuristic, used to obtain the first solution and to ...
13
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
Solving Three Dimensional Bin Packing Problem Using Elitism Based Genetic Algorithm
... the bin packing ...combinatorial bin packing optimization ...the bin packing ...a packing heuristic for generating a packing plan to be evaluated against the ...
5
Abstract: In this paper, we describe our experience in developing. parallel implementations for the Bin Packing problem.
... the Bin Packing problem. Bin packing algorithms are studied to understand various resource allocation issues and the impact of the dierent packing heuristics on the ...
15
The Generalized Bin Packing Problem with bin-dependent item profits
... 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 the following ...2015 problem is a ...
23
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 Branch-and-Price Algorithm for Bin Packing Problem
... As observed from tables (7.2) to (7.9), optimal solution for all of the instances of BPP is obtained by using branch-and-price procedure except two instances of the Hard28 class. The reason for failing to derive the ...
121
Combining Energy Storage Systems and New Energy Allocation Strategy Based on the Bin Packing Algorithms for QoS in EAAS Concept in Smart Grids
... the bin packing problem, which is actually a partition ...The bin packing problem is formally defined as a way to find a partition and assignment of a set of objects such that a ...
8
Bin packing with colocations
... the Bin Packing problem, we obtain a ρ · ∆- approximation algorithm for BPCP on general graphs, where ∆ is the max- imum degree of the ...q-Subgraph problem can be converted to a ρ · log ...
14
CHAMP: Creating Heuristics via Many Parameters for online bin packing
... online bin packing problem is a well-known bin packing variant which re- quires immediate decisions to be made for the placement of a lengthy sequence of arriving items of various sizes ...
44
One-Dimensional Bin-Packing Problems with Branch and Bound Algorithm
... two-dimensional Bin Packing problem under free guillotine cutting, a problem in which a set of oriented rectangular items are given which must be packed into minimum number of bins of equal ...
5
Cloud SEnergy: A bin packing based multi cloud service broker for energy efficient composition and execution of data intensive applications
... multi-dimensional bin-packing problem for allocating and minimizing migrating workloads to achieve energy optimal opera- ...novel bin-packing based energy efficient service broker, ...
28
Heuristic generation via parameter tuning for online bin packing
... online bin packing problem in- stance, produced from a fixed U BP generator (see Section ...unseen problem instances which are produced by the same U BP ...online bin packing ...
7
Jostle heuristics for the 2D-irregular shapes bin packing problems with free rotation
... the packing length of the layout for the irregular shape strip packing problem by moving the pieces from one end of the strip to the other as in a shaking ...position packing from the outside ...
43
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 ...both Bin Packing and Cutting Stock ...
16
Bin Packing Problems with Uncertainty on Item Characteristics: An Application to Capacity Planning in Logistics
... Although bin packing optimization problems have been extensively studied, ...stochastic bin packing model, referred to as the Variable Cost and Size Bin Packing Problem ...
9
Heuristic generation via parameter tuning for online bin packing
... online bin packing problem in- stance, produced from a fixed U BP generator (see Section ...unseen problem instances which are produced by the same U BP ...online bin packing ...
8
On-Line Sequential Bin Packing
... on-line 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 ...
21