Based on systematically illustrating the current research of dynamic vehicle routing problem and one-off optimization strategies, the paper takes dynamic vehicle routing problem with time window as the study object, proposed a new INTER-SQM dynamic programming strategy to optimize the traffic path of moving vehicle, which highlights the robustness of INTER-SQM strategy, the corresponding ant colony optimization is presented also. Random test compares the operating performance of various optimization strategies in different strong dynamic degrees scenario, discusses the characteristics of the INTER-SQM strategy and points out the research direction of dynamic vehicle routing problem.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dynamic Vehicle Routing Problem and its Algorithm Analysis


    Contributors:

    Published in:

    Advanced Materials Research ; 129-131 ; 1381-1384


    Publication date :

    2010-08-11


    Size :

    4 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Model and algorithm for dynamic and stochastic vehicle routing problem

    Zhang,J. / Wang,W. / Zhao,Y. et al. | Automotive engineering | 2013


    Dynamic-stochastic vehicle routing and inventory problem

    Maqueo, Rodrigo Rubio | DSpace@MIT | 1995

    Free access

    Dynamic Vehicle Routing Problem with Multiple Objectives

    Tang, Hao / Hu, Mingwei | Transportation Research Record | 2005


    Genetic Algorithm for Vehicle Routing Problem with Backhauls

    WA, W.Nurfahizul Ifwah. / Shaiful, M. / Shamsunarnie, M.Z et al. | BASE | 2012

    Free access

    Improved Genetic Algorithm for Capacitated Vehicle Routing Problem

    Ren, C.Y. | British Library Conference Proceedings | 2013