Abstract: NP-hard problems exist in many real world applications. Ant colony optimization (ACO) algorithms can provide approximate solutions for those NP-hard problems, but the performance of ACO ...

Abstract: The Traveling Salesman Problem (TSP) is a combinatorial optimization problem that is useful in a number of applications. Since there is no known polynomial-time algorithm for solving large ...

It is an optimization algorithm used to find the shortest path between points or nodes. It is developed by observing the behaviour of ants when they follow a path to their food source. Ants are ...

In this project, I implemented with Python the solutions of the scheduling problem using different methods, the metaheuristic : genetic algorithm and secondly the dynamic programming.

One of the famous research areas in biomedical engineering and pattern recognition is finger movement classification. For hand and finger gesture recognition, the most widely used signals are the ...

Power line inspection plays a significant role in the normal operation of power systems. Although there is much research on power line inspection, the question of how to balance the working hours of ...