scholarly journals A Flexible Reinforced Bin Packing Framework with Automatic Slack Selection

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Ting Yang ◽  
Fei Luo ◽  
Joel Fuentes ◽  
Weichao Ding ◽  
Chunhua Gu
Keyword(s):  
Bin Packing ◽  
Learning Strategy ◽  
Packing Problem ◽  
Current State ◽  
Mapping Process ◽  
Packing Process ◽  
Remaining Capacity ◽  
The One ◽  
Global Data ◽  
Selection Of

The slack-based algorithms are popular bin-focus heuristics for the bin packing problem (BPP). The selection of slacks in existing methods only consider predetermined policies, ignoring the dynamic exploration of the global data structure, which leads to nonfully utilization of the information in the data space. In this paper, we propose a novel slack-based flexible bin packing framework called reinforced bin packing framework (RBF) for the one-dimensional BPP. RBF considers the RL-system, the instance-eigenvalue mapping process, and the reinforced-MBS strategy simultaneously. In our work, the slack is generated with a reinforcement learning strategy, in which the performance-driven rewards are used to capture the intuition of learning the current state of the container space, the action is the choice of the packing container, and the state is the remaining capacity after packing. During the construction of the slack, an instance-eigenvalue mapping process is designed and utilized to generate the representative and classified validate set. Furthermore, the provision of the slack coefficient is integrated into MBS-based packing process. Experimental results show that, in comparison with fit algorithms, MBS and MBS’, RBF achieves state-of-the-art performance on BINDATA and SCH_WAE datasets. In particular, it outperforms its baseline MBS and MBS’, averaging the number increase of optimal solutions of 189.05% and 27.41%, respectively.

scholarly journals An Adaptive Fitness-Dependent Optimizer for the One-Dimensional Bin Packing Problem

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 97959-97974 ◽  
Author(s):  
Diaa Salama Abdul-Minaam ◽  
Wadha Mohammed Edkheel Saqar Al-Mutairi ◽  
Mohamed A. Awad ◽  
Walaa H. El-Ashmawi
Keyword(s):  
Bin Packing ◽  
Packing Problem ◽  
One Dimensional ◽  
Bin Packing Problem ◽  
The One

Solving the one-dimensional bin packing problem with a weight annealing heuristic

2008 ◽  
Vol 35 (7) ◽  
pp. 2283-2291 ◽  
Author(s):  
Kok-Hua Loh ◽  
Bruce Golden ◽  
Edward Wasil
Keyword(s):  
Bin Packing ◽  
Packing Problem ◽  
One Dimensional ◽  
Bin Packing Problem ◽  
The One

scholarly journals Point vortex equilibria and optimal packings of circles on a sphere

2010 ◽  
Vol 467 (2129) ◽  
pp. 1468-1490 ◽  
Author(s):  
Paul K. Newton ◽  
Takashi Sakajo
Keyword(s):  
Particle Interaction ◽  
Point Vortex ◽  
Packing Problem ◽  
Point Of View ◽  
Basis Set ◽  
Equilibrium Solutions ◽  
Optimal Packing ◽  
Packing Process ◽  
Point Vortex Equilibria ◽  
The One

We answer the question of whether optimal packings of circles on a sphere are equilibrium solutions to the logarithmic particle interaction problem for values of N =3–12 and 24, the only values of N for which the optimal packing problem (also known as the Tammes problem) has rigorously known solutions. We also address the cases N =13–23 where optimal packing solutions have been computed, but not proven analytically. As in Jamaloodeen & Newton (Jamaloodeen & Newton 2006 Proc. R. Soc. Lond. Ser. A 462 , 3277–3299. ( doi:10.1098/rspa.2006.1731 )), a logarithmic, or point vortex equilibrium is determined by formulating the problem as the one in linear algebra, , where A is a N ( N −1)/2× N non-normal configuration matrix obtained by requiring that all interparticle distances remain constant. If A has a kernel, the strength vector is then determined as a right-singular vector associated with the zero singular value, or a vector that lies in the nullspace of A where the kernel is multi-dimensional. First we determine if the known optimal packing solution for a given value of N has a configuration matrix A with a non-empty nullspace. The answer is yes for N =3–9, 11–14, 16 and no for N =10, 15, 17–24. We then determine a basis set for the nullspace of A associated with the optimally packed state, answer the question of whether N -equal strength particles, , form an equilibrium for this configuration, and describe what is special about the icosahedral configuration from this point of view. We also find new equilibria by implementing two versions of a random walk algorithm. First, we cluster sub-groups of particles into patterns during the packing process, and ‘grow’ a packed state using a version of the ‘yin-yang’ algorithm of Longuet-Higgins (Longuet-Higgins 2008 Proc. R. Soc. A (doi:10.1098/rspa.2008.0219)). We also implement a version of our ‘Brownian ratchet’ algorithm to find new equilibria near the optimally packed state for N =10, 15, 17–24.

