Generating an Efficient Way of Dispatching Perishable Product Optimization through Exact and Metaheuristic Algorithm Comparison

Mohammad Andad Ajiz Salam, K. Komarudin, A. R. Destyanto
{"title":"Generating an Efficient Way of Dispatching Perishable Product Optimization through Exact and Metaheuristic Algorithm Comparison","authors":"Mohammad Andad Ajiz Salam, K. Komarudin, A. R. Destyanto","doi":"10.1109/ICCIA.2018.00009","DOIUrl":null,"url":null,"abstract":"Conveying product which has a limited shelf-life optimally is the concern of this study. The primary attribute of this product is perishable within a specific time frame. However, the perishable product has a critical issue in the cold chain system which leads dispatching costs inefficiency problems. Regarding this problem, a mathematical model built thru extended a vehicle routing problem, with soft time windows (VRPSTW) by considering energy consumption cost to evaluate its contribution towards the objective function. Model building conducted into computer programming that uses Python Spyder 3 for generating a feasible solution. For the sake of feasibility, a metaheuristic approach of genetic algorithms provided to find the best optimal solution; the results diagnosed that genetic algorithms can generate best feasible solution efficiently within a certain number of variables in case of perishable product delivery.","PeriodicalId":297098,"journal":{"name":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","volume":"239 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 3rd International Conference on Computational Intelligence and Applications (ICCIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIA.2018.00009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Conveying product which has a limited shelf-life optimally is the concern of this study. The primary attribute of this product is perishable within a specific time frame. However, the perishable product has a critical issue in the cold chain system which leads dispatching costs inefficiency problems. Regarding this problem, a mathematical model built thru extended a vehicle routing problem, with soft time windows (VRPSTW) by considering energy consumption cost to evaluate its contribution towards the objective function. Model building conducted into computer programming that uses Python Spyder 3 for generating a feasible solution. For the sake of feasibility, a metaheuristic approach of genetic algorithms provided to find the best optimal solution; the results diagnosed that genetic algorithms can generate best feasible solution efficiently within a certain number of variables in case of perishable product delivery.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过精确算法与元启发式算法的比较,生成易腐产品优化调度的有效方法
对有限保质期的产品进行最佳输送是本研究的重点。该产品的主要特性是在特定时间内易腐烂。然而,易腐产品在冷链系统中是一个关键问题,导致配送成本低效率问题。针对该问题,通过对车辆路径问题的扩展,建立了考虑能耗成本的软时间窗(VRPSTW)数学模型,评价其对目标函数的贡献。在计算机编程中进行模型构建,使用Python Spyder 3生成可行的解决方案。为了可行性考虑,提出了一种遗传算法的元启发式方法来寻找最优解;结果表明,遗传算法可以在一定数量的变量范围内有效地生成易腐产品交付的最佳可行解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Text Extraction and Categorization from Watermark Scientific Document in Bulk Locating Heartbeats from Electrocardiograms and Other Correlated Signals Combining Deep Learning and JSEG Cuda Segmentation Algorithm for Electrical Components Recognition An Oppositional Learning Prediction Operator for Simulated Kalman Filter Clustering Method for Financial Time Series with Co-Movement Relationship
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1