Filters








10,821 Hits in 6.9 sec

Average-case analyses of first fit and random fit bin packing

Susanne Albers, Michael Mitzenmacher
<span title="">2000</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wtbq2zeu3fctdhu67pe2vn6hti" style="color: black;">Random structures &amp; algorithms (Print)</a> </i> &nbsp;
Our proof is motivated by an analysis of Random Fit, a new simple packing algorithm related to First Fit, that is interesting in its own right.  ...  We prove that the First Fit bin packing algorithm is stable under the input distribution U fk 2; kg for all k 3, settling an open question from the recent survey by Co man, Garey, and Johnson 3].  ...  The performance of First Fit and Best Fit in the worst case and uniform average case has been settled for quite some time.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/(sici)1098-2418(200005)16:3&lt;240::aid-rsa2&gt;3.0.co;2-v">doi:10.1002/(sici)1098-2418(200005)16:3&lt;240::aid-rsa2&gt;3.0.co;2-v</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oel6gtr5w5cnzb52w6ttypeghq">fatcat:oel6gtr5w5cnzb52w6ttypeghq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110401173315/http://www2.informatik.hu-berlin.de/~albers/papers/soda98.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/be/ee/beee6096b87e1d8af68ceba73ba6985fa0b4c5bf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/(sici)1098-2418(200005)16:3&lt;240::aid-rsa2&gt;3.0.co;2-v"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Complexity of combinatorial ordering genetic algorithms COFFGA and CONFGA

Huda Hallawi, Hongmei He
<span title="">2019</span> <i title="AIP Publishing"> THE 7TH INTERNATIONAL CONFERENCE ON APPLIED SCIENCE AND TECHNOLOGY (ICAST 2019) </i> &nbsp;
This paper analyses the complexity of two Algorithms called COFFGA (Combinatorial Ordering First Fit Genetic Algorithm) and CONFGA (Combinatorial Ordering Next Fit Genetic Algorithm).  ...  The complexity of COFFGA and CONFGA are analysed individually.  ...  CONFGA, and 2-D First Fit (2-D FF) in COFFGA.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1063/1.5123127">doi:10.1063/1.5123127</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tlrvs5yxpfdfjaecq5biegcste">fatcat:tlrvs5yxpfdfjaecq5biegcste</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210715203802/https://dspace.lib.cranfield.ac.uk/bitstream/handle/1826/16445/Complexity_of_combinatorial_ordering_genetic_algorithms_COFFGA_and_CONFGA-2019.pdf;jsessionid=C456AEAF21B78AB4A0D6F46DA2EB1866?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/81/1d/811dec3791f7cf66a15c586f1274a4f39dc131e1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1063/1.5123127"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling [chapter]

Andreas Karrenbauer, Thomas Rothvoß
<span title="">2009</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
While such average-case analyses are a classical topic of Bin Packing, to the best of our knowledge, this is the first result dealing with a theoretical average-case analysis for this scheduling problem  ...  We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically optimal processor assignments  ...  Baruah, for reading a preliminary version of this paper and giving very helpful advices.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-04128-0_39">doi:10.1007/978-3-642-04128-0_39</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/p47lltkkqzfrrefaqwdxji3rum">fatcat:p47lltkkqzfrrefaqwdxji3rum</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829001640/https://kops.uni-konstanz.de/bitstream/handle/123456789/6005/avcase_esa09.pdf;sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f2/d1/f2d18eef86e0e89de94534cb0ea8ac46b612cba0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-04128-0_39"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Efficient Bin Packing Algorithms for Resource Provisioning in the Cloud [chapter]