scholarly journals Theoretical and methodological approaches to periodization of technical and technological development

2020 ◽  
Keyword(s):  
Technological Development ◽  
Current State ◽  
The World ◽  
Analysis And Synthesis ◽  
General Scientific ◽  
Methodological Approaches ◽  
The One ◽  
Globalized World ◽  
Scientific Ideas ◽  
Selection Of

The article is devoted to the problem of technical and technological development, which in the modern globalized world is subject to the laws of cyclicity. The realities of today are evidence that in every country of the world coexist and interact elements of different levels of technological structures, which requires a balanced policy to manage their development. Therefore, the purpose of this study is to identify the main theoretical and methodological approaches to the periodization of technical and technological development of the world economy and the formation of generalized criteria for structuring periods of its cyclical dynamics. In the course of the research the tasks were solved, which consisted in the selection of those theoretical and methodological approaches that most fully cover the causal links between changes in technology and technology, on the one hand, and development – on the other; identifying in each approach the criteria of periodization and determining the possibilities of these approaches to describe the current situation. The methodological basis was such general scientific research methods as dialectics, analysis and synthesis, the unity of historical and logical, as well as methods of generalizations, comparisons and classifications. The result of their application was to clarify the essence and establish the specifics of the conceptual approaches of M. Kondratiev, С. Perez and S. Glazyev, which today are considered to be leading in explaining technical and technological development. Based on the comparison of these theoretical and methodological approaches, a generalized idea of the criteria for periodization of the latter is formed. The general conclusion of the study is the formation of scientific ideas about the stages through which society passes in its technical and technological development. This allows you to properly assess the current state of a particular economic system and choose more effective instruments of economic policy to guide its development through progress.

VisTHAA

2016 ◽  
pp. 151-177
Author(s):  
Laura Cruz-Reyes ◽  
Mercedes Pérez Villafuerte ◽  
Marcela Quiroz-Castellanos ◽  
Claudia Gómez ◽  
Nelson Rangel Valdez ◽  
...  
Keyword(s):  
Design Theory ◽  
Bin Packing ◽  
Heuristic Algorithms ◽  
Statistical Tests ◽  
Packing Problem ◽  
Point Of View ◽  
Minimum Requirement ◽  
The One ◽  
Standard Sets ◽  
Non Parametric

In this chapter, a scientific tool designed to facilitate fair comparisons of heuristics is introduced. Making a fair comparison of the performance of different algorithms is a general problem for the heuristic community. Most of the works on experimental analysis of heuristic algorithms have been focused on tabular comparisons of experimental results over standard sets of benchmark instances. However, from a statistical point of view, and according to the experimental design theory, a minimum requirement to compare heuristic algorithms is the use of non-parametric tests. Non-parametric tests can be used for comparing algorithms whose results represent average values, in spite of the inexistence of relationships between them, and explicit conditions of normality, among others. The proposed tool, referred to as VisTHAA, incorporates four non-parametric statistical tests to facilitate the comparative analysis of heuristics. As a case study, VisTHAA is applied to analyze the published results for the best state-of-the-art algorithms that solve the one-dimensional Bin Packing Problem.

Sign in / Sign up

Export Citation Format

Share Document