Minimasi Biaya Distribusi Menggunakan Algoritma Nearest Neighbour (Studi Kasus Stockist Pt. Xyz) (original) (raw)
Related papers
Vehicle Routing Problem on Juice Distribution Using Nearest Neighbor Method
2018
The problem of product distribution becomes an important topic in a company's transportation system. PT Amanah Prima Indonesia (API) is a national-scale company engaged in the production of juice drinks. With the number of consumers scattered in the Semarang area, it is necessary a solution in the distribution of products in order to obtain operational efficiency. The method used is Nearest Neighborhod Algorithm. The results obtained are: (a) Distance savings of 144.20 Km or 40.06%, (b) Product distribution time can be reduced for 5.15 hours or 30.31%, (c) Fuel costs used obtained cost savings of Rp.108.150, - or equal to 40.06%, (d) Expenses for driver and companion cost is no difference of Rp.600.000, -, and (f) The total cost of distribution is obtained savings of Rp. 108,150 or 12.43%.
2018
 The problem of distribution of goods of PT REHAU Indonesia is a problem of Vehicle Routing Problem (VRP) which is the problem of finding an effective and efficient route from a depot to a scattered customer. This research tries to analyze nearest neighbor method in solving the problem. This research will use quantitative method with 7 delivery route as samples involving 30 location points and 900 matrix of distance between locations. Data collection was done by conducting field study, ie observation and tracing of secondary data. This study uses a causal associative method of research that aims to determine the causal relationship (causal) or is influential between two or more variables. The results of this study indicate that the method is able to reduce total mileage by 15% from 1,614 km to 1,372 km or decrease as much as 242 km, reduce the delivery time of 16% or as much as 7 hours 49 minutes, and reduce the cost of delivery as much as 16% or decreased as much Rp 689,718.
