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

Ulil Ilmi Fadila, Sapti Wahyuningsih, Darmawan Satyananda

Abstract


The Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) is one of the variants of the Vehicle Routing Problem (VRP), which is the problem of determining the optimal route from the depot to the consumer which is located spread out with different requests. In CVRPTW problem solving considers capacity and time constraints. Determining the optimal route can reduce costs and energy spent during the distribution process. The General Variable Neighborhood Search (GVNS) algorithm can be applied to the CVRPTW problem. The GVNS algorithm is an improvement on the VNS algorithm using RVND. The GVNS algorithm starts with finding the initial solution, continues with perturbation, and then the repair procedure is carried out. Perturbation and improvements to the GVNS algorithm are performed repeatedly according to the predetermined IterMax. The GVNS algorithm for CVRPTW will be implemented using the Borland Delphi 7.0 programming language. The product in the form of this application can be used more practically to solve CVRPTW problems using the GVNS algorithm.

Keywords: Capacitated Vehicle Routing Problem with Time Windows (CVRPTW), General Variable Neighborhood Search (GVNS) Algorithm, Randomized Variable Neighborhood Descent (RVND)


Full Text:

FULL PDF


DOI: http://dx.doi.org/10.17977/um055v3i1p1-7

Refbacks

  • There are currently no refbacks.


Copyright (c) 2022 Sapti Wahyuningsih

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

View My Stats