Adjusted artificial bee colony algorithm for the minimum weight triangulation

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The minimum weight triangulation is a well-known NP-hard problem often used for the construction of triangulated random network models of land contours. Since it is an intractable problem, the required computational time for an exhaustive search algorithm grows exponentially with the number of points in 2D space. Nature-inspired swarm intelligence algorithms are prominent and efficient optimization techniques for solving that kind of problems. In this paper, we adjusted the artificial bee colony algorithm for the minimum weight triangulation problem. Our adjusted algorithm has been implemented and tested on several randomly generated instances of points in the plane. The performance of our proposed method was compared to the performance of other stochastic optimization algorithms, as well as with the exhaustive search for smaller instances. The simulation results show that our proposed algorithm in almost all cases outperforms other compared algorithms.

Cite

CITATION STYLE

APA

Alihodzic, A., Smajlovic, H., Tuba, E., Capor Hrosik, R., & Tuba, M. (2019). Adjusted artificial bee colony algorithm for the minimum weight triangulation. In Advances in Intelligent Systems and Computing (Vol. 741, pp. 305–317). Springer Verlag. https://doi.org/10.1007/978-981-13-0761-4_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free