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

Yulio Christopher, Sapti Wahyuningsih, Darmawan Satyananda

Abstract


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.


Full Text:

FULL PDF


DOI: http://dx.doi.org/10.17977/um055v2i1p5-13

Refbacks

  • There are currently no refbacks.


Copyright (c) 2021 Yulio Christopher, Sapti Wahyuningsih, Darmawan Satyananda

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.


Jurnal Kajian Matematika dan Aplikasinya
e-ISSN: 2722-7650

Department of Mathematics, FMIPA, Universitas Negeri Malang
Jalan Semarang 5, Malang,
Gedung O-7 (Matematika)
Homepage: http://journal2.um.ac.id/index.php/jkma
Shortened homepage: bit.ly/jkma_um
E-mail: jkma.journal@um.ac.id