• Title: Traveling Salesman Problem, Theory and Applications
• Author(s) Donald Davendra
• Publisher: IN-TECH (December 30, 2010); eBook (Creative Commons Licensed)
• License(s): Attribution 3.0 Unported (CC BY 3.0)
• Hardcover: 298 pages
• eBook: PDF Files, and an PDF (338 pages)
• Language: English
• ISBN-10: N/A
• ISBN-13: 978-953-307-426-9
• Share This:  

Book Description

This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the Travelling Salesman Problem (TSP). It brings together researchers with applications in Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm. Hybrid systems, like Fuzzy Maps, Chaotic Maps and Parallelized TSP are also presented.

Most importantly, this book presents both theoretical as well as practical applications of TSP, which will be a vital tool for researchers and graduate entry students in the field of applied Mathematics, Computing Science and Engineering.

• N/A

• Amazon

• Algorithms and Data Structures
• Graph Theory
• Operations Research (OR), Linear Programming, Optimization, and Approximation
• Computational Complexity

• Traveling Salesman Problem, Theory and Applications (Donald Davendra)
• PDF Format
• The Mirror Site (1) - PDF

• Knapsack Problems: Algorithms and Computer Implementations

  The text fully develops an algorithmic approach to Knapsack Problems without losing mathematical rigor. It provides a comprehensive overview of the methods for solving Knapsack Problems (KP), its variants and generalizations.

• Digraphs: Theory, Algorithms and Applications (J. Bang-Jensen)

  This book is an essential, comprehensive reference of Digraphs covering the theoretical aspects of the subject, focus on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem.

• Essentials of Metaheuristics (Sean Luke)

  This book is an open set of lecture notes on metaheuristics algorithms. The algorithmic family includes genetic algorithms, hill-climbing, simulated annealing, ant colony optimization, particle swarm optimization, and so on.

• Global Optimization Algorithms - Theory and Application

  This book is devoted to global optimization algorithms, which are methods to find optimal solutions for given problems. It especially focuses on Evolutionary Computation by discussing evolutionary algorithms, genetic algorithms, Genetic Programming, etc.

• Introduction to Online Convex Optimization (Elad Hazan)

  This book presents a robust machine learning approach that contains elements of mathematical optimization, game theory, and learning theory: an optimization method that learns from experience as more aspects of the problem are observed.

• Convex Optimization (Stephen Boyd, et al.)

  On recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples in fields such as engineering, computer science, mathematics, statistics, finance, and economics.

• The Design of Approximation Algorithms (D. P. Williamson)

  This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.

• Engineering Design Optimization (Joaquim R. Martins, et al)

  The philosophy of this book is to provide a detailed enough explanation and analysis of optimization methods so that readers can implement a basic working version. Practical tips are included for common issues encountered in practical engineering design optimization.

• Tabu Search (Wassim Jaziri)

  The goal of this book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms.