Optimasi Rute Distribusi Pada Heterogeneos Fleet Vehicle Routing Problem (HFVRP) Menggunakan Algoritma Sweet dan Particle Swarm Optimization (PSO)
Kode Repository :SKM02/SEK/23
NPM :064118003
Nama :Sekartia Nofiana
Pembimbing 1 :-Hagni Wijayanti, M.Si
Pembimbing 2 :-Maya Widyastiti ,M.Si
Abstrak :-Abstract: Distribution plays an important role in a company as a link between the company and
customers. The problem in a company is that it occurs in the product distribution process because
it is only based on estimates so that it does not have an optimal distribution route to be used as
a reference. This problem is know as the Vehicle Routing Problem (VRP), which is an
optimization problem related to determining the optimal route. However, this problem assumes
that the vehicles used have the same capacity (homogeneous) in fact not all companies use
vehicles that have the same load capacity as at PT 3S which has different types of vehicles
(heterogeneous) so that the load capacity on each vehicle is different. This type of VRP is known
as the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). Therefore, to solve the problem,
it is solved using the Sweep Algorithm as the formulation of customer groups based on the
proximity between customers, then each group is optimized using the Particle Swarm
Optimization (PSO) Algorithm to find the route that has the shortest mileage. The optimization
results for one week resulted in 25 clusters and a total mileage of 4529,1 km and a distribustion
cost of Rp. 9.956.855. So there is reduction in the distance of 924,9 km and a distribution cost
Rp. 1.097.245.
Keywords: route, heterogeneous fleet vehicle routing problem, sweep, particle swarm
optimization