Providing a satisfying delivery service is an important way to maintain the customers’ loyalty and further expand profits for manufacturers and logistics providers. Considering customers’ preferences for time windows, a bi-objective time window assignment vehicle routing problem has been introduced to maximize the total customers’ satisfaction level for assigned time windows and minimize the expected delivery cost. The paper designs a hybrid multi-objective genetic algorithm for the problem that incorporates modified stochastic nearest neighbour and insertion-based local search. Computational results show the positive effect of the hybridization and satisfactory performance of the metaheuristics. Moreover, the impacts of three characteristics are analysed including customer distribution, the number of preferred time windows per customer and customers’ preference type for time windows. Finally, one of its extended problems, the bi-objective time window assignment vehicle routing problem with time-dependent travel times has been primarily studied.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    A Hybrid Multi-objective Genetic Algorithm for Bi-objective Time Window Assignment Vehicle Routing Problem


    Beteiligte:
    Manman Li (Autor:in) / Jian Lu (Autor:in) / Wenxin Ma (Autor:in)


    Erscheinungsdatum :

    2019




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt





    A Hybrid Algorithm for the Multi-Objective Time Dependent Vehicle Routing Problem

    Sun, Y. / Chen, Y. / Pan, C.C. et al. | British Library Conference Proceedings | 2014


    Optimization of Vehicle Routing Problem Based on Multi-Objective Genetic Algorithm

    Zhong, R. / Wu, J.P. / Du, Y.M. | British Library Conference Proceedings | 2013


    The Time Window Assignment Vehicle Routing Problem

    Spliet, Remy / Gabor, Adriana F. | British Library Online Contents | 2015


    The Time Window Assignment Vehicle Routing Problem

    Spliet, Remy | Online Contents | 2014