多层次批量优化的花卉授粉算法

V.V.D.Sahithi, Et. al.
{"title":"多层次批量优化的花卉授粉算法","authors":"V.V.D.Sahithi, Et. al.","doi":"10.17762/itii.v9i2.344","DOIUrl":null,"url":null,"abstract":"In this competitive and constantly changing world, meeting the customer requirements within less time by providing less cost is extremely tricky task. This is only possible by optimizing all the different parameters in its life cycle. Here Optimizing the inventory plays a major role.Maintaining the exact amount of inventory, at proper place, in appropriate level is a challenging task for production managers. When we work on Multi level environments this problem becomes even more complex.So, to optimize this kind of problems we applied binary form of Flower Pollination algorithm to solve this complex problem. we solved different inventory lot sizing problems with this FP algorithm and compared the results with genetic algorithm and other algorithms. In all the scenarios our simulation results shown that FP algorithm is better than other algorithms","PeriodicalId":40759,"journal":{"name":"Information Technology in Industry","volume":"5 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"FLOWER POLLINATION ALGORITHM FOR MULTI LEVEL LOT SIZING OPTIMIZATION\",\"authors\":\"V.V.D.Sahithi, Et. al.\",\"doi\":\"10.17762/itii.v9i2.344\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this competitive and constantly changing world, meeting the customer requirements within less time by providing less cost is extremely tricky task. This is only possible by optimizing all the different parameters in its life cycle. Here Optimizing the inventory plays a major role.Maintaining the exact amount of inventory, at proper place, in appropriate level is a challenging task for production managers. When we work on Multi level environments this problem becomes even more complex.So, to optimize this kind of problems we applied binary form of Flower Pollination algorithm to solve this complex problem. we solved different inventory lot sizing problems with this FP algorithm and compared the results with genetic algorithm and other algorithms. In all the scenarios our simulation results shown that FP algorithm is better than other algorithms\",\"PeriodicalId\":40759,\"journal\":{\"name\":\"Information Technology in Industry\",\"volume\":\"5 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Technology in Industry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17762/itii.v9i2.344\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Technology in Industry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17762/itii.v9i2.344","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在这个竞争激烈且不断变化的世界中,以更低的成本在更短的时间内满足客户需求是一项极其棘手的任务。这只能通过优化其生命周期中的所有不同参数来实现。在这里,优化库存起着重要作用。对生产经理来说,在适当的位置、适当的水平上保持准确的库存数量是一项具有挑战性的任务。当我们在多层环境中工作时,这个问题变得更加复杂。因此,为了优化这类问题,我们采用二进制形式的花授粉算法来解决这类复杂问题。用该算法求解了不同的库存批量问题,并将求解结果与遗传算法和其他算法进行了比较。在所有场景下,我们的仿真结果表明,FP算法优于其他算法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
FLOWER POLLINATION ALGORITHM FOR MULTI LEVEL LOT SIZING OPTIMIZATION
In this competitive and constantly changing world, meeting the customer requirements within less time by providing less cost is extremely tricky task. This is only possible by optimizing all the different parameters in its life cycle. Here Optimizing the inventory plays a major role.Maintaining the exact amount of inventory, at proper place, in appropriate level is a challenging task for production managers. When we work on Multi level environments this problem becomes even more complex.So, to optimize this kind of problems we applied binary form of Flower Pollination algorithm to solve this complex problem. we solved different inventory lot sizing problems with this FP algorithm and compared the results with genetic algorithm and other algorithms. In all the scenarios our simulation results shown that FP algorithm is better than other algorithms
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Technology in Industry
Information Technology in Industry COMPUTER SCIENCE, SOFTWARE ENGINEERING-
自引率
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学术官方微信