The airport transportation network structure and its performance are key factors to benefit the local area or national transportation capability and economic development. A method is presented based on the weighted algebraic connectivity to optimize and analyze the network. The indispensability of the weighted adjacent matrix and weighted Laplacian matrix in airport transportation network performance study is emphasized. According to practical operational viability, we formulate the weighted algebraic connectivity application as the flight routes addition/deletion problems. The greedy perturbation heuristic by Ghosh and Boyd is analyzed and extended into the MGP (Modified Greedy Perturbation Algorithm) to provide a local optimum in a fast iterative manner. The unweighted tabu search applying algebraic connectivity to airport transportation network by Vargo and Kincaid is re-designed as the WTS (Weighted Tabu Search) to fit the new weighted flight routes addition/deletion problems, potentially offering a global optimum with much longer running time. The simulation results indicate the trade-off between the MGP and the WTS, with which we can decide the appropriate algorithm to be used for enhancing the performance of an airport transportation network.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Weighted algebraic connectivity: an application to airport transportation network


    Contributors:
    Wei, Peng (author) / Sun, Dengfeng (author)


    Publication date :

    2011


    Size :

    6 Seiten, 6 Bilder, 15 Quellen




    Type of media :

    Conference paper


    Type of material :

    Storage medium


    Language :

    English