{"title":"飞机队列优化的启发式算法","authors":"E. Kulida, V. Lebedev, N. Egorov","doi":"10.1109/MLSD.2018.8551908","DOIUrl":null,"url":null,"abstract":"This paper considers the heuristic algorithm for the approximate solution of the problem in real-time mode. The proposed algorithm consists of replacing the random search of all possible sequences of landings with a directed search. The Iinear/quadratic programming problem for a given landing sequence is solved to optimize the landing time of planes.","PeriodicalId":158352,"journal":{"name":"2018 Eleventh International Conference \"Management of large-scale system development\" (MLSD","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"The heuristic algorithm for planes queue optimization\",\"authors\":\"E. Kulida, V. Lebedev, N. Egorov\",\"doi\":\"10.1109/MLSD.2018.8551908\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the heuristic algorithm for the approximate solution of the problem in real-time mode. The proposed algorithm consists of replacing the random search of all possible sequences of landings with a directed search. The Iinear/quadratic programming problem for a given landing sequence is solved to optimize the landing time of planes.\",\"PeriodicalId\":158352,\"journal\":{\"name\":\"2018 Eleventh International Conference \\\"Management of large-scale system development\\\" (MLSD\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Eleventh International Conference \\\"Management of large-scale system development\\\" (MLSD\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MLSD.2018.8551908\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Eleventh International Conference \"Management of large-scale system development\" (MLSD","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MLSD.2018.8551908","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The heuristic algorithm for planes queue optimization
This paper considers the heuristic algorithm for the approximate solution of the problem in real-time mode. The proposed algorithm consists of replacing the random search of all possible sequences of landings with a directed search. The Iinear/quadratic programming problem for a given landing sequence is solved to optimize the landing time of planes.