This study focuses on solving the vehicle routing problem (VRP) of E-logistics service providers. In our problem, each vehicle must visit some pick up nodes first, for instance, warehouses to pick up the orders then makes deliveries for customers in the list. Each pickup node has its own list of more than one customers requiring delivery. The objective is to minimize the total travelling cost while real-world application constraints, such as heterogeneous vehicles, capacity limits, time window, driver working duration, etc. are still considered. This research firstly proposes a mathematical model for this multiple pickup and multiple delivery vehicle routing problem with time window and heterogeneous fleets (MPMDVRPTWHF). In the next step, the ant colony optimization algorithm is studied to solve the problem in the large-scale.


    Access

    Download


    Export, share and cite



    Title :

    Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets


    Contributors:


    Publication date :

    2021




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    Heterogeneous Fleets for Green Vehicle Routing Problem With Traffic Restrictions

    Wang, Heng / Li, Menghan / Wang, Zhenyu et al. | IEEE | 2023



    MILP Model for a Generalized Capacitated Vehicle Routing Problem with Multiple Depots and Multiple Pickup and Delivery Requests

    Sierra, Marta / Casanova, María / García-Sánchez, Álvaro et al. | Springer Verlag | 2024


    An Electric Vehicle Routing Problem with Pickup and Delivery

    Yang, Qian-qian / Hu, Da-wei / Chu, Hong-fan et al. | ASCE | 2018