The directing of an armada of vehicles to benefit an arrangement of clients is imperative in the field of merchandise dispersion. Vehicle directing issue with time windows (VRPTW) is a notable combinatorial issue. This article goes for concentrate the vehicle steering issue with time windows and target time (VRPTWTT). VRPTWTT includes the directing of an arrangement of vehicles with restricted limit from a focal station to an arrangement of topographically scattered clients with referred to requests and predefined time windows and also an objective time. There are punishments related with adjusting either before or later than this objective overhauling time. The objective is to limit the expenses of transport and punishments of deferral and early, we introduce a portrayal of the half and half strategy took after by computational outcomes and the conclusion.


    Access

    Download


    Export, share and cite



    Title :

    A REVIEW OF MEMETIC ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS


    Contributors:

    Publication date :

    2018-07-16


    Remarks:

    doi:10.26483/ijarcs.v9i0.6127
    International Journal of Advanced Research in Computer Science; 2018: Volume 9 Special Issue No. 2, April 2018; 5-8 ; 0976-5697 ; 10.26483/ijarcs.v9i0



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    A memetic algorithm for the open capacitated arc routing problem

    Fung, Richard Y.K. | Online Contents | 2013


    A memetic algorithm for the open capacitated arc routing problem

    Fung, Richard Y.K. / Liu, Ran / Jiang, Zhibin | Elsevier | 2012


    Memetic algorithm with adaptive local search for Capacitated Arc Routing Problem

    Yao, Tingting / Yao, Xin / Han, Shuangshuang et al. | IEEE | 2017



    Split-Delivery Capacitated Arc-Routing Problem With Time Windows

    Lai, Qidong / Zhang, Zizhen / Yu, Mingzhu et al. | IEEE | 2022