摘要
由已知的航运时刻表,通过程序计算得出飞机在机场停留的最短时间,各起落航班间的最佳配对,完成一个航运时刻表最少可使用的飞机架数,某飞机完成一个飞行周期所需要的天数。程序采用非经典递归的算法,用解答树的剪枝、回溯解决航空班次最佳匹配的指派问题,并给出非递归解法的C语言源程序(即技术上被称作核心机密),以便共同研究、提高。
This article briefly describes how to obtain the shortest staying time in the air port for a plane taking off and landing for each flight.The op timum matched pair on each sched-uled flight ,the minimum number of planes use d for each scheduled flight time chart,and the days need ed for a certain pla ne to complete a flight period.This program uses the non-classical algorithm o f recursion,using the cutting branches,backtracking the solution tree to solve the assignment problem of the op timum scheduled flight.At last,the paper d isplays the Clan guage source program of the non-recursion algo rithm(i.e.'kn ow how 'in the technol-ogy world)in order to research and promote mutually.
出处
《中国民航学院学报》
2002年第6期53-56,共4页
Journal of Civil Aviation University of China
关键词
匹配
指派问题
前序遍历
剪枝回溯
航空班次
assignment problem
preordered traveling
non-recursion
cutting bran ches&back-tracking
