Advertisement

Encodings for the Traveling Salesman Problem

  • Neng-Fa ZhouEmail author
  • Håkan Kjellerstrand
  • Jonathan Fruhman
Chapter
  • 411 Downloads
Part of the SpringerBriefs in Intelligent Systems book series (BRIEFSINSY)

Abstract

So far, this book has presented several techniques for modeling constraint satisfaction, dynamic programming, and planning problems. This chapter presents encodings for the Traveling Salesman Problem, comparing models for several solvers, including CP, SAT, MIP, and tabled planning.

Keywords

Traveling Salesman Problem Constraint Satisfaction Model Neiber Foreach Total Travel Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© The Author(s) 2015

Authors and Affiliations

  • Neng-Fa Zhou
    • 1
    Email author
  • Håkan Kjellerstrand
    • 2
  • Jonathan Fruhman
    • 3
  1. 1.Department of Computer and Information ScienceBrooklyn CollegeBrooklynUSA
  2. 2.hakank.orgMalmöSweden
  3. 3.Independent ResearcherNew YorkUSA

Personalised recommendations