This project implements a solution for the Travelling Salesman Problem (TSP) using bitmasking and dynamic programming. It calculates the shortest possible route that visits every city exactly once and ...

Abstract: Metaheuristic algorithms have demonstrated strong effectiveness in solving complex real-world optimization problems. This paper presents two discrete metaheuristic approaches for the ...

Abstract: The Travelling Salesman Problem (TSP) is a well known method for the optimisation problem that asks you to find the shortest route that visits each city in a set exactly once and then goes ...

In modern logistics, combining traditional trucks with drones can significantly reduce delivery times. The truck acts as a moving launchpad, performing deliveries ...

Deciphering gene circuits can be tedious and immensely time consuming. Modifying, or designing gene circuits from previously identified pathways presents further challenges. “There are many possible ...