2,184,490 research outputs found
Worst-case analysis for new online bin packing problems
No full textWe consider two new online bin packing problems, the online Variable Cost and Size Bin Packing Problem (o-VCSBPP) and the online Generalized Bin Packing Problem (o-GBPP). We take two well-known bin packing algorithms to address them, the First Fit (FF) and the Best Fit (BF). We show that both algorithms have an asymptotic worst-case ratio bound equal to 2 for the o-VCSBPP and this bound is tight. When there are enough bins of a particular type to load all items, FF and BF also have an absolute worst-case ratio bound equal to 2 for the o-VCSBPP, and this bound is also tight. In addition, we prove that no worst-case ratio bound of FF and BF can be computed for the o-GBPP. Therefore, we consider a natural evolution of these algorithms, the First Fit with Rejection and the Best Fit with Rejection, able to reject inconvenient bins at the end of the process. Similarly, we prove that no worst-case ratio of these algorithms can be computed for the o-GBPP. Finally, we give sucient conditions under which algorithms do not admit any performance ratio, and conclude that the worst-case results obtained for the o-VCSBPP and the o-GBPP also hold for the oine variant of these two problem
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
No full textWe present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one-dimensional bin-packing algorithms. Since the algorithm is of next-fit type it can also be used for those cases where the output is required to be on-line (e. g. if we open an new bin we have no possibility to pack elements into the earlier opened bins). We give a tight bound for its worst-case and show that this bound is a parameter of the maximal sizes of the items to be packed. Moreover, we also present a probabilistic analysis of this algorithm.worst-case analysis;probabilistic analysis;bin-packing;heuristic algorithm;on-line algorithm;two-dimensional packing
Riwayat Hidup Imam AL-Allamah Al-Habib Muhammad Bin Ali bin Alawi As-Saqqaf
No full textbuku ini membahas tentang kisah pula riwayat hidup ulama-ulama besar di zaman itu yang pernah menjadi guru baginya, baik yang senegri dengan habib muhammad bin Ali maupun berasal dari negara-negara lainnya.195 hlm.:22 c
On-line bin-packing problem : maximizing the number of unused bins
No full textIn this paper, we study the on-line version of the bin-packing problem. We analyze the approximation behavior of an on-line bin-packing algorithm under an approximation criterion called differential ratio. We are interested in two types of results : the differential competitivity ratio guaranteed by the on-line algorithm and hardness results that account for the difficulty of the problem and for the quality of the algorithm developed to solve it. In its off-line version, the bin-packing problem, BP, is better approximated in differential framework than in standard one. Our objective is to determine if or not such result exists for the on-line version of BP.On-line algorithm, bin-packing problem, competitivity ratio.
Riwayat Hidup Imam AL-Allamah Al-Habib Muhammad Bin Ali bin Alawi As-Saqqaf
No full textbuku ini membahas tentang kisah pula riwayat hidup ulama-ulama besar di zaman itu yang pernah menjadi guru baginya, baik yang senegri dengan habib muhammad bin Ali maupun berasal dari negara-negara lainnya.195 hlm.:22 c
Probabilistic analysis of algorithms for dual bin packing problems
No full textIn the dual bin packing problem, the objective is to assign items of given size to the largest possible number of bins, subject to the constraint that the total size of the items assigned to any bin is at least equal to 1. We carry out a probabilistic analysis of this problem under the assumption that the items are drawn independently from the uniform distribution on [0, 1] and reveal the connection between this problem and the classical bin packing problem as well as to renewal theory.
Extreme-Point-based Heuristics for the Three-Dimensional Bin Packing problem
No full textOne of the main issues in addressing three-dimensional packing problems is finding an efficient and accurate definition of the points at which to place the items inside the bins, because the performance of exact and heuristic solution methods is actually strongly influenced by the choice of a placement rule. We introduce the extreme point concept and present a new extreme point-based rule for packing items inside a three-dimensional container. The extreme point rule is independent from the particular packing problem addressed and can handle additional constraints, such as fixing the position of the items. The new extreme point rule is also used to derive new constructive heuristics for the three-dimensional bin-packing problem. Extensive computational results show the effectiveness of the new heuristics compared to state-of-the-art results. Moreover, the same heuristics, when applied to the two-dimensional bin-packing problem, outperform those specifically designed for the proble
A heuristic procedure for one dimensional bin packing problem with additional constraints
No full textWe proposed a heuristic algorithm to solve the one-dimensional bin-packing problem with additional constraints. The proposed algorithm has been applied to solve a practical vehicle-allocation problem. The experimental results show that our proposed heuristic provides optimal or near-optimal results, and performs better than the first fit decreasing algorithm modified to incorporate additional constraints.
A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
No full textIn this note we present a simplified proof of a lower bound for on-line bin packing. This proof also covers the well-known result given by Liang in Inform. Process Lett. 10 (1980) 76–79.
Jejak Khulafaur Rasyidin : Umar bin Khattab
No full textBuku ini membahas tentang riwayat hidup Umar bin Khattabxx, 428 hlm.; ilus.; 29 cm
- …
