检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]蚌埠汽车士官学校运输勤务系,安徽蚌埠233011 [2]空军工程大学航空管制系,北京100166 [3]95172部队,长沙410115
出 处:《军事交通学院学报》2013年第1期29-33,共5页Journal of Military Transportation University
摘 要:为减少终端区飞机延误成本,在保证安全和遵循各种规定的前提下,以航班延误总成本最少为目标,建立了终端区飞机排序优化的数学模型。提出一种基于飞机序号的实数编码方法的改进遗传算法,并辅以自适应选择、循环交叉、插入变异,对问题进行求解。通过仿真实验,与FCFS算法相比,延误总成本明显减少。比较结果表明,改进遗传算法操作简便,适于大规模的终端区飞机排序优化问题求解。In order to reduce delay cost of aircrafts in terminal area, safety and related provisions were taken into consid-eration ; a mathematical model was developed with the aim of minimizing the total delay cost of all aircrafts. An improved genetic algorithm was proposed with real number coding based on aircraft queue, and self-adaptive selection, loop cross- over and insert mutation were introduced to solve the problem. By simulation calculation, compared with FCFS method, the proposed algorithm can effectively reduced total costs. The comparison shows that the proposed algorithm was easy to operate and produced a better result compared with other methods mentioned above.
分 类 号:O224[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249