{"title":"基于极限优化的单跑道飞机动态着陆问题求解","authors":"I. Moser, T. Hendtlass","doi":"10.1109/SCIS.2007.367691","DOIUrl":null,"url":null,"abstract":"A dynamic implementation of the single-runway aircraft landing problem was chosen for experiments designed to investigate the adaptive capabilities of extremal optimisation. As part of the problem space is unimodal, we developed a deterministic algorithm which optimises the time lines of the permutations found by the EO solver. To assess our results, we experimented on known problem instances for which benchmark solutions exist. The nature and difficulty of the instances used were assessed to discuss the quality of results obtained by the solver. Compared to the benchmark results available, our approach was highly competitive","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Solving Dynamic Single-Runway Aircraft Landing Problems With Extremal Optimisation\",\"authors\":\"I. Moser, T. Hendtlass\",\"doi\":\"10.1109/SCIS.2007.367691\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A dynamic implementation of the single-runway aircraft landing problem was chosen for experiments designed to investigate the adaptive capabilities of extremal optimisation. As part of the problem space is unimodal, we developed a deterministic algorithm which optimises the time lines of the permutations found by the EO solver. To assess our results, we experimented on known problem instances for which benchmark solutions exist. The nature and difficulty of the instances used were assessed to discuss the quality of results obtained by the solver. Compared to the benchmark results available, our approach was highly competitive\",\"PeriodicalId\":184726,\"journal\":{\"name\":\"2007 IEEE Symposium on Computational Intelligence in Scheduling\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Symposium on Computational Intelligence in Scheduling\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCIS.2007.367691\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Symposium on Computational Intelligence in Scheduling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCIS.2007.367691","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving Dynamic Single-Runway Aircraft Landing Problems With Extremal Optimisation
A dynamic implementation of the single-runway aircraft landing problem was chosen for experiments designed to investigate the adaptive capabilities of extremal optimisation. As part of the problem space is unimodal, we developed a deterministic algorithm which optimises the time lines of the permutations found by the EO solver. To assess our results, we experimented on known problem instances for which benchmark solutions exist. The nature and difficulty of the instances used were assessed to discuss the quality of results obtained by the solver. Compared to the benchmark results available, our approach was highly competitive
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