Shahin Kamali
<span title="">2016</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
HarmonicMix is simple and runs as fast as classic bin packing algorithms such as Best Fit and First Fit; this makes the algorithm suitable for practical purposes.  ...  The goal is to use live migration to achieve packings with a small number of active bins. Reducing the number of bins is critical for green computing and saving on energy costs.  ...  Unfortunately, Harmonic algorithm has a poor average-case performance [9] when compared to classic algorithms such as Best Fit and First Fit.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-29919-8_7">doi:10.1007/978-3-319-29919-8_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/l5663myplbgpnlorjwp3s3s2q4">fatcat:l5663myplbgpnlorjwp3s3s2q4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161013054626/http://supertech.csail.mit.edu/papers/ShahinAlgoCloud15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ba/ae/baae5b704a40d882b8c00140b347f1dfdb3f5b25.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-29919-8_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

An All-Around Near-Optimal Solution for the Classic Bin Packing Problem [article]

Shahin Kamali, Alejandro López-Ortiz
<span title="2014-04-17">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper we present the first algorithm with optimal average-case and close-to-best known worst-case performance for the classic on-line problem of bin packing.  ...  Finally, our extensive experimental evaluation of the studied bin packing algorithms shows that our proposed algorithms have comparable average-case performance with Best Fit and First Fit, and this holds  ...  This also addresses a conjecture in [32] stated as 'Harmonic-K is better than First Fit in the worst-case performance, and First Fit is better than Harmonic-K in the average-case performance.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1404.4526v1">arXiv:1404.4526v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lamgcisp2bh77lnnlredurr4dq">fatcat:lamgcisp2bh77lnnlredurr4dq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200827174934/https://arxiv.org/pdf/1404.4526v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/06/b9/06b9e0905939d3d281ceee007c5563af66ae9bfe.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1404.4526v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Online Bin Packing with Known T [article]

Shang Liu, Xiaocheng Li
<span title="2021-12-06">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In the online bin packing problem, a sequence of items is revealed one at a time, and each item must be packed into an available bin instantly upon its arrival.  ...  As the analysis only relies on a symmetry between the offline and online problems, the algorithm and benchmark analyses can be naturally extended from the stochastic model to the random permutation model  ...  Fundamental discrepancies between average-case analyses under discrete and continuous distributions: A bin packing case study.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2112.03200v1">arXiv:2112.03200v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/37nelr2365ftrkvscqaoyk5rby">fatcat:37nelr2365ftrkvscqaoyk5rby</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211208170955/https://arxiv.org/pdf/2112.03200v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2e/3d/2e3d134b716622732bd8dcbc58d95b556a5a341f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2112.03200v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Page 427 of Mathematical Reviews Vol. , Issue 91A [page]

<span title="">1991</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
We start with an ordered collection of unit-size bins, and we put each item in turn in the first bin in which it fits.  ...  The bin-packing problem requires finding the minimum number of unit-size bins needed to pack a given collection of items with sizes between zero and one.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1991-01_91a/page/427" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1991-01_91a/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

On Constructing Ensembles for Combinatorial Optimisation

Emma Hart, Kevin Sim
<span title="">2018</span> <i title="MIT Press - Journals"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b7u6fu546fgplmudjzcn5zqqme" style="color: black;">Evolutionary Computation</a> </i> &nbsp;
In this paper, we address fundamental questions regarding ensemble composition in optimisation using the domain of bin-packing as a example; in particular we investigate the trade-off between accuracy  ...  The method and findings can be generalised to any meta-heuristic ensemble, and lead to better understanding of how to undertake principled ensemble design.  ...  If there is no combination of n items that fit a bin, then the rule fails and a new bin is opened (no items are packed). The remaining 4 rules are of type best-of-n.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1162/evco_a_00203">doi:10.1162/evco_a_00203</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/28072555">pmid:28072555</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vxdd6i66svfu5hpgs5pyh33z5y">fatcat:vxdd6i66svfu5hpgs5pyh33z5y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190428200648/https://www.napier.ac.uk/~/media/worktribe/output-444826/on-constructing-ensembles-for-combinatorial-optimisation.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3d/63/3d63fd1cbe55f18160c33592df2d32d9eccbe329.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1162/evco_a_00203"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> mitpressjournals.org </button> </a>

SLO-aware colocation of data center tasks based on instantaneous processor requirements

