带时间窗的绿色车辆路径优化的改进骆驼算法

D. M. Utama, Wa Ode Nadhilah Safitri, A. Garside
{"title":"带时间窗的绿色车辆路径优化的改进骆驼算法","authors":"D. M. Utama, Wa Ode Nadhilah Safitri, A. Garside","doi":"10.9744/jti.24.1.23-36","DOIUrl":null,"url":null,"abstract":"In recent years, the issue of fuel depletion has become a significant problem in the world. The logistics sector is one of the sectors with an increase in fuel consumption. Therefore, route optimization is one of the attempts to solve the problem of minimization fuel consumption. In addition, this problem generally also has time windows. This study aimed to solve the Green Vehicle Routing Problem with Time Windows (GVRPTW) using the Camel Algorithm (CA). The objective function in this problem was to minimize the total cost of distribution, which involves the cost of fuel consumption and the cost of late delivery. The CA parameter experiment was conducted to determine the effect of the parameter on distribution cost and the computation time. In addition, this study also compared the CA algorithm's performance with the Local search algorithm, Particle Swarm Optimization, and Ant Colony Optimization. Results of this study indicated that the use of Camel population parameters and the total journey step affected the quality of the solution. Furthermore, the research results showed that the proposed algorithm had provided a better total distribution cost than the comparison algorithm.","PeriodicalId":32828,"journal":{"name":"Jurnal Teknik Industri","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Modified Camel Algorithm for Optimizing Green Vehicle Routing Problem with Time Windows\",\"authors\":\"D. M. Utama, Wa Ode Nadhilah Safitri, A. Garside\",\"doi\":\"10.9744/jti.24.1.23-36\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, the issue of fuel depletion has become a significant problem in the world. The logistics sector is one of the sectors with an increase in fuel consumption. Therefore, route optimization is one of the attempts to solve the problem of minimization fuel consumption. In addition, this problem generally also has time windows. This study aimed to solve the Green Vehicle Routing Problem with Time Windows (GVRPTW) using the Camel Algorithm (CA). The objective function in this problem was to minimize the total cost of distribution, which involves the cost of fuel consumption and the cost of late delivery. The CA parameter experiment was conducted to determine the effect of the parameter on distribution cost and the computation time. In addition, this study also compared the CA algorithm's performance with the Local search algorithm, Particle Swarm Optimization, and Ant Colony Optimization. Results of this study indicated that the use of Camel population parameters and the total journey step affected the quality of the solution. Furthermore, the research results showed that the proposed algorithm had provided a better total distribution cost than the comparison algorithm.\",\"PeriodicalId\":32828,\"journal\":{\"name\":\"Jurnal Teknik Industri\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Jurnal Teknik Industri\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9744/jti.24.1.23-36\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Teknik Industri","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9744/jti.24.1.23-36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,燃料枯竭问题已成为世界范围内的一个重大问题。物流业是燃料消耗量增加的行业之一。因此,路线优化是解决燃油消耗最小化问题的一种尝试。此外,这个问题一般也有时间窗。本研究旨在利用驼峰算法(CA)解决带时间窗的绿色车辆路径问题。该问题的目标函数是使配送总成本最小,配送总成本包括燃料消耗成本和延迟配送成本。进行了CA参数实验,以确定参数对分配成本和计算时间的影响。此外,本研究还比较了CA算法与局部搜索算法、粒子群算法和蚁群算法的性能。研究结果表明,骆驼种群参数的使用和总行程步长影响了解的质量。此外,研究结果表明,该算法比比较算法提供了更好的总分配成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modified Camel Algorithm for Optimizing Green Vehicle Routing Problem with Time Windows
In recent years, the issue of fuel depletion has become a significant problem in the world. The logistics sector is one of the sectors with an increase in fuel consumption. Therefore, route optimization is one of the attempts to solve the problem of minimization fuel consumption. In addition, this problem generally also has time windows. This study aimed to solve the Green Vehicle Routing Problem with Time Windows (GVRPTW) using the Camel Algorithm (CA). The objective function in this problem was to minimize the total cost of distribution, which involves the cost of fuel consumption and the cost of late delivery. The CA parameter experiment was conducted to determine the effect of the parameter on distribution cost and the computation time. In addition, this study also compared the CA algorithm's performance with the Local search algorithm, Particle Swarm Optimization, and Ant Colony Optimization. Results of this study indicated that the use of Camel population parameters and the total journey step affected the quality of the solution. Furthermore, the research results showed that the proposed algorithm had provided a better total distribution cost than the comparison algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
1
审稿时长
4 weeks
×
引用
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学术官方微信