Article Per Year (5 Year)
p-Index From 2021 - 2026
4.204
P-Index
This Author published in this journals
All Journal International Journal of Business, Economics, and Social Development International Journal of Global Operations Research International Journal of Quantitative Research and Modeling International Journal of Ethno-Sciences and Education Research International Journal of Humanities, Law, and Politics International Journal of Health, Medicine, and Sports International Journal of Linguistics, Communication, and Broadcasting
Lianingsih, Nestia
Unknown Affiliation
Religion Humanities Computer Science & IT Decision Sciences, Operations Research & Management Dentistry Economics, Econometrics & Finance Education Engineering Environmental Science Health Professions Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Mathematics Medicine & Pharmacology Nursing Physics Public Health Social Sciences Transportation Other

Published : 33 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : International Journal of Global Operations Research

 1 
Performance Comparison of Ant Colony Optimization and Artificial Bee Colony in Solving the Capacitated Vehicle Routing Problem Setyawan, Deva Putra; Lianingsih, Nestia; Saputra, Moch Panji Agung
International Journal of Global Operations Research Vol. 5 No. 4 (2024): International Journal of Global Operations Research (IJGOR), November 2024
Publisher : iora

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47194/ijgor.v5i4.339

Abstract

The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem widely applied in logistics and supply chain management. It involves determining the optimal routes for a fleet of vehicles with limited capacity to serve a set of customers with specific demands while minimizing travel costs. This study compares the performance of two popular metaheuristic algorithms, Ant Colony Optimization (ACO) and Artificial Bee Colony (ABC), in solving the CVRP. The research implements both algorithms on standard benchmark datasets, evaluating solution accuracy and computational efficiency. Simulation results indicate that ACO tends to excel in finding high-quality solutions, particularly for problems with high complexity, whereas ABC demonstrates superior computational efficiency on small- to medium-scale datasets. A detailed analysis of algorithm parameters was also conducted to understand their impact on the performance of both methods. This study provides valuable insights into the strengths and limitations of each algorithm in the context of CVRP and paves the way for the development of hybrid approaches in the future.
Co-Authors Aglia, Arla Agung Prabowo Andrian Ibrahim, Riza AS, Nurnisaa Audina, Yurid Haq, Fadiah Hasna Nadiatul Hidayana, Rizki Apriva Ibrahim, Riza A Ibrahim, Riza Andrian Irman, Dede Jaizul , Alim Jaizul, Alim Laksito, Grida Saktian Mugi Lestari, Mugi Nurnisaa, Nurnisaa Pirdaus, Dede Irman Rini Cahyandari S, Renda Sandi Saefullah, Rifki Setyawan, Deva Putra Suhaimi, Nurnisaa binti Abdullah Sulistya A, Astrid Sulistya, Astrid Surya P, Dhika Vimelia, Willen Yohandoko, Setyo Luthfi Okta Yuningsih, Siti Hadiaty