Results 1 to 10 of about 321 (213)
A Plant Propagation Algorithm for the Bin Packing Problem [PDF]
We consider the one-dimensional Bin Packing Problem (BPP) and its solution using a novel heuristic approach namely the Plant Propagation Algorithm (PPA).
Rewayda Razaq Abo-Alsabeh +2 more
doaj +6 more sources
Three-dimensional bin packing problem with variable bin height [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mark Goh, Yong Wu, Robert De Souza
exaly +3 more sources
Optimizing e-commerce warehousing through open dimension management in a three-dimensional bin packing system [PDF]
In the field of e-commerce warehousing, maximizing the utilization of packing bins is a fundamental goal for all major logistics enterprises. However, determining the appropriate size of packing bins poses a practical challenge for many logistics ...
Jianglong Yang +6 more
doaj +2 more sources
Connected bin packing problem on traceable graphs [PDF]
We consider a new extension of the bin packing problem in which a set of connectivity constraints should be satisfied. An undirected graph with a weight function on the nodes is given.
A. Nejoomi, A. Dolati
doaj +1 more source
The generalized bin packing problem [PDF]
Abstract In the Generalized Bin Packing Problem (GBPP), given two sets of compulsory and non-compulsory items characterized by volume and profit and a set of bins with given volume and cost, we want to select the subset of profitable non-compulsory items to be loaded together with the compulsory ones into the appropriate bins in order to minimize the
BALDI, MAURO MARIA +3 more
openaire +5 more sources
Harmony search algorithm with adaptive parameter setting for solving large bin packing problems [PDF]
Bin packing problem is a constrained optimization problem with a huge search space due to large combinations. Bin packing problem has a wide range of applications in multiple fields.
Amol C. Adamuthe , Tushar Nitave
doaj +1 more source
Algorithm NextFit for the Bin Packing Problem [PDF]
Summary . The bin packing problem is a fundamental and important optimization problem in theoretical computer science [4], [6]. An instance is a sequence of items, each being of positive size at most one. The task is to place all the items into bins so that the total size of items in each bin is at most one and ...
Fujiwara, Hiroshi +2 more
openaire +2 more sources
Fast Non-dominated Sorting in Multi Objective Genetic Algorithm for Bin Packing Problem
The bin packing problem is a problem where goods with different volumes and dimensions are put into a container so that the volume of goods inserted is maximized.
Muhammad Bintang Bahy, Aina Musdholifah
doaj +1 more source
Hybrid approach for solving real-world bin packing problem instances using quantum annealers
Efficient packing of items into bins is a common daily task. Known as Bin Packing Problem, it has been intensively studied in the field of artificial intelligence, thanks to the wide interest from industry and logistics. Since decades, many variants have
Sebastián V. Romero +4 more
doaj +1 more source
Bin Packing Problem with Time Lags
We introduce and motivate several variants of the bin packing problem where bins are assigned to time slots, and minimum and maximum lags are required between some pairs of items. We suggest two integer programming formulations for the general problem: a compact one and a stronger formulation with an exponential number of variables and constraints. We
Orlando Rivera Letelier +2 more
openaire +3 more sources

