基于遗传算法的海上作战突击部队海上补给调度模型

R ArisTriIka, Benny Sukandari, O. S. Suharyo, A. Prabowo
{"title":"基于遗传算法的海上作战突击部队海上补给调度模型","authors":"R ArisTriIka, Benny Sukandari, O. S. Suharyo, A. Prabowo","doi":"10.37875/asro.v10i2.111","DOIUrl":null,"url":null,"abstract":"Navy as a marine core in the defense force is responsible for providing security for realizing stability and security of the country.  At any time there was an invasion of other countries past through sea,  TNI AL must be able to break the enemy resistance line through a sea operation to obtain the sea superiority. But this time the endurance of Striking force Unit at only 7-10 days and required replenishment at sea to maximize the presence in the theater of operations to meet a demand of the logistics: HSD, Freshwater, Lubricating Oil, foodstuffs and amonisi. For the optimal replenishment at sea required scheduling model supporting unit to get the minimum time striking force unit was on node rendezvous. Replenishment at sea scheduling model for striking force unit refers to the problems Vehicle routing problem with time windows using Genetic Algorithms. These wheelbase used is roulette for reproduction, crossover, and mutation of genes. Genetic algorithms have obtained optimum results in the shortest route provisioning scenario uses one supporting unit with a total time of 6.89 days. In scenario two supporting unit with minimal time is 4.97 days. In the scenario, the changing of the node replenishment Genetic Algorithm also get optimal time is 4.97 days with two supporting units. Research continued by changing the parameters of the population, the probability of crossover and mutation that can affect the performance of the genetic algorithm to obtain the solution. \nKeywords: Genetic Algorithm, Model Scheduling, Striking Force unit","PeriodicalId":356564,"journal":{"name":"JOURNAL ASRO","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SCHEDULLING MODEL OF REPLENISHMENT AT SEA FOR STRICKING FORCE UNIT IN SEA OPERATION USING GENETIC ALGORITHM\",\"authors\":\"R ArisTriIka, Benny Sukandari, O. S. Suharyo, A. Prabowo\",\"doi\":\"10.37875/asro.v10i2.111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Navy as a marine core in the defense force is responsible for providing security for realizing stability and security of the country.  At any time there was an invasion of other countries past through sea,  TNI AL must be able to break the enemy resistance line through a sea operation to obtain the sea superiority. But this time the endurance of Striking force Unit at only 7-10 days and required replenishment at sea to maximize the presence in the theater of operations to meet a demand of the logistics: HSD, Freshwater, Lubricating Oil, foodstuffs and amonisi. For the optimal replenishment at sea required scheduling model supporting unit to get the minimum time striking force unit was on node rendezvous. Replenishment at sea scheduling model for striking force unit refers to the problems Vehicle routing problem with time windows using Genetic Algorithms. These wheelbase used is roulette for reproduction, crossover, and mutation of genes. Genetic algorithms have obtained optimum results in the shortest route provisioning scenario uses one supporting unit with a total time of 6.89 days. In scenario two supporting unit with minimal time is 4.97 days. In the scenario, the changing of the node replenishment Genetic Algorithm also get optimal time is 4.97 days with two supporting units. Research continued by changing the parameters of the population, the probability of crossover and mutation that can affect the performance of the genetic algorithm to obtain the solution. \\nKeywords: Genetic Algorithm, Model Scheduling, Striking Force unit\",\"PeriodicalId\":356564,\"journal\":{\"name\":\"JOURNAL ASRO\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JOURNAL ASRO\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37875/asro.v10i2.111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOURNAL ASRO","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37875/asro.v10i2.111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

海军作为国防力量中的海洋核心力量,肩负着实现国家稳定安全的安全保障任务。在任何时候有其他国家经过海上入侵,TNI AL必须能够通过海上作战突破敌人的抵抗线,获得海上优势。但这一次,突击部队的续航力只有7-10天,并且需要在海上进行补给,以最大限度地满足战区的后勤需求:HSD,淡水,润滑油,食品和amonisi。对于最优海上补给需求调度模型,支持单位在节点集合上的时间最短。打击部队海上补给调度模型是利用遗传算法求解具有时间窗的车辆路线问题。这些轴距是用来复制、交叉和基因突变的轮盘赌。遗传算法在使用一个支持单元的最短路由发放场景下获得了最优结果,总时间为6.89天。场景二支持单元最小时间为4.97天。在该场景下,节点补货遗传算法的变化也得到最优时间为4.97天,有两个支持单位。继续研究通过改变种群的参数、交叉和变异的概率等能够影响遗传算法性能的因素来获得解。关键词:遗传算法,模型调度,突击部队
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SCHEDULLING MODEL OF REPLENISHMENT AT SEA FOR STRICKING FORCE UNIT IN SEA OPERATION USING GENETIC ALGORITHM
Navy as a marine core in the defense force is responsible for providing security for realizing stability and security of the country.  At any time there was an invasion of other countries past through sea,  TNI AL must be able to break the enemy resistance line through a sea operation to obtain the sea superiority. But this time the endurance of Striking force Unit at only 7-10 days and required replenishment at sea to maximize the presence in the theater of operations to meet a demand of the logistics: HSD, Freshwater, Lubricating Oil, foodstuffs and amonisi. For the optimal replenishment at sea required scheduling model supporting unit to get the minimum time striking force unit was on node rendezvous. Replenishment at sea scheduling model for striking force unit refers to the problems Vehicle routing problem with time windows using Genetic Algorithms. These wheelbase used is roulette for reproduction, crossover, and mutation of genes. Genetic algorithms have obtained optimum results in the shortest route provisioning scenario uses one supporting unit with a total time of 6.89 days. In scenario two supporting unit with minimal time is 4.97 days. In the scenario, the changing of the node replenishment Genetic Algorithm also get optimal time is 4.97 days with two supporting units. Research continued by changing the parameters of the population, the probability of crossover and mutation that can affect the performance of the genetic algorithm to obtain the solution. Keywords: Genetic Algorithm, Model Scheduling, Striking Force unit
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信