一种新的分层方法对异构三维托盘装载问题受到实际装载和交付约束

S. Kır, Harun Resit Yazgan
{"title":"一种新的分层方法对异构三维托盘装载问题受到实际装载和交付约束","authors":"S. Kır, Harun Resit Yazgan","doi":"10.1504/EJIE.2019.10022888","DOIUrl":null,"url":null,"abstract":"This paper presents a hierarchical approach, which consists of a two-stage genetic algorithm and a mixed integer linear programming, for a heterogeneous three-dimensional pallet loading problem in consideration of the rotation, the relative positioning, the load-bearing strength and the fragility constraints. Stage #1 of the proposed two-stage genetic algorithm provides to reduce the number of items to be packed by combining similar items based on a stack-building approach. And, stage #2 provides to estimate the number of required free pallets. After that, the proposed mixed integer linear programming solves the problem considering the findings of the proposed two-stage genetic algorithm. The proposed hierarchical approach was tested on well-known instances leading to favourable results and compared with a decent solution approach. In addition, a case study was presented. [Received: 7 July 2018; Revised: 20 November 2018; Accepted: 25 January 2019]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A novel hierarchical approach for a heterogeneous 3D pallet loading problem subject to factual loading and delivery constraints\",\"authors\":\"S. Kır, Harun Resit Yazgan\",\"doi\":\"10.1504/EJIE.2019.10022888\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a hierarchical approach, which consists of a two-stage genetic algorithm and a mixed integer linear programming, for a heterogeneous three-dimensional pallet loading problem in consideration of the rotation, the relative positioning, the load-bearing strength and the fragility constraints. Stage #1 of the proposed two-stage genetic algorithm provides to reduce the number of items to be packed by combining similar items based on a stack-building approach. And, stage #2 provides to estimate the number of required free pallets. After that, the proposed mixed integer linear programming solves the problem considering the findings of the proposed two-stage genetic algorithm. The proposed hierarchical approach was tested on well-known instances leading to favourable results and compared with a decent solution approach. In addition, a case study was presented. [Received: 7 July 2018; Revised: 20 November 2018; Accepted: 25 January 2019]\",\"PeriodicalId\":314867,\"journal\":{\"name\":\"European J. of Industrial Engineering\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European J. of Industrial Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/EJIE.2019.10022888\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European J. of Industrial Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/EJIE.2019.10022888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种考虑旋转、相对定位、承载强度和易损约束的异构三维托盘装载问题的分层方法,该方法由两阶段遗传算法和混合整数线性规划组成。所提出的两阶段遗传算法的第一阶段提供了基于堆栈构建方法通过组合相似的项目来减少要打包的项目数量。并且,阶段#2提供了估算所需免费托盘的数量。然后,结合所提出的两阶段遗传算法的结果,提出的混合整数线性规划求解问题。提出的分层方法在众所周知的实例上进行了测试,得到了良好的结果,并与一种体面的解决方法进行了比较。此外,还介绍了一个案例研究。[收稿日期:2018年7月7日;修订日期:2018年11月20日;录用日期:2019年1月25日]
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel hierarchical approach for a heterogeneous 3D pallet loading problem subject to factual loading and delivery constraints
This paper presents a hierarchical approach, which consists of a two-stage genetic algorithm and a mixed integer linear programming, for a heterogeneous three-dimensional pallet loading problem in consideration of the rotation, the relative positioning, the load-bearing strength and the fragility constraints. Stage #1 of the proposed two-stage genetic algorithm provides to reduce the number of items to be packed by combining similar items based on a stack-building approach. And, stage #2 provides to estimate the number of required free pallets. After that, the proposed mixed integer linear programming solves the problem considering the findings of the proposed two-stage genetic algorithm. The proposed hierarchical approach was tested on well-known instances leading to favourable results and compared with a decent solution approach. In addition, a case study was presented. [Received: 7 July 2018; Revised: 20 November 2018; Accepted: 25 January 2019]
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信