Pawel Janus, Krzysztof Rzadca
<span title="">2017</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/eitdfnn7k5fohgz7jhhim3f4bm" style="color: black;">Proceedings of the 2017 Symposium on Cloud Computing - SoCC &#39;17</a> </i> &nbsp;
We use this result for a probabilistic fit test, called the Gaussian Percentile Approximation (GPA), for standard bin-packing algorithms.  ...  Such colocation results in more efficient utilization of machines, but, when tasks' requirements exceed available resources, some of the tasks might be throttled down or preempted.  ...  A standard bin-packing algorithm (such as First Fit, Best Fit, etc.) packs items {x i } to bins S j sequentially.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3127479.3132244">doi:10.1145/3127479.3132244</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cloud/JanusR17.html">dblp:conf/cloud/JanusR17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/p4lj52bcn5egndtgjkgndozkmq">fatcat:p4lj52bcn5egndtgjkgndozkmq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191019234112/https://arxiv.org/pdf/1709.01384v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/51/09/5109efbf403bdc17b3f89a84656ee26917b373ae.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3127479.3132244"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Fundamental discrepancies between average-case analyses under discrete and continuous distributions

E. G. Coffman, C. Courcoubetis, M. R. Garey, D. S. Johnson, L. A. McGeoch, P. W. Shor, R. R. Weber, M. Yannakakis
<span title="">1991</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC &#39;91</a> </i> &nbsp;
We consider the average case behavior of one-  ...  In our opinion the most interesting open problem in the average-case analysis of bin packing algorithms concerns the situations in which First Fit and Best Fit appear to yield linear expected waste, as  ...  We then apply the "FIRST FIT" packing rule, in which the ftrst item is placed in the first bin, and thereafkr each item in turn is placed in the lowest indexed (i.e., first) bin that still has room enough  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/103418.103446">doi:10.1145/103418.103446</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/CoffmanCGJMSWY91.html">dblp:conf/stoc/CoffmanCGJMSWY91</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vclbnl6uazbflhimo4egcbmmmm">fatcat:vclbnl6uazbflhimo4egcbmmmm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120130183227/http://www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20...%20Weber%201991%20Fundamental%20discrepancies%20between%20average-case%20analyses%20under%20discrete%20and%20continuous%20distributions%20A%20bin%20packing%20case%20study.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/48/09/48097d98a358c85aa9b2885e79df00d45c9b4648.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/103418.103446"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Online Knapsack Revisited [chapter]

Marek Cygan, Łukasz Jeż
<span title="">2014</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Dual Bin Packing [1, 6] in case of the sum and Removable Knapsack [10, 11] in case of the maximum.  ...  the date of receipt and acceptance should be inserted later Keywords online algorithms · competitive analysis · online knapsack · dual bin packing CR Subject Classification Theory of computation/Design  ...  Acknowledgements We thank Monaldo Mastrolilli for suggesting the study of knapsack problems, Fabrizio Grandoni for suggesting the study of the sum objective, Yann Disser for helpful discussions, and anonymous  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-08001-7_13">doi:10.1007/978-3-319-08001-7_13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/njn52trxenaj3db7qjissvrnam">fatcat:njn52trxenaj3db7qjissvrnam</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829053619/http://iuuk.mff.cuni.cz/~sgall/ps/knapsack.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f1/79/f179253146b698025e6fbe40bf96e0dac424f104.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-08001-7_13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Online Knapsack Revisited

