Hint

Swipe to navigate through the chapters of this book

2015 | OriginalPaper | Chapter

Traveling Salesman

Authors: Lee Jacobson, Burak Kanber

Publisher: Apress

Published in: Genetic Algorithms in Java Basics

» Get access to the full version

Abstract

In this chapter, we are going to explore the traveling salesman problem and how it can be solved using a genetic algorithm. In doing so, we will be looking at the properties of the traveling salesman problem and how we can use those properties to design the genetic algorithm.

Please log in to get access to this content

To get access to this content you need the following product:

Computer Science Explorer

Purchase now

Title

Traveling Salesman

Book

Genetic Algorithms in Java Basics

Print ISBN: 978-1-4842-0329-3

Electronic ISBN: 978-1-4842-0328-6

https://doi.org/10.1007/978-1-4842-0328-6

DOI

https://doi.org/10.1007/978-1-4842-0328-6_4

Authors:

Lee Jacobson
Burak Kanber

Publisher

Apress

Sequence number