In this paper, a variable neighborhood search metaheuristic is enriched with a multi start technique and an adaptive taboo memory: the SVNS metaheuristic. In the proposed SVNS method, the diversification phase is ameliorated by launching the VNS metaheuristic in multi start technique and by archiving each blocked solution in taboo memory with a three different shames. This taboo memory governs the selection move for the neighborhood. The selection is performed in the neighborhood of each current solution. The SVNS metaheuristic is used to optimize the multiple runways aircraft landing problem. Computational experiments in several problems collected from the literature, instances from OR-Library, demonstrate that the proposed SVNS metaheuristic reaches high-quality solutions using very few user-defined parameters: the Kruskal-Wallis statistic test is used to prove that.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A multi Start adaptive Variable Neighborhood Search metaheuristic for the aircraft landing problem


    Contributors:
    Dhouib, S. (author)


    Publication date :

    2011-05-01


    Size :

    1185589 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones

    Sacramento, David / Pisinger, David / Røpke, Stefan | BASE | 2019

    Free access

    The Railway Network Design, Line Planning and Capacity Problem: An Adaptive Large Neighborhood Search Metaheuristic

    Canca, David / De-Los-Santos, Alicia / Laporte, Gilbert et al. | Springer Verlag | 2017


    A variable neighborhood search for optimal scheduling and routing of take-off and landing aircraft

    Sama, Marcella / D'Ariano, Andrea / Toli, Alessandro et al. | IEEE | 2015



    Variable Neighborhood Search for a Colored Traveling Salesman Problem

    Meng, Xianghu / Li, Jun / Dai, Xianzhong et al. | IEEE | 2018