Customized crossover in evolutionary sets of safe ship trajectories

R. Szlapczynski, J. Szlapczynska
{"title":"Customized crossover in evolutionary sets of safe ship trajectories","authors":"R. Szlapczynski, J. Szlapczynska","doi":"10.2478/v10006-012-0074-x","DOIUrl":null,"url":null,"abstract":"The paper presents selected aspects of evolutionary sets of safe ship trajectories-a method which applies evolutionary algorithms and some of the assumptions of game theory to solving ship encounter situations. For given positions and motion parameters of the ships, the method finds a near optimal set of safe trajectories of all ships involved in an encounter. The method works in real time and the solutions must be returned within one minute, which enforces speeding up the optimisation process. During the development of the method the authors tested various problem-dedicated crossover operators to obtain the best performance. The results of that research are given here. The paper includes a detailed description of these operators as well as statistical simulation results and examples of experiment results","PeriodicalId":253470,"journal":{"name":"International Journal of Applied Mathematics and Computer Sciences","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Applied Mathematics and Computer Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/v10006-012-0074-x","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 27

Abstract

The paper presents selected aspects of evolutionary sets of safe ship trajectories-a method which applies evolutionary algorithms and some of the assumptions of game theory to solving ship encounter situations. For given positions and motion parameters of the ships, the method finds a near optimal set of safe trajectories of all ships involved in an encounter. The method works in real time and the solutions must be returned within one minute, which enforces speeding up the optimisation process. During the development of the method the authors tested various problem-dedicated crossover operators to obtain the best performance. The results of that research are given here. The paper includes a detailed description of these operators as well as statistical simulation results and examples of experiment results
安全船舶轨迹演化集中的自定义交叉
本文提出了安全船舶轨迹进化集的若干方面,这是一种应用进化算法和博弈论的一些假设来解决船舶相遇情况的方法。该方法在给定船舶位置和运动参数的情况下,求出一组接近最优的船舶安全轨迹集。该方法实时工作,解决方案必须在一分钟内返回,这加强了优化过程的加速。在该方法的开发过程中,作者测试了各种问题专用的交叉算子以获得最佳性能。这项研究的结果在这里给出。文中对这些算子进行了详细的描述,并给出了统计仿真结果和实验实例
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信