求解Menyelesaikan同时取货车辆路径问题的Grasshopper优化算法(GOA)

Anatasia Naomi, A. B. Pratiwi, H. Suprajitno
{"title":"求解Menyelesaikan同时取货车辆路径问题的Grasshopper优化算法(GOA)","authors":"Anatasia Naomi, A. B. Pratiwi, H. Suprajitno","doi":"10.30598/tensorvol3iss2pp73-84","DOIUrl":null,"url":null,"abstract":"The purpose of this paper is to solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) using the Grasshopper Optimization Algorithm (GOA). Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is a problem of forming routes that serve each customer, by delivering and retrieving simultaneously. The purpose of VRPSPD is to minimize the total mileage to serve all customers with the limit that each customer is served exactly once, and the vehicle load does not exceed its maximum capacity. Grasshopper Optimization Algorithm (GOA) is an algorithm inspired by nature by mimicking the living behavior of grasshopper swarms in search of food sources. GOA has several main stages, namely initialization of parameters, determination of target grasshoppers, calculating the coefficient of decline, calculating the distance between grasshoppers, and calculating the new position of the grasshoppers. Implementation of the GOA program to complete VRPSPD using the C++ programming language using 3 types of data, data with 13 customers, 22 customers, and 100 customers. Based on the results of the running program, it can be concluded that the more iterations and the number of populations, the solution obtained tends to be better.","PeriodicalId":294430,"journal":{"name":"Tensor: Pure and Applied Mathematics Journal","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Grasshopper Optimizaton Algorithm (GOA) untuk Menyelesaikan Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD)\",\"authors\":\"Anatasia Naomi, A. B. Pratiwi, H. Suprajitno\",\"doi\":\"10.30598/tensorvol3iss2pp73-84\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The purpose of this paper is to solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) using the Grasshopper Optimization Algorithm (GOA). Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is a problem of forming routes that serve each customer, by delivering and retrieving simultaneously. The purpose of VRPSPD is to minimize the total mileage to serve all customers with the limit that each customer is served exactly once, and the vehicle load does not exceed its maximum capacity. Grasshopper Optimization Algorithm (GOA) is an algorithm inspired by nature by mimicking the living behavior of grasshopper swarms in search of food sources. GOA has several main stages, namely initialization of parameters, determination of target grasshoppers, calculating the coefficient of decline, calculating the distance between grasshoppers, and calculating the new position of the grasshoppers. Implementation of the GOA program to complete VRPSPD using the C++ programming language using 3 types of data, data with 13 customers, 22 customers, and 100 customers. Based on the results of the running program, it can be concluded that the more iterations and the number of populations, the solution obtained tends to be better.\",\"PeriodicalId\":294430,\"journal\":{\"name\":\"Tensor: Pure and Applied Mathematics Journal\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tensor: Pure and Applied Mathematics Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.30598/tensorvol3iss2pp73-84\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tensor: Pure and Applied Mathematics Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30598/tensorvol3iss2pp73-84","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文的目的是利用蚱蜢优化算法(Grasshopper Optimization Algorithm, GOA)来解决同时取货和交货的车辆路径问题(VRPSPD)。同时取货和取货的车辆路线问题(VRPSPD)是一个通过同时取货和取货来形成服务于每个客户的路线的问题。VRPSPD的目的是最小化服务所有客户的总里程,限制每个客户只服务一次,并且车辆负载不超过其最大容量。蚱蜢优化算法(Grasshopper Optimization Algorithm, GOA)是一种受大自然启发,通过模仿蚱蜢群寻找食物来源的生活行为而提出的算法。GOA主要有几个阶段,即参数初始化、确定目标蝗虫、计算下降系数、计算蝗虫之间的距离、计算蝗虫的新位置。使用c++编程语言实现了GOA程序,完成了VRPSPD,使用了3种类型的数据,数据有13个客户、22个客户和100个客户。根据运行程序的结果,可以得出迭代次数越多,种群数量越多,得到的解越好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Grasshopper Optimizaton Algorithm (GOA) untuk Menyelesaikan Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD)
The purpose of this paper is to solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) using the Grasshopper Optimization Algorithm (GOA). Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is a problem of forming routes that serve each customer, by delivering and retrieving simultaneously. The purpose of VRPSPD is to minimize the total mileage to serve all customers with the limit that each customer is served exactly once, and the vehicle load does not exceed its maximum capacity. Grasshopper Optimization Algorithm (GOA) is an algorithm inspired by nature by mimicking the living behavior of grasshopper swarms in search of food sources. GOA has several main stages, namely initialization of parameters, determination of target grasshoppers, calculating the coefficient of decline, calculating the distance between grasshoppers, and calculating the new position of the grasshoppers. Implementation of the GOA program to complete VRPSPD using the C++ programming language using 3 types of data, data with 13 customers, 22 customers, and 100 customers. Based on the results of the running program, it can be concluded that the more iterations and the number of populations, the solution obtained tends to be better.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信