• Menu
  • Skip to right header navigation
  • Skip to main content
  • Skip to secondary navigation
  • Skip to primary sidebar

OnlineProgrammingBooks.com

Legally Free Computer Books

  • All Categories
  • All Books
  • All Categories
  • All Books
  • About Us
  • Privacy policy
  • Disclaimer
  • Subscribe
  • Contact
You are here: Home ▶ AI and Robotics ▶ Traveling Salesman Problem

Traveling Salesman Problem

March 24, 2006

Traveling Salesman Problem

The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view.

Book Description

A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered.
TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance.

Table of Contents

  • Population-Based Optimization Algorithms for Solving the Travelling Salesman Problem
  • Bio-inspired Algorithms for TSP and Generalized TSP
  • Approaches to the Travelling Salesman Problem Using Evolutionary Computing Algorithms
  • Particle Swarm Optimization Algorithm for the Traveling Salesman Problem
  • A Modified Discrete Particle Swarm Optimization Algorithm for the Generalized Traveling Salesman Problem
  • Solving TSP by Transiently Chaotic Neural Networks
  • A Recurrent Neural Network to Traveling Salesman Problem
  • Solving the Probabilistic Travelling Salesman Problem Based on Genetic Algorithm with Queen Selection Scheme
  • Niche Pseudo-Parallel Genetic Algorithms for Path Optimization of Autonomous Mobile Robot – A Specific Application of TSP
  • The Symmetric Circulant Traveling Salesman Problem

Download Free PDF / Read Online

Author(s): Federico Greco
Publisher: InTech
Format(s): PDF
File size: 6.58 MB
Number of pages: 202
Link: Download.

Similar Books:

  1. Tabu Search
Previous Post: « Tabu Search
Next Post: Simulated Annealing »

Primary Sidebar

Get Latest Updates

  • Facebook
  • Pinterest
  • RSS
  • Twitter
  • YouTube
  • About Us
  • Privacy policy
  • Disclaimer
  • Subscribe
  • Contact

Copyright © 2006–2025 OnlineProgrammingBooks.com