摘要
运用遗传算法解决了飞机调度问题中的航班规划问题。通过对求解变量,即各机型在航线上的航次的整数编码,实现了求解目标在遗传算法中的表达。并且通过利用基于惩罚方式的有效修补策略对染色体的实用性进行修补,减少非法解的出现,使得求解结果符合实际情况。最后通过了广州白云国际机场与其它城市间的航线航班的规划实例,验证了所采用的算法是正确、有效的,具有很强的可扩展性和实用性。
A genetic algorithm to solve the flight planning problem which is also an aircraft scheduling problem is proposed. By coding the problem variables with integer to represent the flight frequency of each type of aircraft on each flight route, the chromosome coding and problem objective definition are implemented. A penalty based effective repair strategy is also proposed to repair the infeasible chromosome, making the solutions more practical. The simulations based on the flight planning instance between Guangzhou and some other cities are carried out. The experimental results demonstrate that the algorithm proposed is correct and effective, with strong scalability and practicality.
出处
《计算机工程与设计》
CSCD
北大核心
2009年第19期4468-4471,4486,共5页
Computer Engineering and Design
基金
国家自然科学基金项目(60573066)
国家自然科学基金-广东省联合基金重点项目(U0835002)
广东省自然科学基金项目(5003346)
教育部留学回国人员科研启动基金项目(教外司留[2006]331)
关键词
飞机调度
航班规划
遗传算法
需求实现
修补策略
aircraft scheduling
flight planning
genetic algorithm
demand implementation
repair strategy