Author:
Satyananda D,Wahyuningsih S
Abstract
Abstract
Vehicle Routing Problem (VRP) has an important role in logistics distribution from the depot to the customer, to get the minimum cost delivery route. To get optimal results, it is necessary to improve route from the initial solution. Variable Neighbourhood Descent (VND) is one of the metaheuristics that examine of a number of neighbourhood operators to get the optimal route. A VRP route is called optimal if there are no other routes that can be generated from all the neighbourhood operators used in VND. This article describes the application of VND to get the optimal route on CVRP, MDVRP, and VRPTW. The results of the experiment on some test data used indicate that VND can be used to get more optimal length and travel time route.
Subject
General Physics and Astronomy
Reference21 articles.
1. Vehicle routing: historical perspective and recent contributions;Laporte;EURO J Transp Logist,2013
2. Implementations of TSP-VRP variants for distribution problem;Wahyuningsih;Glob J Pure Appl Math,2016
3. Variable neighborhood descent for solving the vehicle routing problem with time windows;Harzi;Electron Notes Discret Math,2017
4. A Variable Neighborhood Search Approach for Solving the Generalized Vehicle Routing Problem;Pop,2014
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimization of channel distribution for capacitated vehicle routing problem (CVRP): A case study of BULOG in East Lombok Regency;PROCEEDINGS OF THE SYMPOSIUM ON ADVANCE OF SUSTAINABLE ENGINEERING 2021 (SIMASE 2021): Post Covid-19 Pandemic: Challenges and Opportunities in Environment, Science, and Engineering Research;2023
2. Solving XpressBees Logistics Problem by Using Exact and Heuristic Method;LOGI – Scientific Journal on Transport and Logistics;2022-01-01