首页> 外文OA文献 >Uçak İniş Probleminin Çizelgelenmesinde Bulanık Küme Temelli Bir Genetik Algoritma Yaklaşımı
【2h】

Uçak İniş Probleminin Çizelgelenmesinde Bulanık Küme Temelli Bir Genetik Algoritma Yaklaşımı

机译:飞机着陆问题图表中的基于模糊的基于聚类的遗传算法方法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Aircraft LandingScheduling (ALS) problem is one of the most important part of both aviation andair traffic control. The main objective of the problem is determining thelanding time of the aircrafts with minimizing the penalty cost under someconstraints. Each aircraft has an optimum target landing time based on theirspecialties related with fuel, airspeed and cost. Deviations from landing timetargets increase the penalty cost of both the aircraft and the problem. In thispaper, a fuzzy cluster based genetic algorithm approach is given for thesolutions of ALS problems. An ALS benchmark, which contains up to 500 aircraftsand five runways, was obtained from OR–library to execute and evaluate thealgorithm. Computational results of the proposed algorithm are given in detailand compared with the best results in the literature. The algorithm resultsshow that it is very competitive and have good results when applied to theregarding problem.
机译:飞机Landingscheduling(ALS)问题是航空和航空交通管制的最重要部分之一。问题的主要目的是确定飞机的Thelanding时间,以最大限度地减少单数会的罚款。每个飞机都有一个基于与燃料,空速和成本相关的它们的最佳目标着陆时间。降落时间表的偏差增加了飞机和问题的罚款。在此纸纸中,给出了一种基于模糊的基于群集的遗传算法方法,用于ALS问题的曲线。含有多达500个飞行器和五条跑道的ALS基准,从或者进行,以执行和评估Thealgorithm。拟议算法的计算结果在详细的情况下给出,与文献中的最佳结果相比给出。算法结果表明它是非常有竞争力的,并且在申请在原始问题时具有良好的结果。

著录项

  • 作者

    Yakup ÇELİKBİLEK;

  • 作者单位
  • 年度 2018
  • 总页数
  • 原文格式 PDF
  • 正文语种 deu/ger;eng;fra/fre;rus;tur
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号