2022
DOI: 10.30738/st.vol8.no2.a12737
|View full text |Cite
|
Sign up to set email alerts
|

Performansi Analisis Algoritma Koloni Semut (Ant Colony Optimization) dalam menyelesaikan permasalahan Capacitated Vehicle Routing Problem (CVRP)

Abstract: Algoritma koloni semut (ACO) merupakan sebuah algoritma yang diperkenalkan oleh Moyson dan Manderick dan selanjutnya dikembangkan oleh Marco Dorigo. Algoritma ini telah diterapkan dalam berbagai masalah optimasi, salah satunya adalah Capacitated Vehicle Routing Problem (CVRP). Tujuan dari penelitian ini adalah untuk menyelidiki tingkat performansi algoritma koloni semut (ACO) dalam menyelesaikan CVRP. Performansi ACO nantinya diukur berdasarkan 3 faktor, yaitu penggunaan memori, waktu eksekusi dan tingkat akur… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…First introduced through a paper entitled " The Truck Distpaching Problem", CVRP as the most basic form of VRP, has attracted a lot of attention for scientists to research about the problem. (Muna, 2022) CVRP or capacitated vehicle routing problem is a problem related to determining the optimal route by paying attention to the constraints of each vehicle having a certain capacity. Each vehicle distributes one delivery, namely from the depot to each customer/agent area and then back to the depot, so that a service system in determining distribution routes becomes more effective and efficient so as to improve the company's ability to meet product demand more quickly so that consumer trust and satisfaction increase.…”
Section: Literature Review Vehicle Routing Problem (Vrp)mentioning
confidence: 99%
“…First introduced through a paper entitled " The Truck Distpaching Problem", CVRP as the most basic form of VRP, has attracted a lot of attention for scientists to research about the problem. (Muna, 2022) CVRP or capacitated vehicle routing problem is a problem related to determining the optimal route by paying attention to the constraints of each vehicle having a certain capacity. Each vehicle distributes one delivery, namely from the depot to each customer/agent area and then back to the depot, so that a service system in determining distribution routes becomes more effective and efficient so as to improve the company's ability to meet product demand more quickly so that consumer trust and satisfaction increase.…”
Section: Literature Review Vehicle Routing Problem (Vrp)mentioning
confidence: 99%