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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Lee Jacobson and Burak Kanber
About this chapter
Cite this chapter
Jacobson, L., Kanber, B. (2015). Traveling Salesman. In: Genetic Algorithms in Java Basics. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-0328-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4842-0328-6_4
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-0329-3
Online ISBN: 978-1-4842-0328-6
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books