• Corpus ID: 50260529

Basic Analysis of Bin-Packing Heuristics

  title={Basic Analysis of Bin-Packing Heuristics},
  author={Bastian Alexander Rieck},
The bin-packing problem continues to remain relevant in numerous application areas. This technical report discusses the empirical performance of di€erent bin-packing heuristics for certain test problems. 

Figures and Tables from this paper

An Adaptive Fitness-Dependent Optimizer for the One-Dimensional Bin Packing Problem
This paper proposes an adaptive procedure using a recently optimized swarm algorithm and fitness-dependent optimizer (FDO) to solve the one-dimensional bin packing problem (1D-BPP), the first study to apply the FDO algorithm in a discrete optimization problem, especially for solving the BPP.
Towards Fully Jitterless Applications: Periodic Scheduling in Multiprocessor MCSs Using a Table-Driven Approach
This paper proposes FENP_MC (Fixed Execution Non-Preemptive Mixed Criticality), a real-time, table-driven, non-preemptive scheduling method specifically adapted to mixed criticality systems which guarantees jitterless execution in a mixedcriticality time-triggered environment.
Neural Simulated Annealing
This work view SA from a reinforcement learning perspective and frame the proposal distribution as a policy, which can be optimised for higher solution quality given a fixed computational budget, and demonstrates that this Neural SA with such a learnt proposal distribution, parametrised by small equivariant neural networks, outperforms SA baselines on a number of problems.
Resource Management in LADNs Supporting 5G V2X Communications
This paper proposes a formulation of the resource management problem as an optimization problem with the objective of minimizing the number of RRHs to be turned on subject to the uplink bandwidth constraints and proposes a solution with heuristic algorithms to deal with the complexity of the problem for large scenarios.
A novel journey sharing platform for collective events
This dissertation explores the implementation of a platform that focuses on collective events, which are distributed amongst acquaintances, and calculates the best clusters of participants, and found that combinatorial optimization solutions provide the best results.
Energy and performance aware resource management in heterogeneous cloud datacenters
Several algorithms for energy-performance efficient VM allocation and consolidation are proposed, implemented through extensions and modifications to the popular Cloud simulation environment, CloudSim, and evaluated in respect to a large dataset of workload information from a major cloud provider.
Optimalizace nákladky na kamiony ve firmě Gates Hydraulics s.r.o.
Tato prace se zabýva problematikou naloženi nakladu na kamion v co možna nejefektivnějsi formě, tedy rychle a přesně. Řesime zde problem uloženi co největsiho poctu objektů (beden) na co nejmensi


On-line bin packing with restricted repacking
It is proved that the upper bound for the asymptotic competitive ratio of the semi-on-line algorithm is a decreasing function of k, which tends to 3/2 as k goes to infinity.
Lower Bound for the Online Bin Packing Problem with Restricted Repacking
This paper proves the lower bound on the asymptotic worst-case ratio for so-called fully dynamic bin packing algorithms, where the number of repackable items in each step is restricted by a constant using the Lambert $W$ function.
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge