A Group Theoretic Tabu Search Approach to the Traveling Salesman Problem
Shane N. Hall
Broschiertes Buch

A Group Theoretic Tabu Search Approach to the Traveling Salesman Problem

Versandkostenfrei!
Versandfertig in über 4 Wochen
54,99 €
inkl. MwSt.
PAYBACK Punkte
27 °P sammeln!
The traveling salesman problem (TSP) is a combinatorial optimization problem that is mathematically modeled as a binary integer program. The TSP is a very important problem for the operations research academician and practitioner. This research demonstrates a Group Theoretic Tabu Search (GTTS) Java algorithm for the TSP. The tabu search metaheuristic continuously finds near-optimal solutions to the TSP under various different implementations. Algebraic group theory offers a more formal mathematical setting to study the TSP providing a theoretical foundation for describing tabu search. Specific...