{"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}
引用次数: 2
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]