PENENTUAN LINTASAN OPTIMAL DISTRIBUSI BARANG MENGGUNAKAN HYPERGRAPH - PARTITIONING DAN ALGORITMA GENETIKA

Efficient distribution of goods is critical in logistics management, which requires the selection of optimal distribution paths to achieve delivery targets with minimal total distance. This research combines Hypergraph-Partitioning and genetic algorithm to determine the optimal distribution path of goods to several customers. The Hypergraph-Partitioning divides the goods to be distributed equally to several vehicles, while the genetic algorithm is applied to determine the best distribution path in each partition. The results showed that the Hypergraph-Partitioning method successfully divided 62 customers into two partitions. The first partition serves 31 customers with a total demand of 865 loaves of bread, while the second partition also serves 31 customers with a total demand of 1,035 loaves of bread. The genetic algorithm was then used to find the shortest path for each partition, resulting in an efficient distribution solution.

Authors

Institutions

Publication Details

Journal
Jurnal Ilmiah Matematika dan Pendidikan Matematika
Published
2024-12-31
DOI
https://doi.org/10.20884/1.jmp.2024.16.2.13545
Primary Topic
Management and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

PENENTUAN LINTASAN OPTIMAL DISTRIBUSI BARANG MENGGUNAKAN HYPERGRAPH - PARTITIONING DAN ALGORITMA GENETIKA

Kartika Yulianti, Ririn Sispiyati, Fitriani Halimatus Sadiyyah
Jurnal Ilmiah Matematika dan Pendidikan Matematika
Management and Optimization Techniques
article

PENENTUAN LINTASAN OPTIMAL DISTRIBUSI BARANG MENGGUNAKAN HYPERGRAPH - PARTITIONING DAN ALGORITMA GENETIKA

Kartika Yulianti, Ririn Sispiyati, Fitriani Halimatus Sadiyyah
article en

Abstract

Efficient distribution of goods is critical in logistics management, which requires the selection of optimal distribution paths to achieve delivery targets with minimal total distance. This research combines Hypergraph-Partitioning and genetic algorithm to determine the optimal distribution path of goods to several customers. The Hypergraph-Partitioning divides the goods to be distributed equally to several vehicles, while the genetic algorithm is applied to determine the best distribution path in each partition. The results showed that the Hypergraph-Partitioning method successfully divided 62 customers into two partitions. The first partition serves 31 customers with a total demand of 865 loaves of bread, while the second partition also serves 31 customers with a total demand of 1,035 loaves of bread. The genetic algorithm was then used to find the shortest path for each partition, resulting in an efficient distribution solution.

Jurnal Ilmiah Matematika dan Pendidikan MatematikaVol. 16(2)
Indonesia University of Education (ID)
Openalex Percentile: Top 55%
Management and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

PENENTUAN LINTASAN OPTIMAL DISTRIBUSI BARANG MENGGUNAKAN HYPERGRAPH - PARTITIONING DAN ALGORITMA GENETIKA — Kartika Yulianti, Ririn Sispiyati, et al. · Jurnal Ilmiah Matematika dan Pendidikan Matematika (2024) | TGRS Research Map | TGRS