应用扫频算法和粒子群优化 (PSO) 作为确定配送路线的替代方法

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}
引用次数: 0

摘要

营销活动的一个方面是分销。在配送货物的过程中,必须确定最优路线,以最大限度地减少里程和降低成本。本研究旨在为确定最短距离的配送路线提供替代解决方案,这对缩短旅行时间和降低成本具有重要意义。本研究采用有容量车辆路由问题(CVRP)模型,通过扫频和粒子群优化(PSO)算法来确定路线。为了生成比较路线,我们使用了近邻(NN)算法。结果是,100 个代理被分为 6 个群组,PSO 生成的路线总距离为 218.115 个单位,是近邻算法生成的路线距离的 85.70%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
审稿时长
7 weeks
期刊最新文献
Perancangan Diagnosa Covid-19 Menggunakan Metode Case Based Reasoning (CBR) Untuk Mengidentifikasi Tingkatan Gejala Pasien Covid-19 Analisis Model Matematika dan Simulasi Pada Penyebaran Hepatitis Non HepA-E Akut di Indonesia Perancangan Sistem Informasi Hino Service on Site (Studi Kasus : Dealer Hino, PT. Persada Lampung Raya) Penerapan Algoritma Sweep dan Particle Swarm Optimization (PSO) sebagai Alternatif Menentukan Rute Distribusi Penerapan Metode Convolution Neural Network (CNN) Dalam Proses Pengolahan Citra Untuk Mendeteksi Cacat Produksi Pada Produk Masker
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1