Determination of best route to minimize transportation costs using nearest neighbor procedure
Applied Mathematical Sciences, 2014
Harumanis, Ltd. *) is a company that engage in the supply of fruits. Recently it also had to meet the highly demand of domestic consumer. Harumanis, Ltd. want to determine the best transportation route it had. Transportation is the movement of products from one location to another so that the goods reach up into the hands of consumers. Transportation will be discussed relating to the distribution of goods to the consumer. It is used to determine delivery routes or paths passed by any vehicle that will distribute these items by considering consumer demand and the number of cargo vehicles. It will be influenced and related to transportation costs that be incurred any time the company deliver goods to consumers. Saving methods matrix (matrix savings) is one method that can be used to assist in solving the problem of determining the delivery route. In this method the matrix are saving procedure used to sort consumers, there are nearest neighbor, farthest insert, and nearest insert. Based on those three procedures, founded that nearest neighbor provide shortest distance in shipping routes for each vehicle owned by the company to deliver goods to consumers.
IJERT-Capacitated Vehicle Routing Using Nearest Neighbor Algorithm in Supply Chain
International Journal of Engineering Research and Technology (IJERT), 2014
https://www.ijert.org/capacitated-vehicle-routing-using-nearest-neighbor-algorithm-in-supply-chain https://www.ijert.org/research/capacitated-vehicle-routing-using-nearest-neighbor-algorithm-in-supply-chain-IJERTV3IS051534.pdf One of the important factors in implementing supply chain management is to efficiently control the physical flow of the supply chain. Due to its importance many organizations are trying to develop efficient methods to reduce cost and improve responsiveness to various customer demands. Travelling Salesman problem (shortest Hamiltonian circuit) is well known for finding giant tour in planning horizon. Being NP-Hard in nature there are several methods available to find near optimal solution even for larger problems. In this paper two algorithms based on nearest Neighbor strategy are proposed for capacitated vehicle routing in supply chain and the results are analyzed for the optimization purpose.
Capacitated Vehicle Routing Using Nearest Neighbor Algorithm in Supply Chain
International journal of engineering research and technology, 2014
One of the important factors in implementing supply chain management is to efficiently control the physical flow of the supply chain. Due to its importance many organizations are trying to develop efficient methods to reduce cost and improve responsiveness to various customer demands. Travelling Salesman problem (shortest Hamiltonian circuit) is well known for finding giant tour in planning horizon. Being NP-Hard in nature there are several methods available to find near optimal solution even for larger problems. In this paper two algorithms based on nearest Neighbor strategy are proposed for capacitated vehicle routing in supply chain and the results are analyzed for the optimization purpose.
Journal Industrial Servicess
PT X is a manufacturing company that produces motorcycle units. With the continuous increase of product demand from consumers, it makes PT X being one of the largest manufacturing companies in Indonesia. Currently, the distribution route is determined by PT X only based on the experience and knowledge of the drivers. The distribution route should include the configuration of the appropriate distribution channels, in order for the delivery to be fast at a low cost. This problem is known as the vehicle routing problem (VRP). To overcome the problem must conduct research in the hope to minimize the cost of distribution of motorcycle units to the dealers, that is by calculating fuel consumption, tolls chargers, bundles of units and loading and unloading. The problem is solved by using saving matrix method. The result can minimize distribution costs of Rp3,323,500 compare with the actual cost of the company is Rp3,530,000. So it can be seen that there is a decrease in the cost of Rp206,500/day.
2015
Vehicle Routing Problem (VRP) is one of the most challenging problems in combinatorial optimization. Objective of VRP is to find minimum length route starts and ends in a depot. There are some additional constraints such as more than one depot, service time, time window, capacity of vehicle, and many more. These are cause of VRP variants. Vehicle Routing Problem with Time Windows (VRPTW) is a variant of VRP with some additional constrains, that are number of requests may not exceed the vehicle capacity, as well as travel time and service time may not exceed the time window. Multi Depot Vehicle Routing Problem (MDVRP) has number of depots serving all customers, a number of vehicles distributing goods to customers with a minimum distance of distribution route without exceeding the capacity of the vehicle. Many researches have presented algorithms to solve VRPTW and MDVRP. This article discusses solution characteristics of VRPTW and MDVRP algorithms, and their performance. VRPTW algori...
2015
IKM DM is a company engaged in the business of apparel or garment. Many actors involved in the business of the company, one of them is convection who became a partner of IKM DM in producing a product company especially trousers. Availability of finished goods in storage is the most noted companies, as an effort to improve competitiveness with always meet the needs of customers. The management of the distribution system should be very noticed by IKM DM, because so influential against time until goods in a warehouse. In this case, time is strongly influenced by the distance or route which passed by a conveyance that transports the product IKM DM. Based on it, research conducted on the distribution system of the IKM DM by making design route distribution optimal with two types of route companies that become case study are the location of the distribution routes of convection (Jakarta) to the location of the warehouse finished goods using the approach of VRP (Vehicle Routing Problem) an...
The best route determination using nearest neighbor approach
International Journal of Industrial Optimization
This research constitutes an application of heuristic optimization using the nearest neighbor (NN) method. It is a method used to design a route based on the next closest distance. The case here is the garbage freight of Yogyakarta City which becomes one of the Environmental Services Department duties. The sector of this research object is Malioboro-Kranggan because it has the highest number of TPS locations. There are 34 TPS locations, and 2 depots with an average volume of total garbage are 197 m3/day. Several alternative routes have resulted because the same distance was found when deciding the next distance (TPS 26 and TPS 31). The best alternative was determined based on the best scenario parameter of total mileage and operational time. The first scenario chose the garbage volume that is close to the remaining capacity, meanwhile, the second scenario chose the smallest garbage volume. At TPS 27, an alternative with the same closest distance appeared again (TPS 15 and TPS 18). H...
Journal of Modern Manufacturing Systems and Technology
A good distribution system can give an impact on cost efficiency and delivery time. XYZ , L.P is an animal feed firm who faces problems of high cost and long time to carry out distribution activities. This happens after an increase in demand for animal feed which was not followed by significance of increase in cost and distribution time. The research aimed to design a distribution system and determine an optimum distribution route using efficient resources, in order to obtain a minimum vehicle mileage. The research consists of 8 stages. Vehicle Routing Problem (VRP) with Nearest Neighbor method was carried out, followed by optimizing the route solution obtained from the VRP calculation using the Simulated Annealing (SA) Algorithm. According to the route optimization using SA, the mileage, travel time, and distribution costs can be reduced by 40.04%, 75%, and 49.85%, respectively. It is, therefore, assumed that the firm can gain benefits, in terms of cost and time, by implementing th...