{"title":"用于解决二维箱式包装问题的混合离散灰狼优化算法--兼顾不平衡性","authors":"Saeed Kosari, Mirsaeid Hosseini Shirvani, Navid Khaledian, Danial Javaheri","doi":"10.1007/s10723-024-09761-7","DOIUrl":null,"url":null,"abstract":"<p>In different industries, there are miscellaneous applications that require multi-dimensional resources. These kinds of applications need all of the resource dimensions at the same time. Since the resources are typically scarce/expensive/pollutant, presenting an efficient resource allocation is a very favorable approach to reducing overall cost. On the other hand, the requirement of the applications on different dimensions of the resources is variable, usually, resource allocations have a high rate of wastage owing to the unpleasant resource skew-ness phenomenon. For instance, micro-service allocation in the Internet of Things (IoT) applications and Virtual Machine Placement (VMP) in a cloud context are challenging tasks because they diversely require imbalanced all resource dimensions such as CPU and Memory bandwidths, so inefficient resource allocation raises issues. In a special case, the problem under study associated with the two-dimensional resource allocation of distributed applications is modeled to the two-dimensional bin-packing problems which are categorized as the famous NP-Hard. Several approaches were proposed in the literature, but the majority of them are not aware of skew-ness and dimensional imbalances in the list of requested resources which incurs additional costs. To solve this combinatorial problem, a novel hybrid discrete gray wolf optimization algorithm (<i>HD</i>-<i>GWO</i>) is presented. It utilizes strong global search operators along with several novel walking-around procedures each of which is aware of resource dimensional skew-ness and explores discrete search space with efficient permutations. To verify <i>HD</i>-<i>GWO</i>, it was tested in miscellaneous conditions considering different correlation coefficients (<i>CC</i>) of resource dimensions. Simulation results prove that <i>HD</i>-<i>GWO</i> significantly outperforms other state-of-the-art in terms of relevant evaluation metrics along with a high potential of scalability.</p>","PeriodicalId":3,"journal":{"name":"ACS Applied Electronic Materials","volume":null,"pages":null},"PeriodicalIF":4.3000,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Hybrid Discrete Grey Wolf Optimization Algorithm Imbalance-ness Aware for Solving Two-dimensional Bin-packing Problems\",\"authors\":\"Saeed Kosari, Mirsaeid Hosseini Shirvani, Navid Khaledian, Danial Javaheri\",\"doi\":\"10.1007/s10723-024-09761-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In different industries, there are miscellaneous applications that require multi-dimensional resources. These kinds of applications need all of the resource dimensions at the same time. Since the resources are typically scarce/expensive/pollutant, presenting an efficient resource allocation is a very favorable approach to reducing overall cost. On the other hand, the requirement of the applications on different dimensions of the resources is variable, usually, resource allocations have a high rate of wastage owing to the unpleasant resource skew-ness phenomenon. For instance, micro-service allocation in the Internet of Things (IoT) applications and Virtual Machine Placement (VMP) in a cloud context are challenging tasks because they diversely require imbalanced all resource dimensions such as CPU and Memory bandwidths, so inefficient resource allocation raises issues. In a special case, the problem under study associated with the two-dimensional resource allocation of distributed applications is modeled to the two-dimensional bin-packing problems which are categorized as the famous NP-Hard. Several approaches were proposed in the literature, but the majority of them are not aware of skew-ness and dimensional imbalances in the list of requested resources which incurs additional costs. To solve this combinatorial problem, a novel hybrid discrete gray wolf optimization algorithm (<i>HD</i>-<i>GWO</i>) is presented. It utilizes strong global search operators along with several novel walking-around procedures each of which is aware of resource dimensional skew-ness and explores discrete search space with efficient permutations. To verify <i>HD</i>-<i>GWO</i>, it was tested in miscellaneous conditions considering different correlation coefficients (<i>CC</i>) of resource dimensions. Simulation results prove that <i>HD</i>-<i>GWO</i> significantly outperforms other state-of-the-art in terms of relevant evaluation metrics along with a high potential of scalability.</p>\",\"PeriodicalId\":3,\"journal\":{\"name\":\"ACS Applied Electronic Materials\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.3000,\"publicationDate\":\"2024-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACS Applied Electronic Materials\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s10723-024-09761-7\",\"RegionNum\":3,\"RegionCategory\":\"材料科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS Applied Electronic Materials","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10723-024-09761-7","RegionNum":3,"RegionCategory":"材料科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0
摘要
各行各业都有需要多维资源的各种应用。这类应用需要同时使用所有资源维度。由于资源通常是稀缺的/昂贵的/污染的,因此有效的资源分配是降低总体成本的一个非常有利的方法。另一方面,应用程序对资源不同维度的需求是不固定的,通常情况下,由于资源倾斜现象令人不快,资源分配的浪费率很高。例如,物联网(IoT)应用中的微服务分配和云背景下的虚拟机安置(VMP)都是具有挑战性的任务,因为它们对 CPU 和内存带宽等所有资源维度的需求各不相同,因此低效的资源分配会引发问题。在特殊情况下,所研究的与分布式应用程序的二维资源分配相关的问题被模拟为二维 bin-packing 问题,该问题被归类为著名的 NP-Hard。文献中提出了几种方法,但其中大多数都没有意识到所需资源列表中的倾斜度和维度不平衡会产生额外成本。为解决这一组合问题,本文提出了一种新型混合离散灰狼优化算法(HD-GWO)。该算法利用强大的全局搜索算子和几个新颖的走动程序,每个程序都能意识到资源维度的倾斜度,并通过高效的排列探索离散搜索空间。为了验证 HD-GWO,在考虑到资源维度的不同相关系数 (CC) 的各种条件下对其进行了测试。仿真结果证明,HD-GWO 在相关评估指标方面明显优于其他最先进的方法,同时具有很高的可扩展性。
A Hybrid Discrete Grey Wolf Optimization Algorithm Imbalance-ness Aware for Solving Two-dimensional Bin-packing Problems
In different industries, there are miscellaneous applications that require multi-dimensional resources. These kinds of applications need all of the resource dimensions at the same time. Since the resources are typically scarce/expensive/pollutant, presenting an efficient resource allocation is a very favorable approach to reducing overall cost. On the other hand, the requirement of the applications on different dimensions of the resources is variable, usually, resource allocations have a high rate of wastage owing to the unpleasant resource skew-ness phenomenon. For instance, micro-service allocation in the Internet of Things (IoT) applications and Virtual Machine Placement (VMP) in a cloud context are challenging tasks because they diversely require imbalanced all resource dimensions such as CPU and Memory bandwidths, so inefficient resource allocation raises issues. In a special case, the problem under study associated with the two-dimensional resource allocation of distributed applications is modeled to the two-dimensional bin-packing problems which are categorized as the famous NP-Hard. Several approaches were proposed in the literature, but the majority of them are not aware of skew-ness and dimensional imbalances in the list of requested resources which incurs additional costs. To solve this combinatorial problem, a novel hybrid discrete gray wolf optimization algorithm (HD-GWO) is presented. It utilizes strong global search operators along with several novel walking-around procedures each of which is aware of resource dimensional skew-ness and explores discrete search space with efficient permutations. To verify HD-GWO, it was tested in miscellaneous conditions considering different correlation coefficients (CC) of resource dimensions. Simulation results prove that HD-GWO significantly outperforms other state-of-the-art in terms of relevant evaluation metrics along with a high potential of scalability.