{"title":"优化飞机着陆顺序和时间问题的基因算法","authors":"Н. В. Старостин, М. А. Панкратова","doi":"10.31857/s0005231022030114","DOIUrl":null,"url":null,"abstract":"The article considers a graph mapping problem (in general an NP-hard one) which occurs in the process of running a parallel task on a multiprocessor computing system. We propose a hybrid genetic algorithm to solve the problem.","PeriodicalId":186272,"journal":{"name":"Автоматика и телемеханика","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ГЕНЕТИЧЕСКИЙ АЛГОРИТМ РЕШЕНИЯ ЗАДАЧИ ОПТИМИЗАЦИИ ПОСЛЕДОВАТЕЛЬНОСТИ И ВРЕМЕН ПОСАДОК ВОЗДУШНЫХ СУДОВ\",\"authors\":\"Н. В. Старостин, М. А. Панкратова\",\"doi\":\"10.31857/s0005231022030114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The article considers a graph mapping problem (in general an NP-hard one) which occurs in the process of running a parallel task on a multiprocessor computing system. We propose a hybrid genetic algorithm to solve the problem.\",\"PeriodicalId\":186272,\"journal\":{\"name\":\"Автоматика и телемеханика\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Автоматика и телемеханика\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31857/s0005231022030114\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Автоматика и телемеханика","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31857/s0005231022030114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ГЕНЕТИЧЕСКИЙ АЛГОРИТМ РЕШЕНИЯ ЗАДАЧИ ОПТИМИЗАЦИИ ПОСЛЕДОВАТЕЛЬНОСТИ И ВРЕМЕН ПОСАДОК ВОЗДУШНЫХ СУДОВ
The article considers a graph mapping problem (in general an NP-hard one) which occurs in the process of running a parallel task on a multiprocessor computing system. We propose a hybrid genetic algorithm to solve the problem.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
