Electric Vehicle Routing Problem with Fuzzy Time Windows using Genetic Algorithm and Tabu Search

Wahyu Syafrizal, E. Sugiharti
{"title":"Electric Vehicle Routing Problem with Fuzzy Time Windows using Genetic Algorithm and Tabu Search","authors":"Wahyu Syafrizal, E. Sugiharti","doi":"10.15294/jaist.v4i2.62314","DOIUrl":null,"url":null,"abstract":"\n \n \n \nThe distribution of goods becomes a very calculated thing in the economic aspect, especially in the case of wide and complex distribution. The greater the range of distribution of goods, the more precise, fast, and accurate calculations are needed. Specifically, the calculation of the distribution required starts from mileage, total travel time, customer satisfaction level based on customer time windows, and operational costs. Vehicle Routing Problem (VRP) is a solution to the problem of distributing goods from the depot to its customers. This study aims to determine the optimal route. The methods used for VRP optimization are the Genetic Algorithm (GA) and Tabu Search (TS) methods. Fuzzy logic is used to provide leeway on the limitations of the time windows parameters, thus providing a time tolerance in the event of early arrival of the vehicle or delay in delivery. Data processing using the GA-TS combination was carried out as many as two types of trials, namely trials with the same dataset ten times and trials with various types of datasets ten times. The results of the first trial fitness value on E-VRPFTW average increased by 14.39% compared to the results of the E-VRPTW fitness value that did not use fuzzy. The results of the second trial also experienced an average increase of 8.49% compared to the results of the E-VRPTW fitness value that did not use fuzzy. Therefore, the addition of fuzzy logic has an effect in determining the optimum route of E-VRPTW. \n \n \n \n","PeriodicalId":418742,"journal":{"name":"Journal of Advances in Information Systems and Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advances in Information Systems and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15294/jaist.v4i2.62314","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The distribution of goods becomes a very calculated thing in the economic aspect, especially in the case of wide and complex distribution. The greater the range of distribution of goods, the more precise, fast, and accurate calculations are needed. Specifically, the calculation of the distribution required starts from mileage, total travel time, customer satisfaction level based on customer time windows, and operational costs. Vehicle Routing Problem (VRP) is a solution to the problem of distributing goods from the depot to its customers. This study aims to determine the optimal route. The methods used for VRP optimization are the Genetic Algorithm (GA) and Tabu Search (TS) methods. Fuzzy logic is used to provide leeway on the limitations of the time windows parameters, thus providing a time tolerance in the event of early arrival of the vehicle or delay in delivery. Data processing using the GA-TS combination was carried out as many as two types of trials, namely trials with the same dataset ten times and trials with various types of datasets ten times. The results of the first trial fitness value on E-VRPFTW average increased by 14.39% compared to the results of the E-VRPTW fitness value that did not use fuzzy. The results of the second trial also experienced an average increase of 8.49% compared to the results of the E-VRPTW fitness value that did not use fuzzy. Therefore, the addition of fuzzy logic has an effect in determining the optimum route of E-VRPTW.
基于遗传算法和禁忌搜索的模糊时间窗电动车路径问题
在经济方面,特别是在广泛而复杂的分配情况下,商品分配成为一件非常需要计算的事情。商品分布的范围越大,就越需要精确、快速和准确的计算。具体地说,所需分配的计算从里程、总旅行时间、基于客户时间窗口的客户满意度水平和运营成本开始。车辆路径问题(Vehicle Routing Problem, VRP)是解决货物从仓库到客户的配送问题。本研究旨在确定最优路线。VRP优化方法主要有遗传算法(GA)和禁忌搜索(TS)两种。模糊逻辑用于在时间窗口参数的限制上提供余地,从而在车辆提前到达或延迟交付的情况下提供时间公差。使用GA-TS组合的数据处理进行了多达两种类型的试验,即同一数据集的试验10次和不同类型数据集的试验10次。与未使用模糊的E-VRPTW适应度值相比,第一次试验的适应度值对E-VRPFTW平均值的结果提高了14.39%。第二次试验的结果也比未使用模糊的E-VRPTW适应度值的结果平均提高了8.49%。因此,模糊逻辑的加入对确定E-VRPTW的最优路径有一定的作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信