The Effectiveness of Clarke Wright and Sequential Insertion Algorithm in Distribution Routing Aqua

Hariati, Ayu; Prasetya, Nurul Huda; Cipta, Hendra

doi:10.14421/quadratic.2021.011-03

Cited by 4 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fertilization sometimes takes a long time because of the selection of mileage in the distribution of fertilizer itself to move from one block to another, coupled with the condition of the plantation road which is partially damaged (Guampe et al, 2022). The path taken is usually just a memorized path that has been planted and is considered the shortest, even though it is not necessarily the more optimal path (Hariati et al, 2021).…”

Section: Fertilizermentioning

confidence: 99%

Ant Colony Optimization Algorithm for Traveling Salesman Problem in Distributing Fertilizer

Hazizah,

Lubis,

Cipta

2023

Mathline

View full text Add to dashboard Cite

Fertilization sometimes takes a long time due to the selection of mileage traveled in fertilizer distribution and coupled with the condition of plantation roads that are partially damaged. The path taken is usually only a path that is memorized and is considered the shortest and optimal. The journey from one location to another by considering the shortest path is included in the problem of graph theory. To determine the shortest path to be traversed, you can use the Ant Colony algorithm, because it is optimal in determining short distances and can measure the minimum accumulated travel time close to optimal. This is a Traveling Salesman Problem (TSP) problem, which is visiting all location points starting from the starting point and ending at the starting point again. This research was conducted on oil palm plantations of PT. Socfindo Bangun Bandar in fertilizer distribution. The sample used is 6 location points which are then solved using the Ant Colony algorithm where this algorithm adopts the workings of ants to get the shortest route. The use of the Ant Colony algorithm in this case is limited to one cycle or one iteration (NC=1) so that the best route is obtained while the first cycle is the fertilizer warehouse (V1) to block 55 (V4) then block 63 (V6) to block 61 (V5) then block 51 (V2) to block 52 (V3) and back again to the fertilizer warehouse (V1), and from this route can be modified again to the opposite route with a distance of 15.71 km. Because the resulting distance is shorter than the usual route, this can speed up the time used by trucks to distribute fertilizer so that trucks can be used by workers to transport harvested palm fruit.

show abstract

Section: Fertilizermentioning

confidence: 99%

Ant Colony Optimization Algorithm for Traveling Salesman Problem in Distributing Fertilizer

Hazizah,

Lubis,

Cipta

2023

Mathline

View full text Add to dashboard Cite

show abstract

“…By performing data processing to design alternative routes, the distribution process can become more efficient. [6] 2. RESEARCH METHOD VRP (Vehicle Ranking Problem) is a challenge that involves determining the path of transportation trips that transport products from factories to customers.…”

Section: Introductionmentioning

confidence: 99%

Determining the Optimal Route of Bulog Rice Distribution Using Sequential Insertion and Nearest Neighbour Method

Safitri,

Rakhmawati,

Aprillia

2024

jiko

View full text Add to dashboard Cite

Rice consumption in Indonesia is the 4th highest in the world, with an annual average of 35.3 million tonnes. Apart from that, domestic rice production is relatively low, so finding an optimal distribution pattern to meet Indonesia's food consumption needs is necessary. This research aims to find the best route for rice distribution using sequential insertion and nearest-neighbor methods. The aim is to compare the two methods to determine which is suitable for distributing rice. Apart from that, comparisons are made to find the distribution route with the shortest distance and fastest time. The research results show that the optimal travel distance using the sequential insertion method is t = 1, namely 519 Km with a travel time of 779 minutes. Meanwhile, the optimal travel distance using the nearest neighbor method at r = 1 is 506 km with a travel time of 535 minutes. Thus, this problem's nearest neighbor method performs better than sequential insertion.

show abstract

“…According to Laporte [16], one example of a heuristic method is the Clarke-Wright Algorithm. The Clarke-Wright algorithm is suitable for solving problems that are quite large, in this case a large number of routes [17]- [18]. The Clarke-Wright Algorithm also performs savings calculations that are measured by how much distance traveled and time used can be reduced by connecting existing points and making it route based on the largest saving value, namely the distance traveled between the point of origin and the point of destination [3], [19]- [20].…”

Section: Introductionmentioning

confidence: 99%

Optimal Vehicle Routing Problem (VRP) For The Distribution Of Medical Devices By Applying The Clarke-Wright Algorithm

Cipta,

Fitriana Hasibuan

2023

IJSE

View full text Add to dashboard Cite

In the current era of modernization, the development of the need for medical devices is increasing,g so that the companies need goods distribution system with criteria that have speed, safety, and convenience to distribute various kinds of products according to optimal distribution routes. The aim of this study is to overcome the problem of the distribution route for medical devices from PT Alkes Medan because the number of demand for goods varies for each consumers, vehicle capacites, delivery time limits, average speed that can be reached on certain routes and times and the existence of the different conditions of multiple trips at the customer's location. A heuristic algorithm named Clarke-Wright Algorithm is applied in this problem. This algorithm will be later provide an optimal solution to route problem in the distribution of medical devices and provide effectiveness in finding the shortest optimal route of medical device goods distributed to consumers. The optimal route will be described in the results section of this study

show abstract

The Effectiveness of Clarke Wright and Sequential Insertion Algorithm in Distribution Routing Aqua

Cited by 4 publications

References 3 publications

Ant Colony Optimization Algorithm for Traveling Salesman Problem in Distributing Fertilizer

Ant Colony Optimization Algorithm for Traveling Salesman Problem in Distributing Fertilizer

Determining the Optimal Route of Bulog Rice Distribution Using Sequential Insertion and Nearest Neighbour Method

Optimal Vehicle Routing Problem (VRP) For The Distribution Of Medical Devices By Applying The Clarke-Wright Algorithm

Contact Info

Product

Resources

About