Marek Cygan, Łukasz Jeż, Jiří Sgall
<span title="2014-11-09">2014</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qj6jzeossfhihfshwf7nb7lbcq" style="color: black;">Theory of Computing Systems</a> </i> &nbsp;
Dual Bin Packing [1, 6] in case of the sum and Removable Knapsack [10, 11] in case of the maximum.  ...  the date of receipt and acceptance should be inserted later Keywords online algorithms · competitive analysis · online knapsack · dual bin packing CR Subject Classification Theory of computation/Design  ...  Acknowledgements We thank Monaldo Mastrolilli for suggesting the study of knapsack problems, Fabrizio Grandoni for suggesting the study of the sum objective, Yann Disser for helpful discussions, and anonymous  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00224-014-9566-4">doi:10.1007/s00224-014-9566-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/74zchhp7qvd5dcs6zmc7g3iwti">fatcat:74zchhp7qvd5dcs6zmc7g3iwti</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829053619/http://iuuk.mff.cuni.cz/~sgall/ps/knapsack.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f1/79/f179253146b698025e6fbe40bf96e0dac424f104.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00224-014-9566-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Providing a memory mechanism to enhance the evolutionary design of heuristics

Edmund K. Burke, Matthew R. Hyde, Graham Kendall
<span title="">2010</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2dmkezwdzrcofn7zdzzte2h75i" style="color: black;">IEEE Congress on Evolutionary Computation</a> </i> &nbsp;
This paper presents a hyper-heuristic genetic programming methodology to evolve more sophisticated one dimensional bin packing heuristics than have been evolved previously.  ...  In contrast to previously evolved heuristics for this problem, we show that these heuristics evolve to draw upon this memory in order to facilitate better planning, and improved packings.  ...  The first aspect of the results to note is that the evolved heuristics are better than best-fit in all but two cases.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cec.2010.5586388">doi:10.1109/cec.2010.5586388</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cec/BurkeHK10.html">dblp:conf/cec/BurkeHK10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vzv235hsmvegvdclyq5nqlk6m4">fatcat:vzv235hsmvegvdclyq5nqlk6m4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110913132133/http://www.cs.nott.ac.uk/~ekb/Publications/CEC-Design.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7c/25/7c25cc7cf14bff8fc4220256363cfd5faff358d3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cec.2010.5586388"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Improved Space for Bounded-Space, On-Line Bin-Packing

Gerhard Woeginger
<span title="">1993</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hn6wut4eynat5my6xdfsebg7fm" style="color: black;">SIAM Journal on Discrete Mathematics</a> </i> &nbsp;
The author presents a sequence of linear-time, bounded-space, on-line, bin-packing algorithms that are based on the "HARMONIC" algorithms Hk introduced by Lee and Lee [J. Assoc. Comput.  ...  The algorithms in this paper guarantee the worst case performance of Hk, whereas they only use O(log log k) instead of k active bins.  ...  I gratefully acknowledge the hospitality of Jrzsef Attila. Furthermore, I thank Jfinos Csirik, Gbor Galambos, and Hannes Hassler for several helpful discussions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/0406045">doi:10.1137/0406045</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zbclbdcojjbhrakinmgggsqkau">fatcat:zbclbdcojjbhrakinmgggsqkau</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190305130959/http://pdfs.semanticscholar.org/d323/e233a1ee0f211e62de1c9490840a0a8ced3a.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d3/23/d323e233a1ee0f211e62de1c9490840a0a8ced3a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/0406045"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A histogram-matching approach to the evolution of bin-packing strategies

Riccardo Poli, John Woodward, Edmund K. Burke
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2dmkezwdzrcofn7zdzzte2h75i" style="color: black;">2007 IEEE Congress on Evolutionary Computation</a> </i> &nbsp;
We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the bin-gap histogram.  ...  We test our evolved heuristics and compare them with hand-designed ones, including the wellknown best fit decreasing heuristic.  ...  ACKNOWLEDGEMENTS The authors would like to thank EPSRC (Grants EP/C523377/1 and EP/C523385/1) for financial support.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cec.2007.4424926">doi:10.1109/cec.2007.4424926</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cec/PoliWB07.html">dblp:conf/cec/PoliWB07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7gozpr6cdfeinpn63kjbqs5c4e">fatcat:7gozpr6cdfeinpn63kjbqs5c4e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080418220635/http://www.cs.nott.ac.uk/~ekb/Publications/hist-bp.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/db/5f/db5f567c7aaa59211b1377df1c65e4c2ffb1de54.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cec.2007.4424926"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 10,821 results