scholarly journals Distribusi Batik Madura Melalui Penerapan Generalized Vehicle Routing Problem (GVRP)

2017 ◽  
Vol 3 (2) ◽  
pp. 101-104
Author(s):  
Faisol Faisol ◽  
Masdukil Makruf
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Product Distribution ◽  
Cluster Method ◽  
Routing Problem ◽  
Maximum Capacity ◽  
Distribution Process ◽  
The Cost ◽  
Distribution Cost ◽  
Generalized Vehicle Routing Problem

Product distribution process is an effort to convey a product of consumer handlebar with a planned and programmed system. Cluster method is a grouping of the nearest market location, then analyzed the location of potential facilities through center of gravity. GVRP (Generalized Vehicle Routing Problem) is one of the algorithms in the cluster method [1]. In the GVRP describes the route determination to minimize the required distribution costs. GVRP is a generalization of VRP, so the point of the graph is partitioned into several sets of specific points, called clusters [2]. In this research, modification of GVRP model for multi-capacity vehicle case can determine the route and minimize the cost of distribution. Taken case on UD. Damai Asih for the distribution of Madura writes batik to 25 districts in East Java. From the results of running using MATLAB 7.8.0 obtained the efficiency of the distribution cost of 8.71% of the initial cost before doing the clustering based on distance and maximum capacity of the car of Rp. 6,969,480.00. After the filtering based on the distance and maximum capacity of the car obtained a cost of Rp. 6.365.500.00. The highest value of efficiency is obtained in cluster four, while the lowest efficiency value is obtained in cluster eight. The existence of cost efficiency is due to the different mileage in the clustering process.

scholarly journals Penyelesaian Vehicle Routing Problem Untuk Efisiensi Rute Pendistribusian Produk Minuman Teh Pucuk Harum Menggunakan metode Saving Matriks Studi Kasus (PT. Cipta Niaga Semesta Palu)

2020 ◽  
Vol 17 (1) ◽  
pp. 17-28
Author(s):  
R Putrafi ◽  
A Sahari
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Product Distribution ◽  
Routing Problem ◽  
Distribution Costs ◽  
Efficient Delivery ◽  
Distribution Process ◽  
Total Difference ◽  
The Cost ◽  
A Company

Vehicle Routing Problem Is a Problem related to the route of product distribution to the consumers. With the existence of these problems a company is expected to seek away a way so that the distribution process can arrive on time to scattered consumers and obtain more efficient routes and costs. Therefore a method which can help the process of scheduling a good route and obtaining optimum costs and efficient delivery was used. One of the methods used was Saving Matrix, which in its operation could efficient the delivery route so that the minimum total distance was obtained. The company's actual mileage was greater than the distance travelled by the route after using the Saving Matrix method. The total difference in distance produced was 106,35 km or more saving 41,2 % from the actual distance of the company and using Saving Matrix could save the distribution costs of Rp. 5.687.640 or save 33,8 % of the cost before applying the method.

scholarly journals Brief communication: Vehicle routing problem and UAV application in the post-earthquake scenario

2017 ◽  
Author(s):  
Marco Cannioto ◽  
Antonino D'Alessandro ◽  
Giosuè Lo Bosco ◽  
Salvatore Scudero ◽  
Giovanni Vitale
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Seismic Event ◽  
Computing Time ◽  
Research Problem ◽  
Routing Problem ◽  
Earthquake Scenario ◽  
Short Computing Time ◽  
The Cost ◽  
The Town

Abstract. In this paper we simulate a Unmanned Aerial Vehicle's (UAV) recognition after a possible case of diffuse damage after a seismic event in the town of Acireale (Sicily, Italy). Given a set of sites (84 relevant buildings) and the range of the UAV, we are able to find the number of vehicles to employ and the shortest survey path. The problem of finding the shortest survey path is an operational research problem called Vehicle Routing Problem (VRP) whose solution is known to be computationally time-consuming. We used the Simulated Annealing (SA) heuristic that is able to provide stable solutions in relatively short computing time. We also examined the distribution of the cost of the solutions varying the depot on a regular grid in order to assess the best area where to execute the survey.

The Research on VRP Based on Max-Min Ant Colony Algorithm

2011 ◽  
Vol 219-220 ◽  
pp. 1285-1288 ◽  
Author(s):  
Chang Min Chen ◽  
Wei Cheng Xie ◽  
Song Song Fan
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Search Time ◽  
Ant Colony ◽  
Local Optimum ◽  
Simulation Data ◽  
Routing Problem ◽  
Np Hard Problem ◽  
The Cost

Vehicle routing problem (VRP) is the key to reducing the cost of logistics, and also an NP-hard problem. Ant colony algorithm is a very effective method to solve the VRP, but it is easy to fall into local optimum and has a long search time. In order to overcome its shortcomings, max-min ant colony algorithm is adopted in this paper, and its simulation system is designed in GUI of MATLAB7.0. The results show that the vehicle routing problem can well achieves the optimization of VRP by accessing the simulation data of database.

Practical aspects of the split delivery vehicle routing problem (SDVRP)

2018 ◽  
Vol 120 ◽  
pp. 155-166
Author(s):  
Marek Karkula
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Route Planning ◽  
Product Distribution ◽  
Delivery Vehicle ◽  
Routing Problem ◽  
Split Delivery ◽  
Delivery Planning ◽  
Distribution Company ◽  
Planning Problems

Transport process arrangement and delivery route planning is one of the most important tasks of managers in distribution, trade and production enterprises. The problem of route planning concerns the rationalization of product distribution processes offered by company for the customer's network. In operational research, such a problem is included in the class of issues of Vehicle Routing Problem – VRP. The VRP delivery planning problems constitute a wide family of issues arising primarily from the conditions and constraints of the practice. The paper presents the practical application of one of the VRP variants – the problem of arranging routes for the Split Delivery Vehicle Routing Problem – SDVRP, and the results of analyses based on research carried out in a distribution company.

Sign in / Sign up

Export Citation Format

Share Document