Optimization of Horticultural Food Commodity Distribution Routes using Genetic Algorithm with Crossover Partially Match

R. Yusianto, M. Sugarindra, Valentina Widya Suryaningtyas, Marimin Marimin
{"title":"Optimization of Horticultural Food Commodity Distribution Routes using Genetic Algorithm with Crossover Partially Match","authors":"R. Yusianto, M. Sugarindra, Valentina Widya Suryaningtyas, Marimin Marimin","doi":"10.1109/iSemantic55962.2022.9920422","DOIUrl":null,"url":null,"abstract":"Horticultural food commodities have unique characteristics: perishable and not durable. In addition, the distribution of these commodities is also uncertain along highly complex routes. We experimented to determine the route of potato distribution in Central Java, Indonesia. We use metaheuristic methods to find solutions to these problems. This method solves the problem using algorithms for optimization. This study aimed to determine the most optimal route using a genetic algorithm (GA) with partially matched crossover (PMX). The GA stages in this study include (1) Population Initialization; we use the Random Generator Algorithm, (2) Selection; we use the Roulette Wheel Selection method, (3) Crossover; we use the PMX method and (4) Mutation. We used ten chromosomes with seven genes each. We used ten chromosomes with seven genes each. The results of this study indicate that the best route is obtained in the second generation, namely through node1 - node7 - node2 - node6 - node5 - node3 - node4 - node1 with an optimal distance of 159 km. For further research, consider the spatial conditions for a better solution.","PeriodicalId":360042,"journal":{"name":"2022 International Seminar on Application for Technology of Information and Communication (iSemantic)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Seminar on Application for Technology of Information and Communication (iSemantic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iSemantic55962.2022.9920422","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Horticultural food commodities have unique characteristics: perishable and not durable. In addition, the distribution of these commodities is also uncertain along highly complex routes. We experimented to determine the route of potato distribution in Central Java, Indonesia. We use metaheuristic methods to find solutions to these problems. This method solves the problem using algorithms for optimization. This study aimed to determine the most optimal route using a genetic algorithm (GA) with partially matched crossover (PMX). The GA stages in this study include (1) Population Initialization; we use the Random Generator Algorithm, (2) Selection; we use the Roulette Wheel Selection method, (3) Crossover; we use the PMX method and (4) Mutation. We used ten chromosomes with seven genes each. We used ten chromosomes with seven genes each. The results of this study indicate that the best route is obtained in the second generation, namely through node1 - node7 - node2 - node6 - node5 - node3 - node4 - node1 with an optimal distance of 159 km. For further research, consider the spatial conditions for a better solution.
基于交叉部分匹配的遗传算法优化园艺食品配送路线
园艺食品商品具有易腐、不耐用的独特特点。此外,这些商品在高度复杂的路线上的分配也是不确定的。我们试验确定了印度尼西亚中爪哇地区马铃薯的分布路线。我们使用元启发式方法来找到这些问题的解决方案。该方法利用优化算法解决了这一问题。本研究旨在利用部分匹配交叉(PMX)的遗传算法(GA)确定最优路线。本研究的遗传算法阶段包括:(1)种群初始化;我们使用随机生成器算法,(2)选择;我们使用轮盘选择方法,(3)交叉;我们使用PMX方法和(4)突变。我们用了10条染色体,每条染色体有7个基因。我们用了10条染色体,每条染色体有7个基因。本研究结果表明,在第二代得到最佳路径,即经过node1 - node7 - node2 - node6 - node5 - node3 - node4 - node1,最优距离为159 km。为了进一步研究,考虑空间条件以获得更好的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信