travelling salesman problem
2 articles · search the full text for this term
-
Exhaustive Search Meets DNA Sequencing: A Comprehensive Review of TSP-Based Approaches
Abstract: Exhaustive search is a highly computational complex algorithm that checks every possibility to obtain the best solution. We illustrate an exhaustive search by applying it to three important problems: the traveling salesman problem, the knapsack problem, and the assignment problem. In this paper, we took a traveling salesman problem to explain DNA Sequencing. Since traveling salesman problem is an algorithmic problem that finds the shortest route between a set of …
Published in International Journal of Bioinformatics and Computational Biology · Vol. 2, Issue 2, 2024 · pp. 11–21 Read article
-
Heuristic Based Transportation Routing and Sizing
Abstract: Employee transportation is one of the most concerned issues and a part of HR policy in today’s work culture. Optimization of these routes and analysis of scenario needs to be done to leverage cost benefits for the organizations of today. Traditional studies focus on goods delivery and pickup, but employees are a totally different entity, which change the type of problem to be solved. As the entity to be considered …
Published in Journal of Production Research & Management · Vol. 5, Issue 3, 2015 · pp. 20–27 Read article