ISSN 0253-2778

CN 34-1054/N

open
Free to Publish. Free to Read.
Open AccessOpen Access JUSTC Original Paper

Genetic algorithm with multiple local searches based on receding horizon control for aircraft arrival sequencing and scheduling

  • 1.

    School of Computer and Information, Anqing Normal University, Anqing 246133, China

  • 2.

    Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China

Cite this:
https://doi.org/10.3969/j.issn.0253-2778.2015.01.012
  • Received Date: 16 May 2014
  • Accepted Date: 10 October 2014
  • Rev Recd Date: 10 October 2014
  • Publish Date: 30 January 2015
    Abstract

  • Abstract

    In order to solve the problem that aircraft arrival scheduling and sequencing(ASS) has difficulty when meeting changes of the aircraft messages in dynamic environments, an optimization model based on receding horizon control(RHC) was proposed for the dynamic ASS problems, and optimized sequence of the aircraft in a horizon was saved as a heuristic message for ASS in the next horizon. Then an RHC-based genetic algorithm (GA) with multiple local searches (RHC-MLSGA) was designed to solve the model, and an initialization strategy for population was given on the basis of the saved optimization message. Due to the the fact that existing GA may easily fall into local peak and that GA with single local search can not obtain remarkable performance in convergence and satisfactory solution, different local searches were employed at different stages in the proposed RHC-MLSGA, among which directed local search adjusts the individual maximum searching speed according to gene structures and fitness of the individual and benchmark individual. A large number of experiments show the validity of the proposed model and algorithm and the stability of the algorithm when solving ASS problems in dynamic environments. Several conclusions about the characteristics of ASS problems have been drawn from results of the experiments as well.

    Abstract

    In order to solve the problem that aircraft arrival scheduling and sequencing(ASS) has difficulty when meeting changes of the aircraft messages in dynamic environments, an optimization model based on receding horizon control(RHC) was proposed for the dynamic ASS problems, and optimized sequence of the aircraft in a horizon was saved as a heuristic message for ASS in the next horizon. Then an RHC-based genetic algorithm (GA) with multiple local searches (RHC-MLSGA) was designed to solve the model, and an initialization strategy for population was given on the basis of the saved optimization message. Due to the the fact that existing GA may easily fall into local peak and that GA with single local search can not obtain remarkable performance in convergence and satisfactory solution, different local searches were employed at different stages in the proposed RHC-MLSGA, among which directed local search adjusts the individual maximum searching speed according to gene structures and fitness of the individual and benchmark individual. A large number of experiments show the validity of the proposed model and algorithm and the stability of the algorithm when solving ASS problems in dynamic environments. Several conclusions about the characteristics of ASS problems have been drawn from results of the experiments as well.
    • FullText(HTML)
  • loading
    • References(11)
  • [1]
    向伟昌. 流媒体服务器性能测评系统的设计与实现[D]. 国防科学技术大学, 2004.
    [2]
    程超. 基于排队论的视频点播系统性能分析[D]. 华中科技大学, 2009.
    [3]
    Xiang Weichang, Peng Yuxing. Design and implementation of a performance evaluation system for stream media servers[J]. Computer Engineering & Science, 2006, 28(5): 45-47.
    向伟昌, 彭宇行. SSMU流媒体服务器性能测评系统的设计与实现[J]. 计算机工程与科学, 2006, 28(5): 45-47.
    [4]
    Coffman Jr E.G., Muntz R.R., Trotter H. Waiting time distributions for processor-sharing systems [J]. Journal of the ACM (JACM), 1970, 17(1): 123-130.
    [5]
    Kleinrock L. Time-shared systems: A theoretical treatment [J]. Journal of the ACM (JACM), 1967, 14(2): 242-261.
    [6]
    Morrison J.A., Response-time distribution for a processor-sharing system [J]. SIAM Journal on Applied Mathematics, 1985, 45(1): 152-167.
    [7]
    Guillemin F, Boyer J. Analysis of the M/M/1 queue with processor sharing via spectral theory [J]. Queueing Systems, 2001, 39(4): 377-397.
    [8]
    Akar N. Moments of Conditional Sojourn Times in Finite Capacity M/M/1/N-PS Processor Sharing Queues [J]. IEEE Communications Letters, 2012, 16(4): 533-535.
    [9]
    Lee W Y, Wang C L. Conditional sojourn times of processor-sharing queues [J]. Probability in the Engineering and Informational Sciences, 2013, 27(01): 99-114.
    [10]
    Knessl C. On finite capacity processor-shared queues [J]. SIAM Journal on Applied Mathematics, 1990, 50(1): 264-287.
    [11]
    Knessl C. On the sojourn time distribution in a finite capacity processor shared queue [J]. Journal of the ACM (JACM), 1993, 40(5): 1 238-1 301.
    • Supplements(0)
    • Related Articles
    • Track Citations
  • 加载中

Catalog

    Get Citation
    PDF
    XML
    [1]
    向伟昌. 流媒体服务器性能测评系统的设计与实现[D]. 国防科学技术大学, 2004.
    [2]
    程超. 基于排队论的视频点播系统性能分析[D]. 华中科技大学, 2009.
    [3]
    Xiang Weichang, Peng Yuxing. Design and implementation of a performance evaluation system for stream media servers[J]. Computer Engineering & Science, 2006, 28(5): 45-47.
    向伟昌, 彭宇行. SSMU流媒体服务器性能测评系统的设计与实现[J]. 计算机工程与科学, 2006, 28(5): 45-47.
    [4]
    Coffman Jr E.G., Muntz R.R., Trotter H. Waiting time distributions for processor-sharing systems [J]. Journal of the ACM (JACM), 1970, 17(1): 123-130.
    [5]
    Kleinrock L. Time-shared systems: A theoretical treatment [J]. Journal of the ACM (JACM), 1967, 14(2): 242-261.
    [6]
    Morrison J.A., Response-time distribution for a processor-sharing system [J]. SIAM Journal on Applied Mathematics, 1985, 45(1): 152-167.
    [7]
    Guillemin F, Boyer J. Analysis of the M/M/1 queue with processor sharing via spectral theory [J]. Queueing Systems, 2001, 39(4): 377-397.
    [8]
    Akar N. Moments of Conditional Sojourn Times in Finite Capacity M/M/1/N-PS Processor Sharing Queues [J]. IEEE Communications Letters, 2012, 16(4): 533-535.
    [9]
    Lee W Y, Wang C L. Conditional sojourn times of processor-sharing queues [J]. Probability in the Engineering and Informational Sciences, 2013, 27(01): 99-114.
    [10]
    Knessl C. On finite capacity processor-shared queues [J]. SIAM Journal on Applied Mathematics, 1990, 50(1): 264-287.
    [11]
    Knessl C. On the sojourn time distribution in a finite capacity processor shared queue [J]. Journal of the ACM (JACM), 1993, 40(5): 1 238-1 301.
    Recommended articles
    TrendMD
    Volume 45 Issue 1 page: 75-86
    Cover

    Article Metrics

    Article views (16) PDF downloads(72)
    Proportional views

    Copyright © Editorial Office of JUSTC, All Rights Reserved. 皖ICP备05002528号

    Supported by: Beijing Renhe Information Technology Co. Ltd    

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return