工业仓储问题的启发式方法

2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO) Pub Date : 2013-04-28 DOI:10.1109/ICMSAO.2013.6552561

Salma Mezghani, A. Frikha

{"title":"工业仓储问题的启发式方法","authors":"Salma Mezghani, A. Frikha","doi":"10.1109/ICMSAO.2013.6552561","DOIUrl":null,"url":null,"abstract":"We investigate a real Storage Problem (SP) defined by the Tunisian company. It requires finding the minimum number of bins to pack all the available items (mattresses). Each item has a different sizes (width, height, length) and characteristics (ranges, colors, quantity). The problem is interpreted as Three-Dimensional Variable-Sized Bin Packing Problem (3D-VSBPP). Two heuristics are presented based on Best-Fit Decreasing (BFD) and Next-Fit decreasing (NFD) strategy. Those heuristics are analyzed in case; the number of bins is unlimited. The proposed approaches are analyzed on a real data with up to 9344 items and two bins types.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Heuristics approaches for the industrial Storage Problem\",\"authors\":\"Salma Mezghani, A. Frikha\",\"doi\":\"10.1109/ICMSAO.2013.6552561\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate a real Storage Problem (SP) defined by the Tunisian company. It requires finding the minimum number of bins to pack all the available items (mattresses). Each item has a different sizes (width, height, length) and characteristics (ranges, colors, quantity). The problem is interpreted as Three-Dimensional Variable-Sized Bin Packing Problem (3D-VSBPP). Two heuristics are presented based on Best-Fit Decreasing (BFD) and Next-Fit decreasing (NFD) strategy. Those heuristics are analyzed in case; the number of bins is unlimited. The proposed approaches are analyzed on a real data with up to 9344 items and two bins types.\",\"PeriodicalId\":339666,\"journal\":{\"name\":\"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMSAO.2013.6552561\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMSAO.2013.6552561","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们调查了突尼斯公司定义的一个真实的存储问题(SP)。它需要找到最小数量的箱子来包装所有可用的物品(床垫)。每件物品都有不同的尺寸(宽、高、长)和特征(范围、颜色、数量)。该问题被解释为三维变尺寸装箱问题(3D-VSBPP)。提出了基于最佳拟合递减(BFD)和次拟合递减(NFD)策略的两种启发式算法。对这些启发式进行了分析;箱子的数量是无限的。在一个包含9344个项目和两种箱子类型的真实数据上对所提出的方法进行了分析。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Heuristics approaches for the industrial Storage Problem

We investigate a real Storage Problem (SP) defined by the Tunisian company. It requires finding the minimum number of bins to pack all the available items (mattresses). Each item has a different sizes (width, height, length) and characteristics (ranges, colors, quantity). The problem is interpreted as Three-Dimensional Variable-Sized Bin Packing Problem (3D-VSBPP). Two heuristics are presented based on Best-Fit Decreasing (BFD) and Next-Fit decreasing (NFD) strategy. Those heuristics are analyzed in case; the number of bins is unlimited. The proposed approaches are analyzed on a real data with up to 9344 items and two bins types.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)

自引率

0.00%

发文量