{"title":"求解截料问题的粒子群优化方法","authors":"Ghassen Ben Lagha, Nadia Dahmani, S. Krichen","doi":"10.1109/ICAdLT.2014.6866321","DOIUrl":null,"url":null,"abstract":"We propose in this paper a one dimensional cutting stock problem encountered in a large manufacturer of multi-usable cables. The problem consists in the post-production process where a variety of orders of multi-sized sets of cables should be satisfied. We developed a solution method based on a particle swarm optimization approach that takes into account the characteristics of the specific problem. We assume that the manufacture produce cables sets having the same length. The reduction of the wastage is tackled which is successfully tested in this paper. A mathematical model of the problem is developed, and results on a wide variety of instances and comparisons with other works found in the literature are presented to illustrate the effectiveness of our algorithm in solving the cutting stock problem.","PeriodicalId":166090,"journal":{"name":"2014 International Conference on Advanced Logistics and Transport (ICALT)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Particle swarm optimization approach for resolving the cutting stock problem\",\"authors\":\"Ghassen Ben Lagha, Nadia Dahmani, S. Krichen\",\"doi\":\"10.1109/ICAdLT.2014.6866321\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose in this paper a one dimensional cutting stock problem encountered in a large manufacturer of multi-usable cables. The problem consists in the post-production process where a variety of orders of multi-sized sets of cables should be satisfied. We developed a solution method based on a particle swarm optimization approach that takes into account the characteristics of the specific problem. We assume that the manufacture produce cables sets having the same length. The reduction of the wastage is tackled which is successfully tested in this paper. A mathematical model of the problem is developed, and results on a wide variety of instances and comparisons with other works found in the literature are presented to illustrate the effectiveness of our algorithm in solving the cutting stock problem.\",\"PeriodicalId\":166090,\"journal\":{\"name\":\"2014 International Conference on Advanced Logistics and Transport (ICALT)\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Advanced Logistics and Transport (ICALT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAdLT.2014.6866321\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Advanced Logistics and Transport (ICALT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAdLT.2014.6866321","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Particle swarm optimization approach for resolving the cutting stock problem
We propose in this paper a one dimensional cutting stock problem encountered in a large manufacturer of multi-usable cables. The problem consists in the post-production process where a variety of orders of multi-sized sets of cables should be satisfied. We developed a solution method based on a particle swarm optimization approach that takes into account the characteristics of the specific problem. We assume that the manufacture produce cables sets having the same length. The reduction of the wastage is tackled which is successfully tested in this paper. A mathematical model of the problem is developed, and results on a wide variety of instances and comparisons with other works found in the literature are presented to illustrate the effectiveness of our algorithm in solving the cutting stock problem.