Andere Kunden interessierten sich auch für
![A Group Theoretic Tabu Search Methodology for Solving the Theater Distribution Vehicle Routing and Scheduling Problem]( "A Group Theoretic Tabu Search Methodology for Solving the Theater Distribution Vehicle Routing and Scheduling Problem")
A Group Theoretic Tabu Search Methodology for Solving the Theater Distribution Vehicle Routing and Scheduling Problem62,99 €![An Advanced Tabu Search Approach to Solving the Mixed Payload Airlift Load Planning Problem]( "An Advanced Tabu Search Approach to Solving the Mixed Payload Airlift Load Planning Problem")
An Advanced Tabu Search Approach to Solving the Mixed Payload Airlift Load Planning Problem61,99 €![A Combined Adaptive Tabu Search and Set Partitioning Approach for the Crew Scheduling Problem with an Air Tanker Crew Application]( "A Combined Adaptive Tabu Search and Set Partitioning Approach for the Crew Scheduling Problem with an Air Tanker Crew Application")
A Combined Adaptive Tabu Search and Set Partitioning Approach for the Crew Scheduling Problem with an Air Tanker Crew Application60,99 €![A Hybrid Jump Search and Tabu Search Metaheuristic for the Unmanned Aaerial Vehicle Routing Problem]( "A Hybrid Jump Search and Tabu Search Metaheuristic for the Unmanned Aaerial Vehicle Routing Problem")
A Hybrid Jump Search and Tabu Search Metaheuristic for the Unmanned Aaerial Vehicle Routing Problem60,99 €![Traveling Salesman Problem for Surveillance Mission Using Particle Swarm Optimization]( "Traveling Salesman Problem for Surveillance Mission Using Particle Swarm Optimization")
Traveling Salesman Problem for Surveillance Mission Using Particle Swarm Optimization62,99 €![Solving the Multidimensional Multiple Knapsack Problem with Packing Constraints Using Tabu Search]( "Solving the Multidimensional Multiple Knapsack Problem with Packing Constraints Using Tabu Search")
Solving the Multidimensional Multiple Knapsack Problem with Packing Constraints Using Tabu Search62,99 €![A Reactive Tabu Search Metaheuristic Extension of the Air Refueling Tanker Assignment Problem]( "A Reactive Tabu Search Metaheuristic Extension of the Air Refueling Tanker Assignment Problem")
A Reactive Tabu Search Metaheuristic Extension of the Air Refueling Tanker Assignment Problem60,99 €
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. Specifically, this thesis uses the Symmetric Group on n letters, Sn, which is the set of all n! permutations on n letters whose binary operation is permutation multiplication, to describe the TSP solution space. Thus, the TSP is studied as a permutation problem rather than an integer program by applying the principles of group theory to define the tabu search move and neighborhood structure. The group theoretic concept of conjugation (an operation involving two group elements) simplifies the move definition as well as the intensification and diversification strategies. Conjugation in GTTS diversifies the search by allowing large rearrangement moves within a tour in a single move operation. Empirical results are presented along with the theoretical motivations for the research.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.