Penyelesaian Split Delivery VRP dengan Ant Colony Optimization (Studi Kasus: Pengiriman Produk di PT Sinarmas Distribusi Nusantara)

Anita Br Ginting, Reza Fayaqun, M. Bisma
{"title":"Penyelesaian Split Delivery VRP dengan Ant Colony Optimization (Studi Kasus: Pengiriman Produk di PT Sinarmas Distribusi Nusantara)","authors":"Anita Br Ginting, Reza Fayaqun, M. Bisma","doi":"10.31004/jutin.v7i1.24844","DOIUrl":null,"url":null,"abstract":"PT Sinarmar Distribusi distributes its products to all Distribution Center (DC) every day. Currently PT Sinarmas Distribution Nusantara uses a predetermined route every day using Colt Diesel Double vehicles with maximum transport capacity of 500 cartons.   Currently the number of products carried by each vehicle never reaches its maximum carrying capacity. PT Sinarmas Distribusi Nusantara wants vehicle transport capacity to be used optimally. This route problem at PT Sinarmas Distribusi Nusantara can be defined as Split Delivery Vehicle Routing Problem (SDVRP). Ant Colony Optimization (ACO) is a metaheuristic that can be used to solve SDVRP. By using ACO the resulting route is always shorter than the current route and the number of vehicles used is smaller.","PeriodicalId":17759,"journal":{"name":"Jurnal Teknik Industri Terintegrasi","volume":"190 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Teknik Industri Terintegrasi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31004/jutin.v7i1.24844","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

PT Sinarmar Distribusi distributes its products to all Distribution Center (DC) every day. Currently PT Sinarmas Distribution Nusantara uses a predetermined route every day using Colt Diesel Double vehicles with maximum transport capacity of 500 cartons.   Currently the number of products carried by each vehicle never reaches its maximum carrying capacity. PT Sinarmas Distribusi Nusantara wants vehicle transport capacity to be used optimally. This route problem at PT Sinarmas Distribusi Nusantara can be defined as Split Delivery Vehicle Routing Problem (SDVRP). Ant Colony Optimization (ACO) is a metaheuristic that can be used to solve SDVRP. By using ACO the resulting route is always shorter than the current route and the number of vehicles used is smaller.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用蚁群优化解决分批交付 VRP(案例研究:PT Sinarmas Distribusi Nusantara 的产品交付)
PT Sinarmar Distribusi 每天向所有配送中心(DC)配送产品。目前,PT Sinarmas Distribution Nusantara 每天使用 Colt Diesel Double 车辆按照预先确定的路线进行配送,最大运输能力为 500 箱。 目前,每辆车运载的产品数量从未达到其最大运载能力。PT Sinarmas Distribusi Nusantara 希望车辆的运输能力得到最佳利用。PT Sinarmas Distribusi Nusantara 公司的这一路由问题可定义为分批配送车辆路由问题(SDVRP)。蚁群优化(ACO)是一种元探索方法,可用于解决 SDVRP 问题。通过使用蚁群优化算法,得到的路线总是比当前路线短,使用的车辆数量也更少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Analisis SWOT dan Technique For Order Preference by Similarity to Ideal Solution (TOPSIS) untuk Strategi Pengembangan Usaha di Gapit 24 Klasifikasi Menggunakan Metode Random Forest untuk Awal Deteksi Diabetes Melitus Tipe 2 Rancang Ulang Alat Penghalus Rebana untuk Meminimumkan Waktu Proses Penghalusan Analisis Faktor Keterlambatan Penyelesaian Proyek Peningkatan Jalan Ruas Ambemali (Studi Kasus Jln. Belalo/Lasolo – Jln. Arisunggu) Perancangan Penyiraman Kandang Berbasis Arduino Uno Guna Menjaga Stabulitas Suhu dan Kelembapan
×
引用
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