Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP) is a variant of Vehicle Routing Problem (VRP). VRPSDP has special constraints, namely requests and returns are carried out simultaneously. In this article we will use the Variable Neighborhood Descent (VND) algorithm to solve VRPSDP problems. There are two steps taken to use the VND algorithm on VRPSDP, namely finding an initial solution with the Insertion Heuristic algorithm and improving the position of the customer by using the neighborhood operator on the VND algorithm. The implementation of the VND algorithm on VRPSDP has been successfully made using the Borland Delphi 7.0 programming language. Inputs contained in the program are point position, distance between points, customer requests and returns and vehicle capacity. The output contained in the program in the form of routes that have been completed using an algorithm and output in the form of images of the final solution that has been obtained. Based on the results obtained, an example with 6 customers produces 3 routes with a total distance of 266 km, while an example with 10 customers produces 4 routes with a total distance of 100 km.


    Access

    Download


    Export, share and cite



    Title :

    ALGORITMA VARIABLE NEIGHBORHOOD DESCENT (VND) PADA VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICKUP (VRPSDP) DAN IMPLEMENTASINYA



    Publication date :

    2021-01-27


    Remarks:

    doi:10.17977/um055v2i1p5-13
    Jurnal Kajian Matematika dan Aplikasinya (JKMA); Vol 2, No 1 (2021): January; 5-13 ; 2722-7650



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English


    Classification :

    DDC:    629




    ALGORITMA GENERAL VARIABLE NEIGHBORHOOD SEARCH PADA CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS DAN IMPLEMENTASINYA

    Fadila, Ulil Ilmi / Wahyuningsih, Sapti / Satyananda, Darmawan | BASE | 2022

    Free access

    STUDI ALGORITMA IGVNS, ALGORITMA GVNS, DAN ALGORITMA ABC PADA MULTIPLE TRIP VEHICLE ROUTING PROBLEM (MTVRP)

    Aini, Nurul Faridhatul / Kusumasari, Vita / Rahmadani, Desi | BASE | 2021

    Free access

    Penerapan Algoritma Kunang-Kunang pada Open Vehicle Routing Problem (OVRP)

    Septiyafi, Ihda / Suprajitno, Herry / Pratiwi, Asri Bekti | BASE | 2019

    Free access


    A Variable Neighborhood Descent Method for Cooperative Delivery Routing Problem of Trucks and Drones

    Mao, Ni / Wu, Guohua / Luo, Qizhang et al. | Springer Verlag | 2022