With the Multiple Trips condition, the results obtained for the optimal distance route that starts and stops at PT. Tirta Investama Medan with Clarke Wright Algorithm at t = 1 is 22 km and at t = t + 1 is 15.2 km. While the optimal travel distance route with the Sequential Insertion Algorithm at t = 1 is 15.05 km, and at t = t + 1 is 22.9 km. Clarke Wright Algorithm looks for an optimal solution to get the best route, while Sequential Insertion Algorithm has an excess in the election of a customer by considering customer position with available insertion track location until all customer have been assigned. The Clarke Wright Algorithm obtained a total distance of 37.2 km. In comparison, the Sequential Insertion Algorithm solution obtained a total distance of 37.95 km. It can be concluded that the route formed using the Clarke Wright Algorithmin this case is more effective than using the Sequential Insertion Algorithm.
The Effectiveness of Clarke Wright and Sequential Insertion Algorithm in Distribution Routing Aqua
2021-04-29
doi:10.14421/quadratic.2021.011-03
Quadratic: Journal of Innovation and Technology in Mathematics and Mathematics Education; Vol 1 No 1 (2021): April 2021; 15-22 ; 2776-8201 ; 2776-9003
Article (Journal)
Electronic Resource
English
DDC: | 629 |
Proposed Modified Clarke-Wright Saving Algorithm for Capacitated Vehicle Routing Problem
BASE | 2019
|Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix
DOAJ | 2024
|Distribution of Merchandise Through Clarke and Wright Heuristic and Mathematical Model: Case Study
Springer Verlag | 2021
|