大型车辆问题的粒子群优化与遗传算法——以国家纯牛奶公司为例

T. Prasetyo
{"title":"大型车辆问题的粒子群优化与遗传算法——以国家纯牛奶公司为例","authors":"T. Prasetyo","doi":"10.12962/j24775401.v7i1.8210","DOIUrl":null,"url":null,"abstract":"The number of companies in the industry, as well as the current economic conditions, have created intense competition between companies. One of the important activities of a company is distributing goods from a warehouse to several agents so that the distribution of goods can be done easily and quickly. National Pure Milk Company is based in Salatiga. There are various flavors of pure milk stored in the form of a cup and a pack that will be distributed to each destination. Each cup and pack has data in the form of mass, volume, destination (distance between the destination location and the warehouse location), and the time when it must be dropped. All items of pure milk will be delivered by 4 truck vehicles with different types. Each vehicle has a mass capacity, volume capacity, mileage capacity, trip duration capacity, and trip number capacity. All the data of the pure milk that distributed must not run over the capacity of the vehicle. In this research, Particle Swarm Optimization (PSO) Algorithm can be modified into the discrete PSO Algorithm to determine the shortest distance of the route and Genetic Algorithms can be modified to determine the exact composition of goods on each vehicle. The optimization problem is limited by the condition that each item is delivered at the same time interval.","PeriodicalId":357596,"journal":{"name":"International Journal of Computing Science and Applied Mathematics","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Particle Swarm Optimization and Genetic Algorithm for Big Vehicle Problem: Case Study in National Pure Milk Company\",\"authors\":\"T. Prasetyo\",\"doi\":\"10.12962/j24775401.v7i1.8210\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The number of companies in the industry, as well as the current economic conditions, have created intense competition between companies. One of the important activities of a company is distributing goods from a warehouse to several agents so that the distribution of goods can be done easily and quickly. National Pure Milk Company is based in Salatiga. There are various flavors of pure milk stored in the form of a cup and a pack that will be distributed to each destination. Each cup and pack has data in the form of mass, volume, destination (distance between the destination location and the warehouse location), and the time when it must be dropped. All items of pure milk will be delivered by 4 truck vehicles with different types. Each vehicle has a mass capacity, volume capacity, mileage capacity, trip duration capacity, and trip number capacity. All the data of the pure milk that distributed must not run over the capacity of the vehicle. In this research, Particle Swarm Optimization (PSO) Algorithm can be modified into the discrete PSO Algorithm to determine the shortest distance of the route and Genetic Algorithms can be modified to determine the exact composition of goods on each vehicle. The optimization problem is limited by the condition that each item is delivered at the same time interval.\",\"PeriodicalId\":357596,\"journal\":{\"name\":\"International Journal of Computing Science and Applied Mathematics\",\"volume\":\"89 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-02-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computing Science and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12962/j24775401.v7i1.8210\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computing Science and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12962/j24775401.v7i1.8210","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

该行业的公司数量,以及目前的经济状况,造成了公司之间的激烈竞争。公司的重要活动之一是将货物从仓库分配给几个代理商,以便轻松快速地完成货物分配。国家纯牛奶公司总部设在萨拉蒂加。有各种口味的纯牛奶以杯子和包装的形式储存,将分发到每个目的地。每个杯子和包装都有质量、体积、目的地(目的地位置与仓库位置之间的距离)和必须丢弃的时间等数据。所有的纯牛奶将由4辆不同类型的卡车运送。每辆车都有质量容量、体积容量、里程容量、行程持续时间容量和行程次数容量。所分发的纯牛奶的所有数据不得超过车辆的容量。在本研究中,粒子群优化算法可以修改为离散粒子群优化算法来确定路线的最短距离,遗传算法可以修改为确定每辆车上货物的确切组成。优化问题受限于每件商品在同一时间间隔内送达的条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Particle Swarm Optimization and Genetic Algorithm for Big Vehicle Problem: Case Study in National Pure Milk Company
The number of companies in the industry, as well as the current economic conditions, have created intense competition between companies. One of the important activities of a company is distributing goods from a warehouse to several agents so that the distribution of goods can be done easily and quickly. National Pure Milk Company is based in Salatiga. There are various flavors of pure milk stored in the form of a cup and a pack that will be distributed to each destination. Each cup and pack has data in the form of mass, volume, destination (distance between the destination location and the warehouse location), and the time when it must be dropped. All items of pure milk will be delivered by 4 truck vehicles with different types. Each vehicle has a mass capacity, volume capacity, mileage capacity, trip duration capacity, and trip number capacity. All the data of the pure milk that distributed must not run over the capacity of the vehicle. In this research, Particle Swarm Optimization (PSO) Algorithm can be modified into the discrete PSO Algorithm to determine the shortest distance of the route and Genetic Algorithms can be modified to determine the exact composition of goods on each vehicle. The optimization problem is limited by the condition that each item is delivered at the same time interval.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信