Algoritma Spotted Hyena Optimizer pada Capacitated Vehicle Routing Problem

Prayoga Yudha Pamungkas, Nur Mayke Eka Normasari


Transportation is used in the delivery of goods from one location to another, contributing costs to the final price of a product or service. Efficiency is needed to reduce transportation costs, one of which can be done by optimizing transportation routes. Vehicle Routing Problem (VRP) is a problem that is often referred to to find the optimal route from a source to several points at minimal cost. VRP is evolving into a complex problem as the number of consumers to visit increases. This complexity causes VRP to be included in the combinatorial optimization which has a lot of configuration in finding the shortest route. In this study, VRP was completed with a metaheuristic approach using the Spotted Hyena Optimizer (SHO) algorithm. The use of SHO in capacitated vehicle routing problems (CVRP) is based on the results of research by the originator of SHO which is able to achieve convergent rate faster than other algorithms. SHO on CVRP produces better solutions or shorter total distances than genetic algorithms, ant colony, and particle swarm optimization by using the Augeraat dataset as a comparison of the final results in each algorithm.


Capacitated Vehicle Routing Problem; Metaheuristic; Spotted Hyena Optimizer

Full Text:



Davies, S. (n.d.). Combinatorial Optimization. Retrieved Agustus 29, 2021, from Computer Science Carnegie Mellon University.

Horowitz, E., Sahni, S., & Rajasekaran, S. (1997). Computer Algorthms. New York: Computer Science Press.

Pop, P. C., Zelina, I., Lupşe, V., Sitar, C. P., & Chira, C. (2011). Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem. International Journal Computers Comunication & Control, 6(1), 158-165.

Glover, F., & Kochenberger, G. A. (2003). Handbook of Metaheuristics. New York: Kluwer Academic Publisher.

Weise, T. (n.d.). Metaheuristic Optimization. Retrieved September 29, 2021, from Institute of Applied Optimization Hefei University.

Quintero-Duran, M., Candelo, J. E., & Sousa, V. (2017). Recent Trends of the Most Used Metaheuristic Techniques for Distribution Network Reconfiguration. Journal Of Engineering Science and Technology Review, 10(5), 159-173.

Talbi, E.-G. (2009). Metaheuristics: From Design to Implementation (Vol. 42). Hoboken, New Jersey, USA: Wiley.

Gilbert, L., & Semet, F. (2002). Classical Heuristics for the Capacitated VRP. In The Vehicle Routing Problem (pp. 109-128). Philadelphia: Society for Industrial and Applied Mathematics.

Dhiman, G., & Kumar, V. (2017). Spotted hyena optimizer: A novel bio-inspired based metaheuristic technique for engineering applications. Advances in Engineering Software, 114, 48-70.

Toth, P., & Vigo, D. (2002). An Overview of Vehicle Routing Problems. In The vehicle routing problem (pp. 1-26). Philadelphia: Society for Industrial and Applied Mathematics.

Togatoro, Y. S. (2018). Penyelesaian Capacitated Vehicle Routing Problem Menggunakan Algoritma Sweep. Medan: Universitas Sumatera Utara.

Ilany, A., Booms, A. S., & Holekamp, K. E. (2015). Topological effects of network structure on long-term social network dynamics in a wild mammal. Ecology Letters, 18(7).

Augerat, P. (1995). Approche polyèdrale du problème de tournées de véhicules. Français: Institut National Polytechnique de Grenoble - INPG,.

Peya, Z. J., Akhand, M. A., Sultana, T., & Rahman, M. M. (2019). Distance based Sweep Nearest Algorithm to Solve Capacitated Vehicle Routing Problem. International Journal of Advanced Computer Science and Applications, 259-264.

Akhand, M. A., Peya, Z. J., & Murase, K. (2017). Capacitated Vehicle Routing Problem Solving using Adaptive Sweep and Velocity Tentative PSO. International Journal of Advanced Computer Science and Applications, 8(12), 288-295.


  • There are currently no refbacks.