GHP时隙分配问题的组合拍卖竞胜标模型与算法  

Combinatorial Auction Winner Determination Model and Algorithm in GHP Slot Allocation Problem

作　　者：王飞[1,2] 徐肖豪[1] 张静[2] 陈凯[1] 

机构地区：[1]中国民航大学空管基地,天津300300 [2]南京航空航天大学民航学院,江苏南京210016

出　　处：《系统工程》2010年第2期30-35,共6页Systems Engineering

基　　金：国家高技术研究发展计划资助项目(2006AA12A105);中央高校基本科研业务费专项资助项目(ZXH2009C005);天津市科技支撑计划资助项目(08ZCKFGX04100)

摘　　要：为了公平和有效地分配机场时隙资源,针对2-2的时隙交易问题,以第一价格密封拍卖方式为背景,建立时隙组合拍卖的竞胜标模型,设计人工鱼群算法求解模型,并进行算例分析。算例分析结果表明模型与算法是可行的。In order to allocate airports slots fairly and efficiently,auction theory is used to analyze 2-2 slots trading in re-allocation process against the background of the sealed first-price auction.First,combinatorial auction of winner determination model is presented.Then artificial fish school algorithm is designed and applied to solve this model.Finally,a simulation is carried out.The simulation results indicate that the model and algorithm are feasible.

关 键 词：空中交通管理 时隙分配 组合拍卖 人工鱼群算法 

分 类 号：V355[航空宇航科学与技术—人机与环境工程]