The Pickup and Delivery Problems (PDP) represent an important class of Vehicle Routing Problems (VRP) in which goods must be collected and distributed. In this paper, we propose an approach which is based on the combination of Genetic Algorithm (GA) with the clustering algorithm for the optimization of multi-vehicles, multi-depots, pickup and delivery problem (m-MDPDP). The main contribution is to find new depot locations in order to obtain feasible solution (routes) for the m-MDPDPTW. These routes satisfy transportation requests without contravening any of the instance specific constraints.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Insertion of new depot locations for the optimization of multi-vehicles multi-depots pickup and Delivery Problems using Genetic Algorithm


    Contributors:


    Publication date :

    2015-10-01


    Size :

    288905 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Optimization of DND Multi-Depot Split-Load Pickup-Delivery Problem

    Boukhtouta Abdeslem / Ray Sujoy / Soeanu Andrei et al. | DOAJ | 2019

    Free access

    Multi-Depot Pickup and Delivery Problem with Resource Sharing

    Yong Wang / Lingyu Ran / Xiangyang Guan et al. | DOAJ | 2021

    Free access

    A Multi-objective Optimization for Efficient Pickup and Delivery Problems: Addressing Alternative Locations and Time Windows

    Boonmalert, Chinchet / Boonperm, Aua-aree / Sintunavarat, Wutiphol | Springer Verlag | 2025


    A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations

    Parragh, Soophie N. / Doerner, Karl F. / Hartl, Richard F. | Tema Archive | 2008