This work aims to improve the performance of the Bees Algorithm (BA), particularly in terms
of simplicity, accuracy, and convergence. Three improvements were made in this study as a …

This study presents a construction tour technique (CH-NN) for solving the Travelling
Salesman Problem based on the Convex-hull and Nearest Neighbor heuristics. The aim is …

Abstract [eng] The study presents the Half Max Insertion Heuristic (HMIH) as a novel
approach to solving the Travelling Salesman Problem (TSP). The goal is to outperform …

This study investigated the computational effect of a Convex Hull subtour on the Nearest
Neighbour Heuristic. Convex hull subtour has been shown to theoretically degrade the worst …

Abstract The Travelling Salesperson Problem (TSP) is a nondeterministic-polynomial hard
(NP-hard) combinatorial problem that occurs in a wide range of industrial domains, including …

The main goal of this research is to determine if an Inertial Navigation System (INS) can be
corrected to effectively track a user's pose, position and orientation, by using a monocular …

We consider an area we would like to scan using drones that can perform air surveillance,
the area is too large for one drone in a mission can reach and scan. In our approach, the …

This experimental study investigated the effect of Convex Hull on Node-based Heuristics.
This was motivated by the assertion in the literature that starting some insertion tours with a …

Purpose: Traveling Salesman Problem (TSP) that can be extended and modified in various
ways, is a practical and realistic type of problem and forms the basis for the visual and …

ABSTRACT The Optimization Problem of solving complex, mostly impracticable problems
with limited resources remains a research conundrum which has necessitated enormous …