In this paper, we consider the time-dependent multi-depot vehicle routing problem. The objective is to minimize the total heterogeneous fleet cost assuming that the travel time between locations depends on the departure time. Also, hard time window constraints for the customers and limitation on maximum number of the vehicles in depots must be satisfied. The problem is formulated as a mixed integer programming model. A constructive heuristic procedure is proposed for the problem. Also, the efficiency of the proposed algorithm is evaluated on 180 test problems. The obtained computational results indicate that the procedure is capable to obtain a satisfying solution.


    Access

    Download


    Export, share and cite



    Title :

    A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet


    Contributors:


    Publication date :

    2017




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows

    Dell Amico, M. / Monaci, M. / Pagani, C. et al. | British Library Online Contents | 2007


    Optimasi Rute Pengiriman dengan Heterogeneous Fleet Vehicle Routing Problem with Time Windows

    Hendrawan, Edwin / Widyadana, I Gede Agus | BASE | 2018

    Free access


    Vehicle Routing Problem with Multi Depot, Heterogeneous Fleet, and Multi Period: A Real Case Study

    Karadeniz, Barış / Erdogan, Mehmet Serdar / Kazançoğlu, Yiğit | TIBKAT | 2022


    Vehicle Routing Problem with Multi Depot, Heterogeneous Fleet, and Multi Period: A Real Case Study

    Karadeniz, Barış / Erdogan, Mehmet Serdar / Kazançoğlu, Yiğit | Springer Verlag | 2021