{"title":"三维布局问题的自适应混合遗传算法","authors":"Jinshan Jiang, Shi Yin","doi":"10.1109/GCIS.2012.34","DOIUrl":null,"url":null,"abstract":"A new heuristic algorithm based on simple blocks is proposed in this paper to pack to solve three-dimensional packing problems(3DPP), and a self-adaptive genetic algorithm is used to optimize the packing sequence and direction of the constraint sequence in order to find an approximate optimal solution of the problem. In the heuristic algorithm, the simple block selected each time must not only to be packed into the current residual space, but also to be the most appropriate one, the packing sequence is a permutation of the types of boxes. An experimental study over the LN computational example shows that the algorithm is an effective method to solve the packing problems.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Self-Adaptive Hybrid Genetic Algorithm for 3D Packing Problem\",\"authors\":\"Jinshan Jiang, Shi Yin\",\"doi\":\"10.1109/GCIS.2012.34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new heuristic algorithm based on simple blocks is proposed in this paper to pack to solve three-dimensional packing problems(3DPP), and a self-adaptive genetic algorithm is used to optimize the packing sequence and direction of the constraint sequence in order to find an approximate optimal solution of the problem. In the heuristic algorithm, the simple block selected each time must not only to be packed into the current residual space, but also to be the most appropriate one, the packing sequence is a permutation of the types of boxes. An experimental study over the LN computational example shows that the algorithm is an effective method to solve the packing problems.\",\"PeriodicalId\":337629,\"journal\":{\"name\":\"2012 Third Global Congress on Intelligent Systems\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Third Global Congress on Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCIS.2012.34\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third Global Congress on Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCIS.2012.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Self-Adaptive Hybrid Genetic Algorithm for 3D Packing Problem
A new heuristic algorithm based on simple blocks is proposed in this paper to pack to solve three-dimensional packing problems(3DPP), and a self-adaptive genetic algorithm is used to optimize the packing sequence and direction of the constraint sequence in order to find an approximate optimal solution of the problem. In the heuristic algorithm, the simple block selected each time must not only to be packed into the current residual space, but also to be the most appropriate one, the packing sequence is a permutation of the types of boxes. An experimental study over the LN computational example shows that the algorithm is an effective method to solve the packing problems.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
