{"title":"利用蚁群优化解决分批交付 VRP（案例研究：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":"{\"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}","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}
Penyelesaian Split Delivery VRP dengan Ant Colony Optimization (Studi Kasus: Pengiriman Produk di PT Sinarmas Distribusi Nusantara)
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
