首页 | 本学科首页   官方微博 | 高级检索  
     检索      

应用模拟退火算法求解飞机调度问题
引用本文:孙宏,张翔,徐杰.应用模拟退火算法求解飞机调度问题[J].飞行力学,2006,24(4):84-87.
作者姓名:孙宏  张翔  徐杰
作者单位:1. 中国民航飞行学院,民航飞行技术与飞行安全科研基地,四川,广汉,618307
2. 北京交通大学,轨道交通控制与安全国家重点实验室,北京,100044
摘    要:通过分析飞机运行的时区集合特点,将飞机调度问题转化为固定工件排序问题。根据工件占用机器的时间区间,利用划分时间片算法把需要平行作业的工件挑选出来组成无向图的相邻顶点,从而将固定工件问题转化为图的k-顶点着色问题,然后建立0-1整数规划数学模型,并设计出相应的模拟退火算法。最后应用该算法针对飞机调度问题进行了仿真研究,结果表明:在可接受的时间内能够得到该问题的满意解。

关 键 词:飞机调度  k-顶点着色  0-1整数规划  模拟退火
文章编号:1002-0853(2006)04-0084-04
收稿时间:2006-03-22
修稿时间:2006-08-07

Applying the Simulated Annealing Algorithm to Solve Airliner Aircraft Dispatching Problem
SUN Hong,ZHANG Xiang,XU Jie.Applying the Simulated Annealing Algorithm to Solve Airliner Aircraft Dispatching Problem[J].Flight Dynamics,2006,24(4):84-87.
Authors:SUN Hong  ZHANG Xiang  XU Jie
Institution:1. CAAC Scientific Research Base of Civil Aviation Flight Technology and Safety, Civil Aviation Flying University of China, Guanghan 618307, China ;2. State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, China
Abstract:In order to solve airline aircraft dispatching problem which is NPC problem,time intervals which aircraft processes are analyzed.According to the method of making out time intervals,jobs,which are being done at the same time,are chosen to compose various sets whose elements cannot be processed by same machine.And the elements are considered as adjoining vertexes,the fixed job scheduling problem is transformed to a k-vertex coloring problem.Then,a 0-1 integer programming mathematical model is built and the simulated annealing algorithm is applied to solve the model.At last,the instance illuminates the model and algorithm are to be feasible.
Keywords:airline aircraft dispatching problem  k-vertex color  0-1 integer programming  simulated annealing algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号