提出了一种改进的粒子群优化算法,用于解决直接发货的库存调度问题

I. Abadi, S. H. Zegordi, A. Mirzaei
{"title":"提出了一种改进的粒子群优化算法,用于解决直接发货的库存调度问题","authors":"I. Abadi, S. H. Zegordi, A. Mirzaei","doi":"10.1109/IEEM.2011.6117911","DOIUrl":null,"url":null,"abstract":"This paper considers a multi-period multi-product inventory routing problem whereas the objective is to minimize total system cost that includes production setup, inventory and distribution costs. The problem integrates decisions on the production planning, inventory management and distribution planning. Here, we assume that products are produced and delivered from one manufacturer to a set of retailers through a fleet of homogenous capacitated vehicles under direct shipping strategy. Since the problem is known as an NP-hard problem, this paper proposes an improved particle swarm optimization algorithm for solving the problem. The efficiency and the reliability of the proposed algorithm are evaluated by using various test problems with different sizes that is randomly generated. The performance of the developed algorithm is compared with two different algorithms: Particle Swarm Optimization, and Genetic Algorithm. The numerical results show that the developed algorithm outperforms benchmark algorithms, especially for the large-sized problems.","PeriodicalId":427457,"journal":{"name":"2011 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Developing an improved particle swarm optimization algorithm for solving the inventory routing problem with direct shipment\",\"authors\":\"I. Abadi, S. H. Zegordi, A. Mirzaei\",\"doi\":\"10.1109/IEEM.2011.6117911\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers a multi-period multi-product inventory routing problem whereas the objective is to minimize total system cost that includes production setup, inventory and distribution costs. The problem integrates decisions on the production planning, inventory management and distribution planning. Here, we assume that products are produced and delivered from one manufacturer to a set of retailers through a fleet of homogenous capacitated vehicles under direct shipping strategy. Since the problem is known as an NP-hard problem, this paper proposes an improved particle swarm optimization algorithm for solving the problem. The efficiency and the reliability of the proposed algorithm are evaluated by using various test problems with different sizes that is randomly generated. The performance of the developed algorithm is compared with two different algorithms: Particle Swarm Optimization, and Genetic Algorithm. The numerical results show that the developed algorithm outperforms benchmark algorithms, especially for the large-sized problems.\",\"PeriodicalId\":427457,\"journal\":{\"name\":\"2011 IEEE International Conference on Industrial Engineering and Engineering Management\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Industrial Engineering and Engineering Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEM.2011.6117911\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Industrial Engineering and Engineering Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2011.6117911","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了一个多周期多产品库存路径问题,其目标是使包括生产准备成本、库存成本和配送成本在内的系统总成本最小。该问题集成了生产计划、库存管理和分配计划的决策。在这里,我们假设产品是在直接运输策略下,通过同质车辆车队从一个制造商生产并交付给一组零售商的。由于该问题被称为np困难问题,本文提出了一种改进的粒子群优化算法来求解该问题。通过随机生成的各种不同大小的测试问题,对该算法的效率和可靠性进行了评价。将该算法与粒子群算法和遗传算法进行了性能比较。数值结果表明,该算法在求解大型问题时优于基准算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Developing an improved particle swarm optimization algorithm for solving the inventory routing problem with direct shipment
This paper considers a multi-period multi-product inventory routing problem whereas the objective is to minimize total system cost that includes production setup, inventory and distribution costs. The problem integrates decisions on the production planning, inventory management and distribution planning. Here, we assume that products are produced and delivered from one manufacturer to a set of retailers through a fleet of homogenous capacitated vehicles under direct shipping strategy. Since the problem is known as an NP-hard problem, this paper proposes an improved particle swarm optimization algorithm for solving the problem. The efficiency and the reliability of the proposed algorithm are evaluated by using various test problems with different sizes that is randomly generated. The performance of the developed algorithm is compared with two different algorithms: Particle Swarm Optimization, and Genetic Algorithm. The numerical results show that the developed algorithm outperforms benchmark algorithms, especially for the large-sized problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信