In this work multiple depot vehicle routing problem is considered in case of variable travel times between nodes on a metropolis network. This variant of the classic multiple depot vehicle routing problem is motivated by the fact that in urban contexts variable traffic conditions play an essential role and can not be ignored in order to perform a realistic optimization. Time-travel matrices corresponding to each period of planning horizon were formed by solving the traffic assignment problem in conjunction with shortest path problem. Routing problem instances include from 20 to 100 customers randomly chosen from a road network of Saint-Petersburg. The results demonstrate that taking into account traffic flow information can reduce route time by 8-37% depending on number of customers in the problem instance.


    Access

    Download


    Export, share and cite



    Title :

    Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment


    Contributors:


    Publication date :

    2018




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Time- Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment

    Mugayskikh, Alexander V. / Zakharov, Victor V. / Tuovinen, Tero | IEEE | 2018


    MULTIPLE DEPOT VEHICLE ROUTING PROBLEM WITH SPLIT DELIVERY

    Pongmanawut, Pitchaya / Likasiri, Chulin | TIBKAT | 2020


    Electric Vehicle Introduction to Moscow Megapolis Economy

    Yu, B. / Marshalkin, G. | British Library Conference Proceedings | 1998



    Megapolis Rhein-Main. ICE-Neubaustrecke

    Böhmer, R. | Tema Archive | 2002