I. Fauzi, Imaniah Bazlina Wardani, Indra Lukmana Putra, Peni Puspitasari
{"title":"应用扫频算法和粒子群优化 (PSO) 作为确定配送路线的替代方法","authors":"I. Fauzi, Imaniah Bazlina Wardani, Indra Lukmana Putra, Peni Puspitasari","doi":"10.30998/faktorexacta.v16i4.18962","DOIUrl":null,"url":null,"abstract":"One aspect of marketing activities is distribution. In the process of distributing goods, it is important to determine the optimal route that minimize mileage and reduce costs. This study aims to provide alternative solutions in determining distribution routes with the shortest distance which has implications for shorter travel times and lower costs. This research adapts the Capacitated Vehicle Routing Problem (CVRP) model with the approach of sweep and Particle Swarm Optimization (PSO) algorithm to determine the route. To generate a comparison route, we use the Nearest Neighbor (NN) algorithm. The result was that 100 agents were divided into 6 clusters and the total distance of the PSO-generated route is 218.115 units or 85.70% of the route distance generated by Nearest Neighbor algorithm.","PeriodicalId":53004,"journal":{"name":"Faktor Exacta","volume":"41 3","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Penerapan Algoritma Sweep dan Particle Swarm Optimization (PSO) sebagai Alternatif Menentukan Rute Distribusi\",\"authors\":\"I. Fauzi, Imaniah Bazlina Wardani, Indra Lukmana Putra, Peni Puspitasari\",\"doi\":\"10.30998/faktorexacta.v16i4.18962\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One aspect of marketing activities is distribution. In the process of distributing goods, it is important to determine the optimal route that minimize mileage and reduce costs. This study aims to provide alternative solutions in determining distribution routes with the shortest distance which has implications for shorter travel times and lower costs. This research adapts the Capacitated Vehicle Routing Problem (CVRP) model with the approach of sweep and Particle Swarm Optimization (PSO) algorithm to determine the route. To generate a comparison route, we use the Nearest Neighbor (NN) algorithm. The result was that 100 agents were divided into 6 clusters and the total distance of the PSO-generated route is 218.115 units or 85.70% of the route distance generated by Nearest Neighbor algorithm.\",\"PeriodicalId\":53004,\"journal\":{\"name\":\"Faktor Exacta\",\"volume\":\"41 3\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Faktor Exacta\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.30998/faktorexacta.v16i4.18962\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Faktor Exacta","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30998/faktorexacta.v16i4.18962","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Penerapan Algoritma Sweep dan Particle Swarm Optimization (PSO) sebagai Alternatif Menentukan Rute Distribusi
One aspect of marketing activities is distribution. In the process of distributing goods, it is important to determine the optimal route that minimize mileage and reduce costs. This study aims to provide alternative solutions in determining distribution routes with the shortest distance which has implications for shorter travel times and lower costs. This research adapts the Capacitated Vehicle Routing Problem (CVRP) model with the approach of sweep and Particle Swarm Optimization (PSO) algorithm to determine the route. To generate a comparison route, we use the Nearest Neighbor (NN) algorithm. The result was that 100 agents were divided into 6 clusters and the total distance of the PSO-generated route is 218.115 units or 85.70% of the route distance generated by Nearest Neighbor algorithm.