Fast A* Heuristics for Solving the Travelling Salesman Problem

  • A Framework
  • Published 2012

Abstract

Within the Artificial Intelligence community, there is a great need for fast and accurate graph traversal algorithms, specifically those that find a path from a start to goal with minimum cost. Real world applications include streamlining logistics for package delivery services and optimizing the layout of computer chips. Games such as chess and sudoku, and… (More)

Topics

6 Figures and Tables

Cite this paper

@inproceedings{Framework2012FastAH, title={Fast A* Heuristics for Solving the Travelling Salesman Problem}, author={A Framework}, year={2012} }